A Novel Time Decaying Approach to Obstacle Avoidance

  • Sankalp Arora
  • S. Indu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5909)


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.


obstacle avoidance dynamic window local minima cognitive 


  1. 1.
    Khatib, O.: Real-time obstacle avoidance for robot manipulator and mobile robots. The International Jour. of Rob. Res. 5(1), 90–98 (1986)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Moravec, H.P.: Sensor fusion in certainty grids for mobile robots. AI Magazine, 61–74 (1988)Google Scholar
  3. 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
  4. 4.
    Borenstein, J., Koren, Y.: The vector field histogram - fast obstacle avoidance for mobile robots. IEEE Trans. Robot. and Auto. 7(3), 278–288 (1991)CrossRefGoogle Scholar
  5. 5.
    Fox, D., Burgard, W., Thrun, S.: The dynamic window approach to collision avoidance. IEEE Robot. Autom. Mag. 4, 23–33 (1997)CrossRefGoogle Scholar
  6. 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
  7. 7.
    Ögren, P., Leonard, N.E.: A Convergent Dynamic Window approach to Obstacle Avoidance. IEEE Trans. Robot 21(2), 188–195 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Sankalp Arora
    • 1
  • S. Indu
    • 1
  1. 1.Faculty of Delhi College of Engineering, Delhi College of EngineeringDelhi UniversityNew DelhiIndia

Personalised recommendations