Mobile robot path planning algorithm based on single-chain sequential backtracking Q-learning

Abstract

The invention provides a mobile robot path planning algorithm based on single-chain sequential backtracking Q-learning. According to the mobile robot path planning algorithm based on the single-chain sequential backtracking Q-learning, a two-dimensional environment is expressed by using a grid method, each environment area block corresponds to a discrete location, the state of a mobile robot at some moment is expressed by an environment location where the robot is located, the search of each step of the mobile robot is based on a Q-learning iterative formula of a non-deterministic Markov decision process, progressively sequential backtracking is carried out from the Q value of the tail end of a single chain, namely the current state, to the Q value of the head end of the single chain until a target state is reached, the mobile robot cyclically and repeatedly finds out paths to the target state from an original state, the search of each step is carried out according to the steps, and Q values of states are continuously iterated and optimized until the Q values are converged. The mobile robot path planning algorithm based on the single-chain sequential backtracking Q-learning has the advantages that the number of steps required for optimal path searching is far less than that of a classic Q-learning algorithm and a Q(lambda) algorithm, the learning time is shorter, and the learning efficiency is higher; and particularly for large environments, the mobile robot path planning algorithm based on the single-chain sequential backtracking Q-learning has more obvious advantages.

Description

technical field [0001] The invention relates to a method for path planning of a mobile robot by using an improved reinforcement learning algorithm, and belongs to the technical field of artificial intelligence. Background technique [0002] The path planning problem is one of the key technologies in the research of mobile robots. The path planning algorithm means that the mobile robot searches for an optimal or suboptimal collision-free path from the starting position to the target position according to a certain performance index. [0003] According to whether the environment information is completely known, path planning can be divided into offline global path planning with fully known environment information and online local path planning with completely or partially unknown environment information, also known as static path planning and dynamic path planning. At present, the research on global path planning in a certain environment is relatively mature, and the problem o...

AI Technical Summary

Problems solved by technology

[0010] Aiming at the shortcomings of the existing reinforcement learning algorithm in the path planning application of mobile robots in unknown environments, such as long learning time and slow convergence speed, a single-based algorithm that can quickly and efficiently search for the optimal path in complex environments is proposed. Path Planning Algorithm for Mobile Robot Based on Chain Sequential Backtracking Q-Learning

Images