Affiliation:
1. The Robotics Institute and School of Computer Science Carnegie Mellon University Pittsburgh, Pennsylvania 15213 USA
Abstract
This paper studies the use of pushing actions to orient and trans late objects in the plane. The authors use linear normal pushes, which are straight-line pushes in a direction normal to the pushing fence. These pushes are specified by the fence orientation and push distance. The authors show that a set of linear normal pushes can always be found to move any polygonal object from any initial con figuration to any goal configuration in the obstacle-free plane. The object configuration is specified by its pose; that is, its position and orientation. The authors formulate the search for such a sequence of pushes as a linear programming problem. They then describe an implemented pose planner that uses this formulation to identify a sequence of linear normal pushes given any polygonal object, any initial pose, and any goal pose. This planner is proven to be com plete and to have polynomial time complexity. The planner, which uses an analysis of the mechanics of pushing an object, generates open-loop plans that do not require sensing. The authors describe experiments that demonstrate the validity of the generated plans.
Subject
Applied Mathematics,Artificial Intelligence,Electrical and Electronic Engineering,Mechanical Engineering,Modeling and Simulation,Software
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献