A novel obstacle avoidance algorithm: "Follow the Gap Method"

In this paper, a novel obstacle avoidance method is designed and applied to an experimental autonomous ground vehicle system. The proposed method brings a new solution to the problem and has several advantages compared to previous methods. This novel algorithm is easy to tune and it takes into consideration the field of view and the nonholonomic constraints of the robot. Moreover the method does not have a local minimum problem and results in safer trajectories because of its inherent properties in the definition of the algorithm. The proposed algorithm is tested in simulations and after the observation of successful results, experimental tests are performed using static and dynamic obstacle scenarios. The experimental test platform is an autonomous ground vehicle with Ackermann steering geometry which brings nonholonomic constraints to the vehicle. Experimental results show that the task of obstacle avoidance can be achieved using the algorithm on the autonomous vehicle platform. The algorithm is very promising for application in mobile and industrial robotics where obstacle avoidance is a feature of the robotic system.

[1]  Yoji Kuroda,et al.  Potential Field Navigation of High Speed Unmanned Ground Vehicles on Uneven Terrain , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[2]  Yoram Koren,et al.  Real-time obstacle avoidance for fast mobile robots in cluttered environments , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[3]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[4]  Volkan Sezer,et al.  Conversion of a conventional electric automobile into an unmanned ground vehicle (UGV) , 2011, 2011 IEEE International Conference on Mechatronics.

[5]  Ilya Kolmanovsky,et al.  Developments in nonholonomic control problems , 1995 .

[6]  M. Gokasan,et al.  Multi-sensor data fusion of DCM based orientation estimation for land vehicles , 2011, 2011 IEEE International Conference on Mechatronics.

[7]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[8]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[9]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

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

[11]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[12]  Pradeep K. Khosla,et al.  Real-time obstacle avoidance using harmonic potential functions , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[13]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[14]  Hendrik Van Brussel,et al.  Concepts for dynamic obstacle avoidance and their extended application in underground navigation , 2003, Robotics Auton. Syst..

[15]  邹细勇,et al.  Virtual local target method for avoiding local minimum in potential field based robot navigation , 2003 .

[16]  Marin Kobilarov,et al.  Collision avoidance norms in trajectory planning , 2011, Proceedings of the 2011 American Control Conference.

[17]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[18]  Prof. Dr. Kikuo Fujimura.  Motion Planning in Dynamic Environments , 1991, Computer Science Workbench.

[19]  Yoram Koren,et al.  Potential field methods and their inherent limitations for mobile robot navigation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[20]  A. Bloch,et al.  Nonholonomic Mechanics and Control , 2004, IEEE Transactions on Automatic Control.

[21]  Marius Kloetzer,et al.  Trajectory planning for a car-like robot by environment abstraction , 2012, Robotics Auton. Syst..

[22]  Ser Yong Lim,et al.  Virtual obstacle concept for local-minimum-recovery in potential-field based navigation , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

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

[24]  Debasish Ghose,et al.  Obstacle avoidance in a dynamic environment: a collision cone approach , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[25]  Jing-Sin Liu,et al.  Practical and flexible path planning for car-like mobile robot using maximal-curvature cubic spiral , 2005, Robotics Auton. Syst..

[26]  Roland Siegwart,et al.  Introduction to Autonomous Mobile Robots , 2004 .

[27]  Jesus Savage,et al.  Local Autonomous Robot Navigation Using Potential Fields , 2008 .

[28]  Suman Chakravorty,et al.  Generalized Sampling-Based Motion Planners , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).