Randomized query processing in robot path planning

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Lydia E. Kavraki Robotics Laboratory, Department of Computer Science, Stanford University, Stanford, CA
Jean-Claude Latombe Robotics Laboratory, Department of Computer Science, Stanford University, Stanford, CA
Rajeev Motwani Department of Computer Science, Stanford University, Stanford, CA
Prabhakar Raghavan IBM Research Division, T.J. Watson Research Center, Yorktown Heights, NY
Randomized query processing in robot path planning Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 16
· Downloads (cumulative): 377
· Citation Count: 10

Published in:
Cover Image
 
· Proceeding
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Pages 353-362
ACM New York, NY, USA ©1995
table of contents ISBN:0-89791-718-9 doi>10.1145/225058.225159

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