Sep 2026· IEEE International Conference on Emerging Technologies and Factory Automation· pp. 1-8· 1 citation· 24 references
Computer Science
Abstract
This paper addresses scalable Multi Agent Path Finding (MAPF) for large fleets of Automated Guided Vehicles (AGVs) in warehousing and production environments, where centralized planning becomes intractable due to NP-hard complexity and exponential growth of the joint state space. We propose a hierarchical decentralized planning approach, which leverages the functional structure of the environment to decouple and parallelize planning and is guided by novel congestionaware cost heuristics on a high-level metagraph representation. To efficiently cope with local changes in the planning problem resulting from parallel planning, we further present CARP-LPA*, combining time-window-based planning of Context Aware Route Planning (CARP) with localized replanning of Lifelong Planning A* (LPA*). In simulation studies, we evaluate our methods on representative scenarios and compare the effectiveness of three proposed heuristics in approximating the impact of congestion on planning decisions. We find that the proposed hierarchical decentralized structure while inheriting scalability and flexibility of the decentralized MAPF algorithms, delivers promising trajectory accuracy compared to the ground-truth centralized solution, with accuracies between 66.7% and 100%. The novel cost functions introduced in this work improve these results even further, leading to a minimum accuracy of 83.3%.
A hierarchical, reservation-based, multi-resolution planner for discrete-time grid environments, including deadline-aware priority guidelines to resolve reservation contention, boundary-based validation of abstract connectivity to avoid phantom links, and a wait-and-retry fallback when planning temporarily fails are pr...
Gicu Rata, Liviu Octavian Mafteiu-Scai· SAR Journal - Science and Re...· 0 citations
Large scale warehouse automation relies on efficient multi agent path finding (MAPF) to coordinate thousands of robots in structured environments. Existing MAPF algorithms primarily improve conflict resolution while representing warehouses as generic navigation graphs, overlooking their inherent geometric structure and...
The proposed hierarchical multi-agent proximal policy optimization framework can reduce total airlines' operational costs—including direct operating cost and capital cost and achieves a computation speedup in comparison with a conventional optimization baseline.
Li-Jing Liu, James M. Shihua, Qi-Yu Yan et al.· MATEC Web of Conferences· 0 citations
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...
PACT (Plan-Augmented Coordination via Trace-graphs) improves solution quality in dynamic problems relative to baselines and exhibits the best transfer to larger instances on which, remarkably, it outperforms centralized oracles with privileged access to instance uncertainty.
Xiao Zhou, Alex Schutz, Victor-Alexandru Darvariu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.