A Mobile Robot Path Planning Based on Multiple Destination-points

Jing-jing WANG, Xi-sheng DAI, Ke-ne LI

Abstract


Path planning is an important aspect of mobile robot. This paper mainly studies the global path planning with multiple sub-path targets. Firstly, this paper build two initial distance matrix, then construct a minimum distance matrix by Dijkstra algorithm. Finally, the paper determine the destination nodes which have all minimum path. The path planning method can be used to some service robots, including: family service robots, medical robots, industrial robots.

Keywords


Mobile robot, Path planning, Multitasking


DOI
10.12783/dtcse/aics2016/8248

Full Text:

PDF

Refbacks

  • There are currently no refbacks.