|Title:|| TO PUSH OR NOT TO PUSH -
PART I: ON THE REARRANGEMENT OF MOVABLE OBJECTS BY A MOBILE ROBOT.
|Authors:|| O. Ben-Shahar and E. Rivlin
|Abstract:||We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several moveable objects in its work space. We present an algorithm which, when given a set of foal configurations, plans a pushing path to the ``cheapest'' goal or announces that no such path exists. The pushing path is found using a two phase procedure: context sensitive back propagation of a cost function, and a pushing path restoration phase. The latter is based on a gradient descent procedure which considers, in each step, only admissible neighboring configurations. The admissibility mechanism gives a primary tool for expressing the special characteristics of the pushing manipulation. It also allows a full integration of any geometrical constraints imposed by the pushing robot, the pushed objects and the environment. We prove optimality and completeness of the algorithm and give some simulation results in different scenarios.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1995/CIS/CIS9516), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CIS technical reports of 1995
To the main CS technical reports page
Computer science department, Technion