Systems Engineering and Electronics ›› 2021, Vol. 43 ›› Issue (12): 3635-3642.doi: 10.12305/j.issn.1001-506X.2021.12.26

• Systems Engineering • Previous Articles     Next Articles

Agent path planning based on regular hexagon grid JPS algorithm

Wenming WANG1, Jialu DU2,*   

  1. 1. School of Marine Engineering, Dalian Maritime University, Dalian 116000, China
    2. School of Marine Electrical Engineering, Dalian Maritime University, Dalian 116000, China
  • Received:2021-01-13 Online:2021-11-24 Published:2021-11-30
  • Contact: Jialu DU

Abstract:

By constructing a regular hexagon grid map and modifying the rules of neighbors pruning, forced neighbors judgment and jump point search (JPS) strategy of the traditional JPS algorithm, a new regular hexagon grid JPS algorithm is proposed, which is used to solve the path planning problem of the agent on the environment map with obstacles. The path planning simulations and the simulation comparisons with the traditional square grid A* algorithm and JPS algorithm are carried out on Pycharm platform. The simulation results show that the regular hexagon grid JPS algorithm can plan paths better, avoiding the unsafely crossing corner behaviors, reducing the number of turnings and the time of path planning, thus the algorithm improves the quality and efficiency of path planning.

Key words: regular hexagon, grid map, jump point search (JPS) algorithm, path planning

CLC Number: 

[an error occurred while processing this directive]