By Topic

A flexible algorithm for planning local shortest path of mobile robots based on reachability graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yun-Hui Liu ; Dept. of Math. Eng. & Inf. Phys., Tokyo Univ., Japan ; Suguru Arimoto

Proposes concept called `local shortest path' for mobile robots, and shows that a more compact V-graph of size O(M2+N) can be constructed based on this concept, where M and N are numbers of convex components and convex vertices of polygonal obstacles respectively. In addition, a reachability graph (R-graph) of size O(N* M2) registering reachability between vertices on local shortest paths is proposed. The R-graph depends only on obstacles in the environment but not on size of mobile robots. Hence even if the size of the robot or the required safety distance between the robot and obstacles changed, it is possible to plan a path for the robot efficiently by picking up its reachable vertices in the R-graph without need of reconstruction of the R-graph. Finally, the usefulness of the algorithm is ascertained by several simulations

Published in:

Intelligent Robots and Systems '90. 'Towards a New Frontier of Applications', Proceedings. IROS '90. IEEE International Workshop on

Date of Conference:

3-6 Jul 1990