日本フィジカルAI新聞

世界のフィジカルAIを、日本語で。

週刊ニュースレター購読
マルチエージェント計画arXiv:2610.24549

人協調倉庫における混雑考慮型オンライン多エージェント集配アルゴリズムCARVS

CARVS: A Congestion-Aware Algorithm for Online Multi-Agent Pickup-and-Delivery in Human-Collaborative Warehouses

シェア:XThreadsFacebookLINEはてブBluesky

人間と協働する倉庫での多エージェント集配問題(MAPDwHC)を定式化し、タスク交換や検証・ランダム初期化を組み込んで混雑を抑えリアルタイム応答性を高めるCARVSアルゴリズムを提案した論文。

著者: Chaoran Li, Zeyuan Zhao, Shao Zhang

分類: cs.MA, cs.AI, cs.RO

原文アブストラクト

Intelligent warehouse systems have transformed logistics by integrating robots with minimal infrastructure changes, boosting efficiency and optimizing workflows compared to traditional human-only operations. However, human-robot collaboration introduces new challenges, particularly due to human uncertainty, which leads to dynamic interactions and unpredictable behavior. To address these complexities, this paper presents the Multi-Agent Pickup-and-Delivery with Human Collaboration (MAPDwHC) problem, an extension of the Multi-Agent Pickup-and-Delivery (MAPD) problem that incorporates human unpredictability. This problem adds key constraints, such as dynamic obstacles caused by robots temporarily blocking paths when interacting with humans, and the need for real-time responsiveness. We formalize the MAPDwHC problem with additional constraints and properties. Based on this problem setting, we propose the CARVS algorithm, which improves task assignment and path planning by integrating task swapping, validation checks, and random initialization. CARVS reduces congestion, enhances adaptability to human-robot interactions, and ensures real-time responsiveness. Simulation results show that CARVS significantly reduces timeouts of path planning in large-scale scenarios where traditional MAPD algorithms fail, improving both efficiency and scalability.

関連論文

PR本紙発行元 EmplifAI