Obstacle Avoidance

Given the a priori knowledge of the environment and the goal position, mobile robot navigation refers to the robot’s ability to safely move towards the goal using its knowledge and the sensorial information of the surrounding environment. Even though there are many different ways to approach navigation, most of them share a set of common components or blocks, among which path planning and obstacle avoidance (may) play a key role. Given a map and a goal location, path planning involves finding a geometric path from the robot actual location to the goal. This is a global procedure whose execution performance is strongly dependent on a set of assumptions that are seldom observed in nowadays robots. In fact, in mobile robots operating in unstructured environments, or in service and companion robots, the a priori knowledge of the environment is usually absent or partial, the environment is not static, i.e., during the robot motion it can be faced with other robots, humans or pets, and execution is often associated with uncertainty. Therefore, for a collision free motion to the goal, the global path planning has to be associated with a local obstacle handling that involves obstacle detection and obstacle avoidance. Obstacle avoidance refers to the methodologies of shaping the robot’s path to overcome unexpected obstacles. The resulting motion depends on the robot actual location and on the sensor readings. There are a rich variety of algorithms for obstacle avoidance from basic re-planning to reactive changes in the control strategy. Proposed techniques differ on the use of sensorial data and on the motion control strategies to overcome obstacles. The Bug’s algorithms (section 2:1), [1], [2], follow the easiest common sense approach of moving directly towards the goal, unless an obstacle is found, in which case the obstacle is contoured until motion to goal is again possible. In these algorithms only the most recent values of sensorial data are used. Path planning using artificial potential fields, [3], (section 2:2) is based on a simple and powerful principle that has an embedded obstacle avoidance capabil-

[1]  Oussama Khatib,et al.  Elastic bands: connecting path planning and control , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[2]  Yoram Koren,et al.  Histogramic in-motion mapping for mobile robot obstacle avoidance , 1991, IEEE Trans. Robotics Autom..

[3]  Viii Supervisor Sonar-Based Real-World Mapping and Navigation , 2001 .

[4]  Vladimir J. Lumelsky,et al.  Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape , 1987, Algorithmica.

[5]  Yoram Koren,et al.  The vector field histogram-fast obstacle avoidance for mobile robots , 1991, IEEE Trans. Robotics Autom..

[6]  Estela Bicho Dynamic Approach to Behavior-based Robotics: Design, Specification, Analysis, Simulation and Implementation , 2000 .

[7]  Estela Bicho,et al.  The dynamic approach to autonomous robotics demonstrated on a low-level vehicle platform , 1997, Robotics Auton. Syst..

[8]  Hans P. Moravec,et al.  High resolution maps from wide angle sonar , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[9]  Ehud Rivlin,et al.  TangentBug: A Range-Sensor-Based Navigation Algorithm , 1998, Int. J. Robotics Res..

[10]  Iwan Ulrich,et al.  VFH+: reliable obstacle avoidance for fast mobile robots , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[11]  Vladimir J. Lumelsky,et al.  Incorporating range sensing in the robot navigation function , 1990, IEEE Trans. Syst. Man Cybern..

[12]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.