多智能体路径规划:面向噪声受限的混合燃料无人机
Multi Agent Pathfinding for Noise Restricted Hybrid Fuel Unmanned Aerial Vehicles
AI总结:
本文研究受位置相关噪声限制的混合燃料无人机机队的多智能体路径规划问题,通过搜索约束树并采用标号算法求解每个节点受噪声、燃料及冲突区域约束的最短路径子问题,最后给出多规模实验结果。
摘要:
多智能体路径规划(MAPF)旨在为多个智能体寻找从各自起点到目标位置的最优路径集合,使得各路径互不冲突。本文研究受位置相关噪声限制的混合燃料无人机机队的MAPF问题。我们通过搜索约束树来求解该问题,其中每个节点的子问题是一组受噪声和燃料约束及冲突区域避让限制的最短路径问题。我们提出一种标号算法来求解此子问题,其中冲突区域被视为动态障碍物。我们还给出了算法在不同图规模和智能体数量下的实验结果。
英文摘要:
Multi Agent Path Finding (MAPF) seeks the optimal set of paths for multiple agents from respective start to goal locations such that no paths conflict. We address the MAPF problem for a fleet of hybrid-fuel unmanned aerial vehicles which are subject to location-dependent noise restrictions. We solve this problem by searching a constraint tree for which the subproblem at each node is a set of shortest path problems subject to the noise and fuel constraints and conflict zone avoidance. A labeling algorithm is presented to solve this subproblem, including the conflict zones which are treated as dynamic obstacles. We present the experimental results of the algorithms for various graph sizes and number of agents.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。