Optimal grid-free path planning across arbitrarily contoured terrain with anisotropic friction and gravity effects

The authors address anisotropic friction and gravity effects as well as ranges of impermissible-traversal headings due to overturn danger or power limitations. The method does not require imposition of a uniform grid, nor does it average effects in different directions, but reasons about a polyhedral approximation of terrain. It reduces the problem to a finite but provably optimal set of possibilities and then uses A* search to find the cost-optimal path. However, the possibilities are not physical locations but path subspaces. The method also exploits the insight that there are only four ways to optimally traverse an anisotropic homogeneous region: (1) straight across without braking, which is the standard isotropic-weighted-region traversal; (2) straight across without braking but as close as possible to a desired impermissible heading; (3) making impermissibility-avoiding switchbacks on the path across a region; and (4) straight across with braking. The authors prove specific optimality criteria for transitions on the boundaries of regions for each combination of traversal types. >

[1]  Alex Meystel,et al.  Minimum-time navigation of an unmanned mobile robot in a 2-1/2D world with obstacles , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[2]  Michael Zyda,et al.  Solving global two-dimensional routing problems using snell's law and a search , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

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

[4]  Clifford J Nuttall,et al.  An Analysis of Ground Mobility Models (ANAMOB) , 1971 .

[5]  Robert F Richbourg.  Solving a class of spatial reasoning problems: minimal-cost path planning in the Cartesian plane. , 1987 .

[6]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[7]  Micha Sharir,et al.  On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..

[8]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[9]  David M. Keirsey,et al.  Planning Strategic Paths Through Variable Terrain Data , 1984, Other Conferences.

[10]  Alexandre M. Parodi.  Multi-goal real-time global path planning for an autonomous land vehicle using a high-speed graph search processor , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[11]  Robert B. McGhee,et al.  Adaptive Locomotion of a Multilegged Robot over Rough Terrain , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  M. G. Bekker.  Introduction to Terrain-Vehicle Systems , 1969 .

[13]  Joseph S. B. Mitchell,et al.  The weighted region problem , 1987, SCG '87.

[14]  Neil C. Rowe,et al.  An Efficient Snell's Law Method for Optimal-Path Planning across Multiple Two-Dimensional, Irregular, Homogeneous-Cost Regions , 1990, Int. J. Robotics Res..

[15]  Neil C. Rowe,et al.  Roads, Rivers, and Obstacles: Optimal Two-Dimensional Path Planning around Linear Features for a Mobile Agent , 1990, Int. J. Robotics Res..