This work introduces Pivot-and-Station Multi-Agent Path Finding (PS-MAPF), a MAPF variant in which a subset of tasked agents must each visit one of a set of interchangeable pivots before the entire fleet terminates at anonymous stations, one agent per station.
Andrea Di Nezza, Mihir P Patel, F. Fagnani et al.· 0 citations
A hybrid architecture with decentralized path planning and supervisory coordination is proposed for multi-Automated Guided Vehicle (AGV) systems operating in realistic, non-standardized (i.e., non grid-like) automated warehouses characterized by bidirectional roads and complex layouts. The method combines hierarchical...
Silvia Proia, G. Cavone, Marino Calefati et al.· IEEE Transactions on Automat...· 0 citations
The coordination of Automated Guided Vehicles (AGVs) in high-density industrial environments represents a critical challenge within Logistics 4.0, as traditional traffic management methods often lead to inefficiencies caused by negotiation-based priority assignment. To overcome the resulting limitations, this paper pre...
A. Bonetti, Silvia Proia, Simone Guidetti et al.· The international journal of...· 0 citations
The Colored Traveling Salesman Problem (CTSP) is a seminal generalization of the Multiple TSP, where colors represent the heterogeneity of salesmen and their city visits. This work presents a time-critical extension, termed the Time-Critical CTSP (T-CTSP). By emphasizing the timing of visits, T-CTSP explicitly captures...
Y. Duan, Jun Li· IEEE Transactions on Automat...· 0 citations
Cross-border trade is growing fast. The same is true for urban distribution, e-commerce fulfillment, port transfer, and cold-chain transportation. Because of that, land-logistics decisions need to be workable in practice and flexible enough to adjust, especially in heavy-traffic places like Singapore. This study sets o...
Jing-Xiang Wang, Xin-Yue Cai, Yu-Feng Xin et al.· Computers and artificial int...· 0 citations
We present a tractable approach to grid-based multi-agent path planning for inspection tasks that minimizes task completion time. We require all agents to collectively inspect all targets while (i) maintaining a user-defined separation distance, (ii) returning to charging stations as needed, and (iii) avoiding obstacle...
Kento Tomita, V. Petrov, Keishi Nishikawa et al.· IEEE Robotics and Automation...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.