A fast cost-to-go map approximation algorithm on known large scale rough terrains

Obtaining the optimal cost-to-go map for large scale rough terrains is computationally very expensive both in terms of duration and memory resources. A fast algorithm for approximation of the optimal cost-to-go map in terms of terrain traversability measures for path planning on known large scale rough terrains is developed. The results show that the majority of the cost-to-go map values, computed from every terrain location with respect to the goal location, are near-optimal. Unlike Dijkstra algorithm, the proposed algorithm has inherently parallel structure, and can be significantly speeded up depending on the number of used CPU cores.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[3]  Tom Drummond,et al.  Machine Learning for High-Speed Corner Detection , 2006, ECCV.

[4]  Larry Matthies,et al.  Stereo vision and rover navigation software for planetary exploration , 2002, Proceedings, IEEE Aerospace Conference.

[5]  G. Magnani,et al.  An approximate of the cost-to-go map on rough terrains , 2013, 2013 IEEE International Conference on Mechatronics (ICM).

[6]  Anthony Stentz,et al.  Global planning on the Mars Exploration Rovers: Software integration and surface testing , 2009, J. Field Robotics.

[7]  G. Magnani,et al.  A Roughness-based RRT for Mobile Robot Navigation Planning , 2011 .

[8]  T. M. Hughes.  Graph processing by which to evacuate a mine , 1990, Proceedings of the 1990 Symposium on Applied Computing.

[9]  F. Benjamin Zhan,et al.  Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

[10]  Joseph L. Jones,et al.  Mobile robots , 1993 .

[11]  J.J. Biesiadecki,et al.  The Mars Exploration Rover surface mobility flight software driving ambition , 2006, 2006 IEEE Aerospace Conference.

[12]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.

[13]  A. Stentz,et al.  Global Path Planning on Board the Mars Exploration Rovers , 2007, 2007 IEEE Aerospace Conference.

[14]  Steven Dubowsky,et al.  Mobile Robots in Rough Terrain - Estimation, Motion Planning, and Control with Application to Planetary Rovers , 2004, Springer Tracts in Advanced Robotics.

[15]  Carlo Tomasi,et al.  Good features to track , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[16]  Andrew V. Goldberg,et al.  Computing Point-to-Point Shortest Paths from External Memory , 2005, ALENEX/ANALCO.

[17]  Tom Drummond,et al.  Faster and Better: A Machine Learning Approach to Corner Detection , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Martin Held,et al.  Author's Personal Copy Computer-aided Design Topology-oriented Incremental Computation of Voronoi Diagrams of Circular Arcs and Straight-line Segments , 2022 .

[19]  Panagiotis Tsiotras,et al.  Multi-resolution path planning: Theoretical analysis, efficient implementation, and extensions to dynamic environments , 2010, 49th IEEE Conference on Decision and Control (CDC).

[20]  Michael T. Wolf,et al.  Decomposition algorithm for global reachability analysis on a time-varying graph with an application to planetary exploration , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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