Affiliation:
1. Department of Computer Science Stanford University Stanford, CA 94305-5447, USA
Abstract
This paper addresses the problem of planning the motion of a multilimbed robot in order to “free-climb” vertical rock surfaces. Freeclimbing only relies on frictional contact with the surfaces rather than on special fixtures or tools like pitons. It requires strength, but more importantly it requires deliberate reasoning: not only must the robot decide how to adjust its posture to reach the next feature without falling, it must plan an entire sequence of steps, where each one might have future consequences. In this paper, this process of reasoning is broken into manageable pieces by decomposing a freeclimbing robot's configuration space into manifolds associated with each state of contact between the robot and its environment. A multistep planning framework is presented that decides which manifolds to explore by generating a candidate sequence of hand and foot placements first. A one-step planning algorithm is then described that explores individual manifolds quickly. This algorithm extends the probabilistic roadmap approach to better handle the interaction between static equilibrium and the topology of closed kinematic chains. It is assumed throughout this paper that a set of potential contact points has been presurveyed. Validation with real hardware was done with a four-limbed robot called LEMUR (developed by the Mechanical and Robotic Technologies Group at NASA–JPL). Using the planner presented in this paper, LEMUR free-climbed an indoor, near-vertical surface covered with artificial rock features.
Subject
Applied Mathematics,Artificial Intelligence,Electrical and Electronic Engineering,Mechanical Engineering,Modelling and Simulation,Software
Cited by
100 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献