Online motion planning for tethered robots in extreme terrain

Several potentially important science targets have been observed in extreme terrains (steep or vertical slopes, possibly covered in loose soil or granular media) on other planets. Robots which can access these extreme terrains will likely use tethers to provide climbing and stabilizing force. To prevent tether entanglement during descent and subsequent ascent through such terrain, a motion planning procedure is needed. Abad-Manterola, Nesnas, and Burdick [1] previously presented such a motion planner for the case in which the geometry of the terrain is known a priori with high precision. Their algorithm finds ascent/descent paths of fixed homotopy, which minimizes the likelihood of tether entanglement. This paper presents an extension of the algorithm to the case where the terrain is poorly known prior to the start of the descent. In particular, we develop new results for how the discovery of previously unknown obstacles modifies the homotopy classes underlying the motion planning problem. We also present a planning algorithm which takes the modified homotopy into account. An example illustrates the methodology.

[1]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[3]  Joel W. Burdick,et al.  Motion planning on steep terrain for the tethered axel rover , 2011, 2011 IEEE International Conference on Robotics and Automation.

[4]  Vladimir J. Lumelsky,et al.  The ties that bind: Motion planning for multiple tethered robots , 1996, Robotics Auton. Syst..

[5]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[6]  Vladimir J. Lumelsky,et al.  Moving multiple tethered robots between arbitrary configurations , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.

[7]  Patrick G. Xavier.  Shortest path planning for a tethered robot or an anchored cable , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[8]  Sergei N. Bespamyatnikh.  Computing homotopic shortest paths in the plane , 2003, SODA '03.

[9]  Subhrajit Bhattacharya,et al.  Search-Based Path Planning with Homotopy Class Constraints in 3D , 2010, AAAI.

[10]  John Hershberger,et al.  Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.

[11]  Jack Snoeyink,et al.  Testing Homotopy for Paths in the Plane , 2002, SCG '02.

[12]  Vladimir J. Lumelsky,et al.  Planar Curve Routing for Tethered-Robot Motion Planning , 1997, Int. J. Comput. Geom. Appl..

[13]  Vladimir J. Lumelsky,et al.  Motion planning in R3 for multiple tethered robots , 1999, IEEE Trans. Robotics Autom..

[14]  Jeffrey A. Edlund,et al.  Axel and DuAxel rovers for the sustainable exploration of extreme terrains , 2012, J. Field Robotics.

[15]  Joseph S. B. Mitchell,et al.  Shortest Paths and Networks , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[16]  Mark de Berg,et al.  Computational geometry: algorithms and applications, 3rd Edition , 1997 .

[17]  Vladimir J. Lumelsky,et al.  Polygon Area Decomposition for Multiple-Robot Workspace Division , 1998, Int. J. Comput. Geom. Appl..

[18]  Abdullah Akce,et al.  A compact representation of locally-shortest paths and its application to a human-robot interface , 2011, 2011 IEEE International Conference on Robotics and Automation.