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

多机器人团队的无碰撞时间最优路径参数化

Collision-free time-optimal path parameterization for multi-robot teams

University of Pennsylvania(宾夕法尼亚大学)

Katherine Mao, Igor Spasojevic, Malakhi Hopkins, M. Ani Hsieh, Vijay Kumar

AI总结:

针对杂乱环境中多机器人协调的计算难题,提出一种针对类车智能体的时间最优路径参数化(TOPP)算法,通过优先级队列和时空图调节时序以确保无碰撞和动态可行性,使完成时间减少10-20%。

摘要:

在杂乱环境中协调多机器人运动仍是一项计算上具有挑战性的任务。我们研究了在具有状态相关驱动约束的条件下,最小化机器人团队执行一组几何路径时间的问题。我们提出了一种针对多个类车智能体的时间最优路径参数化(TOPP)算法,通过调节每个机器人沿其分配路径的时序来确保无碰撞和动态可行性。该算法通过使用优先级队列确定每个机器人执行轨迹的顺序,同时在时空图中考虑与所有高优先级机器人可能发生的碰撞来实现这一目标。我们展示了与现有最先进方法相比,完成时间减少了10-20%,并通过仿真和硬件实验验证了我们的方法。

英文摘要:

Coordinating the motion of multiple robots in cluttered environments remains a computationally challenging task. We study the problem of minimizing the execution time of a set of geometric paths by a team of robots with state-dependent actuation constraints. We propose a Time-Optimal Path Parameterization (TOPP) algorithm for multiple car-like agents, where the modulation of the timing of every robot along its assigned path is employed to ensure collision avoidance and dynamic feasibility. This is achieved through the use of a priority queue to determine the order of trajectory execution for each robot while taking into account all possible collisions with higher priority robots in a spatiotemporal graph. We show a 10-20% reduction in makespan against existing state-of-the-art methods and validate our approach through simulations and hardware experiments.

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

↑