A Novel Time Decaying Approach to Obstacle Avoidance
One of the basic issues in navigation of mobile robots is the obstacle avoidance task which is commonly achieved using reactive control paradigm where a local mapping from perceived states to actions is acquired. The algorithms of this class suffer from a major drawback of exhibiting cyclic behavior when encountered with certain obstacle configurations. This paper presents a cognitive time decaying approach to overcome this cyclic behavior .The Dynamic Window algorithm is taken as an example for implementing this approach. To build a dynamic window based obstacle avoider, we use time decaying heuristic function for history mapping - which innately eliminates local minima even for a cluttered environment and gives the robot an exploratory nature best suited for map building purposes. The algorithm is successfully tested on a simulation, where it is shown to avoid the U bend problem of local minima.
Keywordsobstacle avoidance dynamic window local minima cognitive
- 2.Moravec, H.P.: Sensor fusion in certainty grids for mobile robots. AI Magazine, 61–74 (1988)Google Scholar
- 3.Koren, Y., Borenstein, J.: Potential field methods and their inherent limitations for mobile robot navigation. In: Proc. IEEE Int. Conf. Robotics and Automation (April 1991)Google Scholar
- 6.Brock, O., Khatib, O.: High-speed navigation using the global dynamic window approach. In: Proc. IEEE Int. Conf. Robot. Autom., De troit, MI, May 1999, pp. 341–346 (1999)Google Scholar