arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1805.07069cs.AI
收藏

基于蒙特卡罗树搜索和策略网络的多功能认知雷达任务调度

Multifunction Cognitive Radar Task Scheduling Using Monte Carlo Tree Search and Policy Networks

University of Toronto(多伦多大学);Defence Research and Development Canada(加拿大国防研究与发展部)

Mahdi Shaghaghi, Raviraj S. Adve, Zhen Ding

摘要:

现代雷达可以设计成执行多种功能,例如监视、跟踪和火力控制。每个功能都要求雷达执行多个发射-接收任务。雷达资源管理(RRM)模块对这些任务的参数选择、优先级排序和调度做出决策。RRM在过载情况下变得特别具有挑战性,其中一些任务可能需要延迟甚至丢弃。一般来说,任务调度是一个NP难问题。在这项工作中,我们开发的分支定界(B&B)的方法,获得最佳的解决方案,但在指数计算复杂性。另一方面,探试法具有低复杂度,但提供相对较差的性能。我们求助于基于机器学习的技术来解决这个问题;具体来说,我们提出了一种基于蒙特卡罗树搜索方法的近似算法。除了使用约束和支配规则来消除搜索树中的节点外,我们还使用策略网络来帮助减少搜索的宽度。这样的网络可以使用通过在具有可行复杂度的问题上离线运行B&B方法获得的解决方案来训练。我们表明,该方法提供了接近最佳的性能,但与计算复杂性的数量级小于B&B算法。

英文摘要:

A modern radar may be designed to perform multiple functions, such as surveillance, tracking, and fire control. Each function requires the radar to execute a number of transmit-receive tasks. A radar resource management (RRM) module makes decisions on parameter selection, prioritization, and scheduling of such tasks. RRM becomes especially challenging in overload situations, where some tasks may need to be delayed or even dropped. In general, task scheduling is an NP-hard problem. In this work, we develop the branch-and-bound (B&B) method which obtains the optimal solution but at exponential computational complexity. On the other hand, heuristic methods have low complexity but provide relatively poor performance. We resort to machine learning-based techniques to address this issue; specifically we propose an approximate algorithm based on the Monte Carlo tree search method. Along with using bound and dominance rules to eliminate nodes from the search tree, we use a policy network to help to reduce the width of the search. Such a network can be trained using solutions obtained by running the B&B method offline on problems with feasible complexity. We show that the proposed method provides near-optimal performance, but with computational complexity orders of magnitude smaller than the B&B algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑