Skip to content
Open access

Decentralized Path Planning With Supervisory Coordination for Multi-AGV Systems in Non-Standardized Automated Warehouses

2026 · IEEE Transactions on Automation Science and Engineering · Vol 23, pp. 13929-13949 · 0 citations · 46 references
Computer Science

TL;DR

The method combines hierarchical environment modeling based on Finite Time-Expanded Network with an Event-Driven Predictive Control strategy, enabling each AGV to independently compute congestion-aware and conflict-free paths based on locally solved optimization problems.

Abstract

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 environment modeling based on Finite Time-Expanded Network (FTEN) with an Event-Driven Predictive Control (EDPC) strategy, enabling each AGV to independently compute congestion-aware and conflict-free paths based on locally solved optimization problems. The FTEN leverages graph theory to model and analyze complex dynamic systems, whereas the EDPC strategy facilitates a proactive approach to avoiding congestion while reducing the computational cost of path planning. A central unit acts as a supervisory communication and information hub, periodically providing updated environmental and mission information to all vehicles. Conflict and deadlock resolution strategies, based on wait and restart and mission priority switch, support safe and efficient execution of missions. Validation tests on industrial warehouse scenarios demonstrate effective coordination, limited traffic congestion, and efficient mission execution. Note to Practitioners—The proposed work supports engineers, system integrators, and logistics providers in the design, validation, and deployment of AGV-based transportation systems within real-world warehouse environments. Traditional AGV coordination algorithms typically rely on grid-like layouts and unidirectional flows, which limit applicability in practical settings characterized by non-standardized environments with narrow two-way roads, irregular geometries, and dynamically evolving traffic conditions. The presented hybrid framework with decentralized path planning and supervisory coordination overcomes such limitations by enabling each AGV to independently compute its own path using updated environmental and traffic data. A central unit operates as a supervisory communication and information hub, distributing shared information without executing direct control over vehicle behavior. Integration into simulation environments, such as FlexSim, allows evaluation of throughput, congestion levels, and conflict resolution performance under realistic layout conditions and mission workloads. Application during the sales phase facilitates early validation of system feasibility and supports investment decisions through quantitative performance analysis.

Read PDF

Similar papers

Open access Aug 2026

A traffic management system for large and heterogeneous vehicles in narrow industrial environments

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. · 0 citations
Preprint Sep 2026

TRACS: A Geometry-Aware Framework for Scalable Multi-Agent Path Finding in Warehouses

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...

Siddhant Erande, Anuj Tiwari · 0 citations
Preprint Aug 2026

AOC-CBS: Anytime-Optimal Continuous-time Conflict-Based Search for Generalised Multi-Agent Path Finding

Anytime-Optimal Continuous-time Conflict-Based Search (AOC-CBS), an exact and solution-complete solver for Multi-Agent Path Finding, and preliminary experiments against the exact solver OC-CBS show AOC-CBS is comparable at finding optimal solutions while extending scalability from the tens to the hundreds of agents whe...

Alvin Combrink, Sabino Francesco Roselli, Martin Fabian · 0 citations
Open access Sep 2026

Hierarchical Reinforcement Learning for Multi-Robot Task Allocation and Path Planning in Digital Twin Enabled Smart Warehouses

As more companies embrace the use of autonomous mobile robots to organize their smart warehouses, one of the major issues facing them is the coordination of these fleets under very restrictive throughputs. Task allocation and path planning go hand in hand: if tasks are assigned without considering congestion, then ea...

Mohanad Ibrahim Elassadi · 0 citations
Preprint Aug 2026

Pivot-and-Station Multi-Agent Path Finding: Solvability, Complexity, and Algorithms

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
Open access Sep 2026

Task assignment and path planning methods for marine unmanned aerial vehicles based on improved intelligent optimisation algorithms

A two-stage framework that explicitly couples task-cluster generation with route-level feasibility verification is developed, providing algorithm-level evidence for coordinated marine-UAV task assignment and route-sequence planning, but do not establish real-world flight readiness or field-deployment performance.

Bo-Wen Tang, Hong-Yu Zhao, Hong-Miao Gao · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.