A Subgoal-Guided Force Field Method for Robot Navigation

Motion planning and collision avoidance functionality are crucial attributes to the successful deployment of mobile robots. This research analyzes some shortcomings of the canonical F2 method and then presents subgoal-guided force-field (SGF2) method to mitigate these drawbacks. In the proposed approach, a robot identifies openings in an environment in front of itself on the basis of sensor data. The midpoints of these openings are determined and selected as subgoal candidates. A cost function is then utilized to evaluate their suitability. One subgoal is then chosen and used by the F2 method to generate a steering force which will drive the robot to the subgoal. The subgoal is continuously updated from realtime sensor data until the global goal is reached. Simulations are carried out to demonstrate the effectiveness of the proposed approach.

[1]  Shingo Ando A fast collision-free path planning method for a general robot manipulator , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[2]  Reid G. Simmons,et al.  The curvature-velocity method for local obstacle avoidance , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[3]  Gamini Dissanayake,et al.  A Variable Speed Force Field Method for Multi-Robot Collaboration , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[4]  Bruce H. Krogh,et al.  Dynamic generation of subgoals for autonomous mobile robots using local feedback information , 1989 .

[5]  Ahmad A. Masoud Using hybrid vector-harmonic potential fields for multi-robot, multi-target navigation in a stationary environment , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[6]  G. Dissanayake,et al.  A Force Field Method Based Multi-Robot Collaboration , 2006, 2006 IEEE Conference on Robotics, Automation and Mechatronics.

[7]  Xiaoyu Yang,et al.  A layered goal-oriented fuzzy motion planning strategy for mobile robot navigation , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[8]  Dikai Liu,et al.  A Force Field Method for Robot Navigation , 2005 .

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

[10]  Charles W. Warren A vector based approach to robot path planning , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[11]  Wolfram Burgard,et al.  The dynamic window approach to collision avoidance , 1997, IEEE Robotics Autom. Mag..

[12]  Iwan Ulrich,et al.  VFH/sup */: local obstacle avoidance with look-ahead verification , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[13]  Oliver Brock,et al.  High-speed navigation using the global dynamic window approach , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[14]  G. Swaminathan Robot Motion Planning , 2006 .

[15]  Richard T. Vaughan,et al.  The Player/Stage Project: Tools for Multi-Robot and Distributed Sensor Systems , 2003 .

[16]  Hong Wang,et al.  VPH: a new laser radar based obstacle avoidance method for intelligent mobile robots , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[17]  Shuzhi Sam Ge,et al.  Dynamic Motion Planning for Mobile Robots Using Potential Field Method , 2002, Auton. Robots.

[18]  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).

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

[20]  Christopher I. Connolly,et al.  Harmonic Functions and Collision Probabilities , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.