Solving a Path Planning Problem in a Partially Known Environment using a Swarm Algorithm

This paper proposes a path planning strategy for an Autonomous Ground Vehicle (AGV) navigating in a partially known environment. Global path planning is performed by first using a spatial database of the region to be traversed containing selected attributes such as height data and soil information from a suitable spatial database. The database is processed using a biomimetic swarm algorithm that is inspired by the nest building strategies followed by termites. Local path planning is performed online utilizing information regarding contingencies that affect the safe navigation of the AGV from various sensors. The simulation discussed has been implemented on the open source Player-Stage-Gazebo platform.

[1]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[2]  Vishnu Vyas,et al.  An Algorithm for Site Selection in GIS based on Swarm Intelligence , 2006, 2006 IEEE International Conference on Evolutionary Computation.

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

[4]  Billur Barshan,et al.  Navigating vehicles through an unstructured environment with sonar , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[5]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[6]  A. Frank van der Stappen,et al.  Motion planning amidst fat obstacles , 1993 .

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

[8]  Karen Zita Haigh,et al.  Planning, Execution and Learning in a Robotic Agent , 1998, AIPS.

[9]  J. V. Perumpral,et al.  Cone Penetrometer Applications — A Review , 1987 .

[10]  Hans P. Moravec.  Sensor Fusion in Certainty Grids for Mobile Robots , 1988, AI Mag..

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

[12]  Anthony Stentz,et al.  The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.

[13]  Mark H. Overmars,et al.  The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles , 1992, Comput. Geom..

[14]  David A. Seal,et al.  The Shuttle Radar Topography Mission , 2007 .

[15]  Alade O. Tokuta,et al.  trulla : An Algorithm For Path Planning Among Weighted Regions By Localized Propagations , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.

[16]  Jean-Paul Laumond,et al.  Robot Motion Planning and Control , 1998 .

[17]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[18]  Kristo Heero.  Path planning and learning strategies for mobile robots in dynamic partially unknown environments , 2006 .

[19]  Mark H. Overmars,et al.  Motion Planning for Carlike Robots Using a Probabilistic Learning Approach , 1997, Int. J. Robotics Res..

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

[21]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..