Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An Improved Path Planning Algorithm for Indoor Mobile Robots in Partially-Known Environments

An Improved Path Planning Algorithm for Indoor Mobile Robots in Partially-Known Environments In this paper, an improved path planning algorithm with two stages is proposed for indoor mobile robots to help them navigate across dynamic crowded areas. First, an environmental model is built with a restricted tangent graph, and the shortest path is determined before the robot starts to move. Second, the obtained path is employed to create virtual corridor distances. This featured data along with local range-finder readings are used to train a deep Q-learning agent to efficiently plan the robot’s motion. Simulation results show above 70% success rate with significant improvements compared with a counterpart algorithm in terms of path length, learning cost, and generalization capability. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Automatic Control and Computer Sciences Springer Journals

An Improved Path Planning Algorithm for Indoor Mobile Robots in Partially-Known Environments

Loading next page...
 
/lp/springer-journals/an-improved-path-planning-algorithm-for-indoor-mobile-robots-in-r3mM24GAQQ

References (35)

Publisher
Springer Journals
Copyright
Copyright © Allerton Press, Inc. 2023. ISSN 0146-4116, Automatic Control and Computer Sciences, 2023, Vol. 57, No. 1, pp. 1–13. © Allerton Press, Inc., 2023.
ISSN
0146-4116
eISSN
1558-108X
DOI
10.3103/s014641162301008x
Publisher site
See Article on Publisher Site

Abstract

In this paper, an improved path planning algorithm with two stages is proposed for indoor mobile robots to help them navigate across dynamic crowded areas. First, an environmental model is built with a restricted tangent graph, and the shortest path is determined before the robot starts to move. Second, the obtained path is employed to create virtual corridor distances. This featured data along with local range-finder readings are used to train a deep Q-learning agent to efficiently plan the robot’s motion. Simulation results show above 70% success rate with significant improvements compared with a counterpart algorithm in terms of path length, learning cost, and generalization capability.

Journal

Automatic Control and Computer SciencesSpringer Journals

Published: Feb 1, 2023

Keywords: path planning; obstacle avoidance; tangent graph; virtual corridor; deep Q-learning

There are no references for this article.