Abstract
Cooperative autonomous robotic systems have significant potential for executing complex multi-task missions across space, air, ground, and maritime domains. But they commonly operate in remote, dynamic and hazardous environments, requiring rapid in-mission adaptation without reliance on fragile or slow communication links to centralised compute. Fast, on-board replanning algorithms are therefore needed to enhance resilience. Reinforcement Learning shows strong promise for efficiently solving mission planning tasks when formulated as Travelling Salesperson Problems (TSPs), but existing methods: 1) are unsuitable for replanning, where agents do not start at a single location; 2) do not allow cooperation between agents; 3) are unable to model tasks with variable durations; or 4) lack practical considerations for on-board deployment. Here we define the Cooperative Mission Replanning Problem as a novel variant of multiple TSP with adaptations to overcome these issues, and develop a new encoder/decoder-based model using Graph Attention Networks and Attention Models to solve it effectively and efficiently. Using a simple example of cooperative drones, we show our replanner consistently (90% of the time) maintains performance within 10% of the state-of-the-art LKH3 heuristic solver, whilst running 85-370 times faster on a Raspberry Pi. This work paves the way for increased resilience in autonomous multi-agent systems.
Abstract (translated)
合作自主机器人系统在执行跨空间、空中、地面和海洋领域的复杂多任务时具有巨大潜力。然而,这些系统通常在偏远、动态且危险的环境中运行,需要快速适应任务需求,而无需依赖脆弱或缓慢的通信链路与集中式计算资源。因此,需要高效的车载重规划算法来增强系统的鲁棒性。强化学习(Reinforcement Learning)显示出可以有效地解决作为旅行商问题(TSPs)形式化的问题,但在现有的方法中:1) 不适用于重新规划场景,在这种场景下代理不会从单一位置开始;2) 不能促进代理之间的合作;3) 无法模拟任务的可变持续时间;4) 缺乏适合车载部署的实际考虑。在这里,我们定义了“协作任务重规划问题”作为多个TSP的一个新变体,并进行了适应性改进以克服上述挑战。此外,我们开发了一种基于编码器/解码器模型的新方法,该模型结合图注意力网络(Graph Attention Networks)和注意力机制来有效且高效地解决这一问题。 通过一个简单的合作无人机示例,我们展示了我们的重规划算法能够在90%的时间内保持性能,在性能上仅比最先进的LKH3启发式求解器低10%,同时在树莓派设备上的运行速度提高了85到370倍。这项工作为提高自主多代理系统的鲁棒性铺平了道路。
URL
https://arxiv.org/abs/2506.06094