多无人机在复杂三维环境中的任务分配、路径规划与安全轨迹生成一体化求解。
Integrated Multi-Drone Task Allocation, Sequencing, and Optimal Trajectory Generation in Obstacle-Rich 3D Environments
- 构建3D导航图,结合图搜索计算避障代价,支撑任务分配与排序。
- 采用改进粒子群算法优化任务分配与路径顺序,使任务完成时间最短达136秒。
- 端到端生成满足动态约束的无碰撞轨迹,适合高密度复杂场景应用。
在障碍物密集的三维环境中协调多架飞行机器人,需将离散的任务规划(决定哪个机器人服务哪些目标及顺序)与连续时间轨迹生成(保证避碰和动力学可行性)进行系统集成。本文提出端到端框架IMD-TAPP(多无人机任务分配与路径规划一体化),联合解决多目标分配、航程排序与安全轨迹生成问题。首先将工作空间离散化为3D导航图,通过基于图搜索的方法计算避障的机器人-目标与目标-目标移动代价。这些代价嵌入注入式粒子群优化(IPSO)框架,由多重线性分配引导,高效探索耦合的任务分配与排序组合,最小化任务完工时间。最后,将得到的航点路径转化为时间参数化的最小蹦跳轨迹,通过生成-优化流程并迭代验证障碍物间距与机间分离安全裕度,若不满足则触发重规划。大量MATLAB仿真表明,IMD-TAPP能持续生成动力学可行、无碰撞的轨迹,完成时间具有竞争力。在两架无人机执行多个目标的典型案例中,该方法实现最低任务时长136秒,全程满足安全约束。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。