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

富障碍环境中四旋翼集群的去中心化无死锁轨迹规划——扩展版

Decentralized Deadlock-free Trajectory Planning for Quadrotor Swarm in Obstacle-rich Environments -- Extended version

Seoul National University(首尔国立大学);Automation and Systems Research Institute(自动化与系统研究院)

Jungwon Park, Inkyu Jang, H. Jin Kim

AI总结:

针对富障碍、通信受限环境下四旋翼集群轨迹规划易死锁的问题,提出结合基于栅格MAPP、子目标优化与LSC的去中心化MATP算法,经多场景仿真与10架真机验证,可实现无死锁安全规划且性能优于此前工作。

摘要:

本文提出一种去中心化多智能体轨迹规划(MATP)算法,可保证在通信范围受限的富障碍环境中生成安全、无死锁的轨迹。该算法采用基于栅格的多智能体路径规划(MAPP,多智能体路径规划)算法解决死锁问题,并引入子目标优化方法,使智能体收敛到MAPP生成的航点且不产生死锁。此外,算法通过采用线性安全走廊(LSC)确保优化问题的可行性与避障性。我们验证了无论通信范围如何,该算法在随机森林和密集迷宫环境中均不会产生死锁,且在飞行时间与飞行距离上优于我们此前的工作。我们通过10架四旋翼的硬件演示验证了该算法的有效性。

英文摘要:

This paper presents a decentralized multi-agent trajectory planning (MATP) algorithm that guarantees to generate a safe, deadlock-free trajectory in an obstacle-rich environment under a limited communication range. The proposed algorithm utilizes a grid-based multi-agent path planning (MAPP) algorithm for deadlock resolution, and we introduce the subgoal optimization method to make the agent converge to the waypoint generated from the MAPP without deadlock. In addition, the proposed algorithm ensures the feasibility of the optimization problem and collision avoidance by adopting a linear safe corridor (LSC). We verify that the proposed algorithm does not cause a deadlock in both random forests and dense mazes regardless of communication range, and it outperforms our previous work in flight time and distance. We validate the proposed algorithm through a hardware demonstration with ten quadrotors.

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

↑