An efficient algorithm for one-step planar complaint motion planning with uncertainty

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: A. J. Briggs Department of Computer Science, Upson Hall, Cornell University, Ithaca, New York
Published in:
· Proceeding
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Pages 187 - 196
ACM New York, NY, USA ©1989
table of contents ISBN:0-89791-318-3 doi>10.1145/73833.73855
An efficient algorithm for one-step planar complaint motion planning with uncertainty Published by ACM 1989 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 179
· Citation Count: 2


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder