Font Size: a A A

Multi-step motion planning: Application to free-climbing robots

Posted on:2006-08-31Degree:Ph.DType:Dissertation
University:Stanford UniversityCandidate:Bretl, Timothy WolfeFull Text:PDF
GTID:1458390008451847Subject:Engineering
Abstract/Summary:
This dissertation addresses the problem of planning the motion of a multi-limbed robot to "free-climb" vertical rock surfaces. Free-climbing relies on natural features and friction (such as holes or protrusions) rather than special fixtures or tools. 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. This process of reasoning is called multi-step planning.; A multi-step planning framework is presented for computing non-gaited, free-climbing motions. This framework derives from an analysis of a free-climbing robot's configuration space, which can be decomposed into constraint manifolds associated with each state of contact between the robot and its environment. An understanding of the adjacency between manifolds motivates a two-stage strategy that uses a candidate sequence of steps to direct the subsequent search for motions.; Three algorithms are developed to support the framework. The first algorithm reduces the amount of time required to plan each potential step, a large number of which must be considered over an entire multi-step search. It extends the probabilistic roadmap (PRM) approach based on an analysis of the interaction between balance and the topology of closed kinematic chains. The second algorithm addresses a problem with the PRM approach, that it is unable to distinguish challenging steps (which may be critical) from impossible ones. This algorithm detects impossible steps explicitly, using automated algebraic inference and machine learning. The third algorithm provides a fast constraint checker (on which the PRM approach depends), in particular a test of balance at the initially unknown number of sampled configurations associated with each step. It is a method of incremental precomputation, fast because it takes advantage of the sample distribution.; Validation with real hardware was done with a four-limbed, free-climbing robot called LEMUR (developed by the Mechanical and Robotic Technologies Group at NASA-JPL). Using the multi-step planner presented in this dissertation, LEMUR free-climbed an indoor, near-vertical surface with artificial rock features. It did so with limited control and sensing, demonstrating that planning is absolutely critical.
Keywords/Search Tags:Planning, Free-climbing, Robot, Multi-step
Related items