On the expected complexity of random path planning
Copyright (c) 1999 Institute of Electrical and Electronics Engineers.
Reprinted, with permission, from the International Conference on
Robotics and Automation, Minneapolis, April 1996.
This material is posted here with permission of the IEEE. Such
permission of the IEEE does not in any way imply IEEE endorsement of
any of LAAS-CNRS's products or services. Internal or personal use of
this material is permitted. However, permission to reprint/republish
this material for advertising or promotional purposes or for creating
new collective works for resale or redistribution must be obtained
from the IEEE by sending a blank email message to
pubs-permissions@ieee.org.
By choosing to view this document, you agree to all provisions of the
copyright laws protecting it.