arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.14527cs.ROcs.AIcs.MA
收藏

面向自动化仓库的具有真实机器人动力学与相互依赖任务的多智能体路径规划

Multi-Agent Path Finding with Real Robot Dynamics and Interdependent Tasks for Automated Warehouses

NAVER LABS(纳弗实验室)

Vassilissa Lehoux-Lebacque, Tomi Silander, Christelle Loiodice, Seungjoon Lee, Albert Wang, Sofia Michel

AI总结:

本文研究自动化仓库中具有真实机器人动力学和相互依赖任务的在线订单配送MAPF问题,提出交错优先级规划处理任务依赖并设计VP*算法生成符合动力学的无碰撞轨迹,证明了完备性并在仿真和真实仓库中验证。

摘要:

多智能体路径规划(MAPF)是自动化仓库和工厂中机器人部署的重要优化问题。尽管已有大量研究,但大多数方法在环境和智能体方面进行了严重简化,导致所得算法在实际场景中不切实际。本文考虑仓库中在线订单配送的现实问题,其中一组机器人将属于每个订单的产品从货架运送到工作站。这产生了一系列相互依赖的取货和配送任务流,相关的MAPF问题包括计算完成这些任务的无碰撞真实机器人轨迹。为解决该MAPF问题,我们提出对标准优先级规划算法的扩展以处理相互依赖任务(交错优先级规划),以及一种新颖的Via-Point Star(VP*)算法,用于计算最优的、符合动力学的机器人轨迹,以在避开移动障碍物的同时访问一系列目标位置。我们证明了方法的完备性,并在仿真和真实仓库中进行了评估。

英文摘要:

Multi-Agent Path Finding (MAPF) is an important optimization problem underlying the deployment of robots in automated warehouses and factories. Despite the large body of work on this topic, most approaches make heavy simplifications, both on the environment and the agents, which make the resulting algorithms impractical for real-life scenarios. In this paper, we consider a realistic problem of online order delivery in a warehouse, where a fleet of robots bring the products belonging to each order from shelves to workstations. This creates a stream of inter-dependent pickup and delivery tasks and the associated MAPF problem consists of computing realistic collision-free robot trajectories fulfilling these tasks. To solve this MAPF problem, we propose an extension of the standard Prioritized Planning algorithm to deal with the inter-dependent tasks (Interleaved Prioritized Planning) and a novel Via-Point Star (VP*) algorithm to compute an optimal dynamics-compliant robot trajectory to visit a sequence of goal locations while avoiding moving obstacles. We prove the completeness of our approach and evaluate it in simulation as well as in a real warehouse.

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

↑