Abstract
For the last decade, many sensor-based path-planning algorithms have been proposed. In all the algorithms, the convergence of a mobile robot to a destination is theoretically ensured if a path to the destination exists. However, due to no information of obstacle shape and location, a mobile robot basically takes a very long path to its destination. To overcome this drawback in this paper, we consider how a mobile robot selects its direction to follow when encountering an obstacle. Then, the result is as follows: a mobile robot should select a tangential direction to avoid a circular obstacle, whose absolute angle against the goal directions is smaller. The obstacle avoidance procedure is very simple. Therefore, by adding it into good classic sensor-based path-planning algorithms Class1 and Bug2, we get near-optimal algorithms Simple(Class1) and Simple(Bug2). In this paper, we firstly ascertain that Simple(Class1) and Simple(Bug2) always select slightly longer paths than the path generated by the optimal (model-based) path-planning algorithm. Secondly, we describe that Simple(Class1) and Simple(Bug2) always select extremely shorter paths than paths generated by Class1 and Bug2. The near-optimality and the superiority are given by theoretical proofs in an uncertain 2-D environment with circular obstacles. Thirdly, we theoretically investigate whether the near-optimality and the superiority are still kept or not in an uncertain environment with square, rectangular, elliptic, or triangular obstacles. Finally based on simulation and experiment results, we conclude that Simple(Class1) and Simple(Bug2) keep the near-optimality and the superiority in an environment with simple shapes as obstacles.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Noborio, H.: On a sensor-based navigation for a mobile robot. Journal of Robotics Mechatronics 8(1), 2–14 (1996)
Noborio, H., Yoshioka, T., Tominaga, S.: On the sensor-based navigation by changing a direction to follow an encountered obstacle. In: Proc. of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, September 1997, pp. 510–517 (1997)
Noborio, H.: A path-planning algorithm for generation of an intuitively reasonable path in an uncertain 2D workspace. In: Proc. of the Japan-USA Symposium on Flexible Automation, July 1990, vol. 2, pp. 477–480 (1990)
Lumelsky, V.J., Stepanov, A.A.: Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica 2, 403–430 (1987)
Sundar, S., Shiller, Z.: Optimal obstacle avoidance based on the hamilton-jacobibellman equation. IEEE Trans. on Robotics and Automation 13(2), 305–310 (1997)
Kamon, I., Rivlin, E.: Sensory-based motion planning with global proofs. IEEE Trans. on Robotics and Automation 13(6), 814–822 (1997)
Noborio, H.: A relation between workspace topology and deadlock occurrence in the simplest path-planning algorithm. In: Proc. of the 1992 Second Int. Conf. on Automation, Robotics and Computer Vision, pp. RO–10.1.1–RO.10.1.5 (1992)
Noborio, H., Urakawa, K.: On the near-optimality of sensor-based navigation in a 2-D unknown environment with simple shape. In: Proc. of the IEEE Int. Conf. on Robotics and Automation (1999) (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Noborio, H., Urakawa, K. (1999). Near-Optimal Sensor-Based Navigation in an Environment Cluttered with Simple Shapes. In: Christensen, H.I., Bunke, H., Noltemeier, H. (eds) Sensor Based Intelligent Robots. Lecture Notes in Computer Science(), vol 1724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10705474_9
Download citation
DOI: https://doi.org/10.1007/10705474_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66933-3
Online ISBN: 978-3-540-46619-2
eBook Packages: Springer Book Archive