By Topic

Three or more dimensional sensor-based path-planning algorithm HD-I

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

3 Author(s)
Noborio, H. ; Graduate Sch. of Eng., Osaka Electro-Commun. Univ., Japan ; Maeda, Y. ; Urakawa, K.

To design an online or sensor-based path-planning algorithm, we should decrease its search cost (the number N of visited points of a robot in a known map or the sum S of moving distances of it in an uncertain map). For this purpose, the optimal algorithm, e.g. an A* algorithm is not suitable. Because in order to select an optimal path between start and goal points, the algorithm requests a huge set of visited points or driving distances. On the observation, by decreasing the sum S, we design a new sensor-based path-planning algorithm HD-I. In almost all the sensor-based algorithms, e.g. Class 1, convergence of a robot to its goal is ensured by decreasing the distance. Also in a famous algorithm, best-first (BF), the convergence is also kept by visiting a node whose distance to its goal is the smallest. They are similar because a robot does not take a distance from a start into account. Therefore, their modified versions can be mixed. Especially, BF can investigate around an unknown obstacle whose dimensions are over two. As a result, by mixing modified BF and Class 1, we obtain a three or more dimensional algorithm HD-I

Published in:

Intelligent Robots and Systems, 1999. IROS '99. Proceedings. 1999 IEEE/RSJ International Conference on  (Volume:3 )

Date of Conference: