Nonholonomic path planning for pushing a disk among obstacles

We consider the path-planning problem for a robot pushing an object in an environment containing obstacles. This new variant of the classical robot path-planning problem has several interesting geometric aspects, which we explore. We focus on the setting where the robot makes a point contact with the object which is assumed to be a unit disk, while the obstacles are assumed to be polygonal.

[1]  Kevin M. Lynch,et al.  Planar Manipulation on a Conveyor with a One Joint Robot , 1996 .

[2]  Kevin M. Lynch,et al.  Estimating the friction parameters of pushed objects , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[3]  Kevin M. Lynch,et al.  Pulling by Pushing, Slip With Infinite Friction, and Perfectly Rough Surfaces , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[4]  Arthur C. Sanderson,et al.  Planning robotic manipulation strategies for workpieces that slide , 1988, IEEE J. Robotics Autom..

[5]  Kevin M. Lynch,et al.  The mechanics of fine manipulation by pushing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[6]  Kevin M. Lynch,et al.  Nonprehensile robotic manipulation: controllability and planning , 1996 .

[7]  Matthew T. Mason,et al.  Mechanics and Planning of Manipulator Pushing Operations , 1986 .

[8]  Kevin M. Lynch,et al.  Pulling by Pushing, Slip With Infinite Friction, and Perfectly Rough Surfaces , 1995, Int. J. Robotics Res..

[9]  Michael A. Peshkin,et al.  A complete algorithm for designing passive fences to orient parts , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[10]  Kevin M. Lynch,et al.  Stable Pushing: Mechanics, Controllability, and Planning , 1995, Int. J. Robotics Res..