In order to improve the shortcomings of long calculation time and uneven path in the pathfinding process of A* algorithm, an optimization algorithm is proposed. First, on the basis of the A* algorithm, combined with the jump point search algorithm (JPS), the amount of calculation is reduced by replacing the expansion nodes in the A* algorithm with jump points. Secondly, a pruning algorithm is used to prune the obtained path to further remove unnecessary nodes in the path. Finally, the path is smoothed with a quadratic Bézier curve. At the end of paper, simulations were carried out in grid maps of different sizes, and experiments were carried out in the real environment. It is shorter and realizes the optimization of path length and smoothness.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.