Summary
While spatial sampling of points has already received much attention, the motion planning problem can also be viewed as a process which samples the function space of paths. We define a search space to be a set of candidate paths and consider the problem of designing a search space which is most likely to produce a solution given a probabilistic representation of all possible environments. We introduce the concept of relative completeness which is the prior probability, before the environment is specified, of producing a solution path in a bounded amount of computation. We show how this probability is related to the mutual separation of the set of paths searched. The problem of producing an optimal set can be related to the maximum k-facility dispersion problem which is known to be NP-hard. We propose a greedy algorithm for producing a good set of paths and demonstrate that it produces results with both low dispersion and high prior probability of success.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag New York, Inc., Secaucus (1999)
Barraquand, J., Latombe, J.-C.: Robot motion planning: a distributed representation approach. Int. J. Rob. Res. 10(6), 628–649 (1991)
Bicchi, A., Marigo, A., Piccoli, B.: On the reachability of quantized control systems. IEEE Trans. on Automatic Control 4(47), 546–563 (2002)
Daily, M., Harris, J., Keirsey, D., Olin, K., Payton, D., Reiser, K., Rosenblatt, J., Tseng, D., Wong, V.: Autonomous cross-country navigation with the ALV. In: Proceedings of the IEEE International Conference on Robotics and Automation, vol. 2, pp. 718–726 (1988)
Dubins, L.E.: On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents. Amer. J. Math. 79, 497–516 (1957)
Fraichard, T., Asama, H.: Inevitable collision states - a step towards safer robots? Advanced Robotics 18(10), 1001–1024 (2004)
Frazzoli, E., Dahleh, M.A., Feron, E.: A maneuver-based hybrid control architecture for autonomous vehicle motion planning, In: Software Enabled Control: Information Technology for Dynamical Systems (2003)
Jacobs, P., Canny, J.: Robust motion planning for mobile robots. In: Proc. of the 1990 IEEE International Conference on Robotics and Automation, pp. 2–7 (1990)
Kavraki, L., Svestka, P., Latombe, J.-C., Overmars, M.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. Technical Report CS-TR-94-1519 (1994)
LaValle, S., Ku, J.: Randomized kinodynamic planning. In: Proc. IEEE Int’l Conf. on Robotics and Automation (1999) (to appear)
LaValle, S.M., Kuffner, J.J.: Randomized kinodynamic planning. International Journal of Robotics Research 20(5), 378–400 (2001)
Lindemann, S.R., LaValle, S.M.: Current issues in sampling-based motion planning. In: Robotics Research: The Eleventh International Symposium, pp. 36–54. Springer-Verlag, Berlin (2005)
Morgan, S., Branicky, M.: Sampling-based planning for discrete spaces. In: Proc. IEEE/RSJ Intl. Conf. Intelligent Robots and Systems (2004)
Niederreiter, H.: Random number generation and quasi-Monte Carlo methods. Society for Industrial and Applied Mathematics, Philadelphia (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Green, C.J., Kelly, A. (2010). Toward Optimal Sampling in the Space of Paths. In: Kaneko, M., Nakamura, Y. (eds) Robotics Research. Springer Tracts in Advanced Robotics, vol 66. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14743-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-14743-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14742-5
Online ISBN: 978-3-642-14743-2
eBook Packages: EngineeringEngineering (R0)