Adaptive Path-Planning for Autonomous Robots: A UCH-Enhanced Q-Learning Approach
Wei Liu, Ruiyang Wang, Haonan Wang, Guangwei Liu
TL;DR
This work addresses slow convergence and local optima in Q-learning for robot path planning by introducing the Improved Q-learning (IQL) framework. It fuses a Path Adaptive Collaborative Optimization (PACO) for smarter Q-table initialization with a Utility-Controlled Heuristic (UCH) for dynamic reward shaping, including distance-based metric considerations. Empirical results on raster maps of varying sizes show that IQL achieves faster convergence, higher stability, and improved path quality compared to several Q-learning variants, with notable gains using Chebyshev distance. The approach promises more efficient and reliable autonomous navigation in complex environments, offering practical impact for real-time robotic path planning.
Abstract
Q-learning methods are widely used in robot path planning but often face challenges of inefficient search and slow convergence. We propose an Improved Q-learning (IQL) framework that enhances standard Q-learning in two significant ways. First, we introduce the Path Adaptive Collaborative Optimization (PACO) algorithm to optimize Q-table initialization, providing better initial estimates and accelerating learning. Second, we incorporate a Utility-Controlled Heuristic (UCH) mechanism with dynamically tuned parameters to optimize the reward function, enhancing the algorithm's accuracy and effectiveness in path-planning tasks. Extensive experiments in three different raster grid environments validate the superior performance of our IQL framework. The results demonstrate that our IQL algorithm outperforms existing methods, including FIQL, PP-QL-based CPP, DFQL, and QMABC algorithms, in terms of path-planning capabilities.
