Robot Path Planning Under Complicated Path Simulation Optimization Method
LI Hong-shen
Abstract
LI Hong-shen
Abstract
Study the method for robot path planning under complicated paths to enhance the rationality of planning.Robot in the face of the complex environment,path selection with a lot of mistakes,lead to choose low precision.In order to avoid the disadvantages of the traditional algorithm,is proposed based on an autonomous agent method for robot path planning under complicated path.Detailed description of relevant principle of robot path planning,the robot path in a reasonable manner of coding,according to the above path to establish initial population,fitness function for the population,against all the paths in the population of crossover and mutation operations,and the robot path planning under complicated path is the result.The experimental results show that the algorithm presented in this paper for robot path planning under complicated path,can effectively improve the rationality of the path planning,so as to meet the needs of users.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Study the method for robot path planning under complicated paths to enhance the rationality of planning.Robot in the face of the complex environment,path selection with a lot of mistakes,lead to choose low precision.In order to avoid the disadvantages of the traditional algorithm,is proposed based on an autonomous agent method for robot path planning under complicated path.Detailed description of relevant principle of robot path planning,the robot path in a reasonable manner of coding,according to the above path to establish initial population,fitness function for the population,against all the paths in the population of crossover and mutation operations,and the robot path planning under complicated path is the result.The experimental results show that the algorithm presented in this paper for robot path planning under complicated path,can effectively improve the rationality of the path planning,so as to meet the needs of users.
Key concepts: Motion planning, Any-angle path planning, Path (computing), Robot, Crossover, Population, Mathematical optimization, Computer science