eCommons

 

An Efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertainty

dc.contributor.authorBriggs, Amyen_US
dc.date.accessioned2007-04-23T17:42:37Z
dc.date.available2007-04-23T17:42:37Z
dc.date.issued1989-03en_US
dc.description.abstractUncertainty in the executin of robot motion plans must be accounted for in the geometric computations from which plans are obtained, especially in the case where position sensing is inaccurate. We give an $O(n^{2} log n)$ algorithm to find a single commanded motion direction which will guarantee a successful motion in the plane from a specified start to a specified goal whenever such a one-step motion is possible. The plans account for uncertainty in the start position and in robot control, and anticipate that the robot may stick on or slide along obstacle surfaces with which it comes in contact. This bound improves on the best previous bound by a quadratic factor, and is achieved in part by a new analysis of the geometric complexity of the backprojection of the goal as a function of commanded motion direction.en_US
dc.format.extent1649345 bytes
dc.format.extent623927 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-980en_US
dc.identifier.urihttps://hdl.handle.net/1813/6896
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleAn Efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertaintyen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
89-980.pdf
Size:
1.57 MB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
89-980.ps
Size:
609.3 KB
Format:
Postscript Files