arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.06531cs.RO
收藏

具有最大航程约束的多机器人任务分配与路径规划

Multi-robot Task Allocation and Path Planning with Maximum Range Constraints

Institute of Cyber-Systems and Control, Zhejiang University(浙江大学 cyber-system 控制研究所);Polytechnic Institute of Zhejiang University(浙江大学理工学院);Ocean College, Zhejiang University(浙江大学海洋学院);Institute of Intelligent and Software Technology, Hangzhou Dianzi University(杭州电子科技大学智能与软件技术研究所)

Gang Xu, Yuchen Wu, Sheng Tao, Yifan Yang, Tao Liu, Tao Huang, Huifeng Wu, Yong Liu

AI总结:

针对大型工作空间中多机器人受最大航程限制的问题,提出集成快速路径规划、航程感知拍卖与惰性拍卖策略的 RangeTAP 方法,并通过仿真和真实实验验证其有效性。

摘要:

本信函提出了一种新颖的多机器人任务分配与路径规划方法,该方法在大型工作空间中考虑机器人的最大航程约束,使机器人能够在其航程限制内完成分配的任务。首先,我们开发了一种快速路径规划器,以高效求解全局路径。随后,我们提出一种创新的基于拍卖的方法,将路径规划器集成到拍卖阶段用于奖励计算,同时考虑机器人的航程限制。该方法考虑额外的避障行驶距离,而非理想的直线距离,从而解决任务分配与路径规划之间的耦合问题。此外,为避免迭代过程中的冗余计算,我们采用惰性拍卖策略来加快任务分配的收敛。最后,我们通过大量仿真和真实世界实验验证了所提方法的有效性和应用潜力。该方法的实现代码将在 https://github.com/wuuya1/RangeTAP 提供。

英文摘要:

This letter presents a novel multi-robot task allocation and path planning method that considers robots' maximum range constraints in large-sized workspaces, enabling robots to complete the assigned tasks within their range limits. Firstly, we developed a fast path planner to solve global paths efficiently. Subsequently, we propose an innovative auction-based approach that integrates our path planner into the auction phase for reward computation while considering the robots' range limits. This method accounts for extra obstacle-avoiding travel distances rather than ideal straight-line distances, resolving the coupling between task allocation and path planning. Additionally, to avoid redundant computations during iterations, we implemented a lazy auction strategy to speed up the convergence of the task allocation. Finally, we validated the proposed method's effectiveness and application potential through extensive simulation and real-world experiments. The implementation code for our method will be available at https://github.com/wuuya1/RangeTAP.

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

↑