Multi-Objective AGV Task Allocation and Path Planning: Evaluation of Deterministic and Metaheuristic Algorithms

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.

Authors

Institutions

Publication Details

Journal
Automation
Published
2026-11-18
DOI
https://doi.org/10.3390/automation7060191
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Multi-Objective AGV Task Allocation and Path Planning: Evaluation of Deterministic and Metaheuristic Algorithms

Prema C. Thalaivar, Mamatha Mysore Nagarajan, Madhusudhan Krishnagiri Narasimhamurthy
4 links
Automation
Robotic Path Planning Algorithms
article

Multi-Objective AGV Task Allocation and Path Planning: Evaluation of Deterministic and Metaheuristic Algorithms

Prema C. Thalaivar, Mamatha Mysore Nagarajan, Madhusudhan Krishnagiri Narasimhamurthy
article en

Abstract

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.

AutomationVol. 7(6)
B.M.S. College of Engineering (IN), Visvesvaraya Technological University (IN)
Industry, innovation and infrastructure
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon