By Topic

Nonholonomic path planning for pushing a disk among obstacles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
P. K. Agarwal ; Dept. of Comput. Sci., Duke Univ., Durham, NC, USA ; J. -C. Latombe ; R. Motwani ; P. Raghavan

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

Published in:

Robotics and Automation, 1997. Proceedings., 1997 IEEE International Conference on  (Volume:4 )

Date of Conference:

20-25 Apr 1997