Improving AGV path planning efficiency using Genetic Algorithms with Hamming distance-based initialization

english

2025

volume 20, issue 3

automated guided vehicles (AGV)   combinatorial optimization   Hamming distance initialization   Robot operating system 2 (ROS 2)   warehouse routing

Univerza v Mariboru, Fakulteta za strojništvo, Inštitut za proizvodno strojništvo
(Obvezni izvod spletne publikacije)

This paper presents a Genetic Algorithm (GA) framework for warehouse navigation as a Travelling Salesman Problem (TSP) variant for Automated Guided Vehicles (AGVs). The warehouse layout is represented as a graph, where pick-up locations serve as terminal nodes. A distance matrix, computed via Breadth-First Search (BFS) enables efficient route evaluation. To promote diversity in the initial population, a Hamming distance-based vectorized initialization strategy is employed, ensuring that the chromosomes are maximally distinct. The GA balances exploration and exploitation by dynamically adjusting the fitness function. Early generations emphasize diversity, while later ones focus on solution refinement, improving convergence and avoiding premature stagnation. Our key contribution demonstrates that the Hamming distance-based approach achieves comparable or better results with significantly fewer chromosomes. This reduces computational cost and runtime, making the method well-suited for real-time AGV routing in warehouses. The framework is adaptable to structured environments and shows strong potential for integration into real-world logistics and robotics applications. Future work will focus on optimizing the algorithm and integrating it into the ROS 2 environment.

01.12.2025