arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.24908cs.ROcs.AIcs.MA
收藏

集成多无人机任务分配、任务序列和最优轨迹生成在障碍密集的3D环境中

Integrated Multi-Drone Task Allocation, Sequencing, and Optimal Trajectory Generation in Obstacle-Rich 3D Environments

Aerospace Engineering Department, Faculty of Aeronautics and Astronautics, Kocaeli University(科贾埃利大学航空与航天学院航空航天工程系);Interdisciplinary Research Center for Aviation and Space Exploration, KFUPM(法赫德国王石油矿产大学航空与空间探索跨学科研究中心);Mechanical Engineering Department, Faculty of Aeronautics and Astronautics, Kocaeli University(科贾埃利大学航空与航天学院机械工程系)

Yunes Alqudsi, Murat Makaraci

AI总结:

本文提出IMD-TAPP框架,通过结合离散任务规划和连续轨迹合成,解决多无人机在障碍密集环境中的任务分配、序列规划和安全轨迹生成问题,实现动态可行且无碰撞的高效路径。

摘要:

在障碍密集的三维环境中协调无人机团队需要将离散的任务规划(决定哪些无人机执行哪些目标及顺序)与连续时间轨迹合成(强制避障和动态可行性)相结合。本文介绍IMD-TAPP(集成多无人机任务分配和路径规划),一种端到端框架,共同解决多目标分配、巡回序列和安全轨迹生成问题。IMD-TAPP首先将工作空间离散化为3D导航图,并通过基于图的路径寻找计算障碍感知的机器人到目标和目标到目标的旅行成本。这些成本随后嵌入到注入粒子群优化(IPSO)方案中,通过多个线性分配进行引导,以高效探索耦合的分配/排序替代方案,并最小化任务完成时间。最后,生成的航点巡回通过生成和优化程序转换为时间参数化的最小 snap 轨迹,该程序配备迭代验证障碍清除和机器人间分离的迭代验证,触发重新规划当安全边距被违反时。广泛的MATLAB模拟在障碍密集的3D场景中表明,IMD-TAPP一致产生动态可行、无碰撞的轨迹,同时实现竞争性的完成时间。在具有两个无人机执行多个目标的代表性案例研究中,所提出的方法在136秒内达到最小任务时间,同时在整个执行过程中维持所需的安全约束。

英文摘要:

Coordinating teams of aerial robots in cluttered three-dimensional (3D) environments requires a principled integration of discrete mission planning-deciding which robot serves which goals and in what order -- with continuous-time trajectory synthesis that enforces collision avoidance and dynamic feasibility. This paper introduces IMD-TAPP (Integrated Multi-Drone Task Allocation and Path Planning), an end-to-end framework that jointly addresses multi-goal allocation, tour sequencing, and safe trajectory generation for quadrotor teams operating in obstacle-rich spaces. IMD--TAPP first discretizes the workspace into a 3D navigation graph and computes obstacle-aware robot-to-goal and goal-to-goal travel costs via graph-search-based pathfinding. These costs are then embedded within an Injected Particle Swarm Optimization (IPSO) scheme, guided by multiple linear assignment, to efficiently explore coupled assignment/ordering alternatives and to minimize mission makespan. Finally, the resulting waypoint tours are transformed into time-parameterized minimum-snap trajectories through a generation-and-optimization routine equipped with iterative validation of obstacle clearance and inter-robot separation, triggering re-planning when safety margins are violated. Extensive MATLAB simulations across cluttered 3D scenarios demonstrate that IMD--TAPP consistently produces dynamically feasible, collision-free trajectories while achieving competitive completion times. In a representative case study with two drones serving multiple goals, the proposed approach attains a minimum mission time of 136~s while maintaining the required safety constraints throughout execution.

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

↑