让异构机器人在复杂障碍环境中自适应分配任务并规划路径
Adaptive Obstacle-Aware Task Assignment and Planning for Heterogeneous Robot Teaming
- 用自适应哈顿采样动态调整任务点分布,避开障碍密集区
- 结合聚类拍卖与加权选择,实现异构机器人高效协同
- 支持大模型实时理解指令,适合真实场景快速部署
多智能体任务分配与规划(MATP)在复杂障碍环境中面临可扩展性、空间推理和自适应性挑战。本文提出OATH——一种面向异构机器人团队的自适应障碍感知任务分配与规划方法。首先,设计了首个应用于MATP的自适应哈顿序列地图,根据障碍分布动态调整采样密度;其次,提出聚类-拍卖-选择框架,融合障碍感知聚类、加权拍卖与簇内任务选择,实现异构机器人的有效协同,同时保持可扩展性与次优分配性能。此外,框架利用大语言模型解析人类指令并实时引导规划器。在NVIDIA Isaac Sim仿真与TurtleBot真实硬件平台上验证,相比当前最优基线,OATH显著提升任务分配质量、可扩展性、对动态变化的适应性及整体执行性能。
原文摘要 · Abstract (English)
Multi-Agent Task Assignment and Planning (MATP) has attracted growing attention but remains challenging in terms of scalability, spatial reasoning, and adaptability in obstacle-rich environments. To address these challenges, we propose OATH - Adaptive Obstacle-Aware Task Assignment and Planning for Heterogeneous Robot Teaming - which advances MATP by introducing a novel obstacle-aware strategy for task assignment. First, we develop an adaptive Halton sequence map, the first known application of Halton sampling with obstacle-aware adaptation in MATP, which adjusts sampling density based on obstacle distribution. Second, we propose a cluster-auction-selection framework that integrates obstacle-aware clustering with weighted auctions and intra-cluster task selection. These mechanisms jointly enable effective coordination among heterogeneous robots while maintaining scalability and suboptimal allocation performance. In addition, our framework leverages an LLM to interpret human instructions and directly guide the planner in real time. We validate OATH in both NVIDIA Isaac Sim and real-world hardware experiments using TurtleBot platforms, demonstrating substantial improvements in task assignment quality, scalability, adaptability to dynamic changes, and overall execution performance compared to state-of-the-art MATP baselines. A project website is available at https://llm-oath.github.io/.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。