Improved JPS Algorithm Using New Jump Point for Path Planning of Mobile Robot
Authors:
- 1 August 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2463-2468
Abstract
In view of the discussion of robot collision in complex environment due to control or positioning error and robot size, this paper presents a jump point search algorithm with safe distance(SD-JPS) for path planning. Based on the fast jump point search method, a new definition of the jump point and a node domain matrix are proposed to improve the JPS algorithm. The SD-JPS algorithm can select the any size of the node domain matrix to obtain the safe distance between the robot and the obstacle, and improve the flexibility of the robot movement. In addition, the different effects of SD-JPS and $A{*}$ algorithm on the number of search nodes, planed routes and planning time are also studied. Simulation results show that the improved JPS algorithm can obtain different safety distances and plan the optimal path with shorter time.
Keywords
This publication has 6 references indexed in Scilit:
- Improved Astar Algorithm for Path Planning of Marine Robot2018
- Path planning of automated guided vehicles based on improved A-Star algorithm2015
- Cooperative Path Planning for Target Tracking in Urban Environments Using Unmanned Air and Ground VehiclesIEEE/ASME Transactions on Mechatronics, 2015
- A novel potential field method for path planning of mobile robot2013
- Online Graph Pruning for Pathfinding On Grid MapsProceedings of the AAAI Conference on Artificial Intelligence, 2011
- Optimal and efficient path planning for partially-known environments2002