受限仓库多智能体取送的动态避让点选择
Original title: Dynamic Haven Selection for Multi-Agent Pickup and Delivery in Constrained Warehouses
IndustryAI 70
Source: arXiv cs.ROPublish time unverified
arXiv:2608.26939v1 Announce Type: cross Abstract: Space-efficient warehouse layouts often contain single-agent-width aisles and dead-end workstations where robots have few places to wait without blocking others. In Multi-Agent Pickup and Delivery (MAPD) on such constrained layouts, robots must accept online pickup-delivery tasks while preserving protected waiting locations called Havens.