Multi-Objective AGV Task Allocation and Path Planning: Evaluation of Deterministic and Metaheuristic Algorithms
Automation · 18.11.2026 · 7 (6) · 191
DOI: 10.3390/automation7060191 ↗Kurz gefasst
Fachartikel in der Zeitschrift Automation, online erschienen am 18.11.2026. Verfasst von Prema C. Thalaivar und 2 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Automated guided vehicles (AGVs) enable material transport in automated manufacturing facilities, where fleet efficiency depends on coordinating task allocation and route generation while balancing completion time, energy consumption, and travel distance. This study develops a Python(version: 3.14.6)-based multi-objective evaluation framework for offline AGV path planning and task assignment in grid-based warehouse environments with known, static obstacles. Particle swarm optimization (PSO) and the gravitational search algorithm (GSA) are evaluated against deterministic A* search across warehouse scenarios with different layouts and obstacle configurations. Each planner is integrated into a common greedy assignment procedure that processes tasks according to priority and earliest-start ordering. For each task, candidate AGVs are evaluated using planned routes from their current positions to the pickup location and subsequently to the delivery location. Assignment decisions minimize a weighted cost combining estimated completion time, route energy consumption, and travel distance. Fleet-level performance is assessed using makespan, defined as the maximum completion time across AGVs, together with aggregate energy consumption and total travel distance. Energy estimates account for motion-related costs, including acceleration and turning, enabling comparisons beyond geometric path length alone. The benchmark results indicate that A* provides consistently competitive performance, particularly in energy consumption, whereas PSO achieves favorable makespan–distance trade-offs in selected scenarios. As a future extension toward online path planning, the A* algorithm, which supports real-time path generation, is integrated with NSGA-II to optimize task assignment. A Pareto-based analysis is then conducted to compare the performance of the conventional A* approach with that of the proposed A*–NSGA-II framework, highlighting the trade-offs among the selected operational objectives. The findings demonstrate that shorter travel distances or earlier task completion do not necessarily imply lower energy consumption, highlighting the need to select planning methods according to warehouse geometry, fleet workload, and operational priorities.
Zitieren
APA
Thalaivar, P. C., Narasimhamurthy, M. K., & Nagarajan, M. M. (2026). Multi-Objective AGV Task Allocation and Path Planning: Evaluation of Deterministic and Metaheuristic Algorithms. Automation, 7(6), 191. https://doi.org/10.3390/automation7060191
Vancouver
Thalaivar PC, Narasimhamurthy MK, Nagarajan MM. Multi-Objective AGV Task Allocation and Path Planning: Evaluation of Deterministic and Metaheuristic Algorithms. Automation. 2026;7(6):191. doi:10.3390/automation7060191
BibTeX
@article{Thalaivar2026,
author = {Thalaivar, Prema C. and Narasimhamurthy, Madhusudhan Krishnagiri and Nagarajan, Mamatha Mysore},
title = {Multi-Objective AGV Task Allocation and Path Planning: Evaluation of Deterministic and Metaheuristic Algorithms},
journal = {Automation},
year = {2026},
volume = {7},
number = {6},
pages = {191},
doi = {10.3390/automation7060191}
}
EUVIMED