Abstract
Sampling-based motion planners are a central tool for solving motion-planning problems in a variety of domains, but the theoretical understanding of their behavior remains limited, in particular with respect to the quality of the paths they generate (in terms of path length, clearance, etc.). In this paper we prove, for a simple family of obstacle settings, that the popular dual-tree planner Bi-RRT may produce low-quality paths that are arbitrarily worse than optimal with modest but significant probability, and overlook higher-quality paths even when such paths are easy to produce. At the core of our analysis are probabilistic automata designed to reach an accepting state when a path of significantly low quality has been generated. Complementary experiments suggest that our theoretical bounds are conservative and could be further improved. To the best of our knowledge, this is the first work to study the attainability of high-quality paths that occupy a significant (non-negligible) portion of the space of all paths. The formalism presented in this work can be generalized to other algorithms and other motion-planning problems by defining appropriate predicates, and pave the way to deeper understanding of hallmark planning algorithms.
This is a preview of subscription content, log in via an institution to check access.
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
Asano, T., Kirkpatrick, D., Yap, C.: d 1-Optimal motion of a rod. In: 12th ACM Symposium on Computational Geometry, pp. 252–263 (1996)
Bhatia, A., Kavraki, L.E., Vardi, M.Y.: Sampling-based motion planning with temporal goals. In: ICRA 2010, pp. 2689–2696 (2010)
Canny, J., Reif, J.: New lower bound techniques for robot motion planning problems. In: FOCS 1987, pp. 49–60. IEEE, Los Alamitos (1987)
Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G.A., Burgard, W., Kavraki, L.E., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Cambridge (2005)
Enosh, A., Raveh, B., Furman-Schueler, O., Halperin, D., Ben-Tal, N.: Generation, comparison and merging of pathways between protein conformations: Gating in k-channels. Biophysical Journal 95(8), 3850–3860 (2008)
Fainekos, G.E., Girard, A., Kress-Gazit, H., Pappas, G.J.: Temporal logic motion planning for dynamic robots. Automatica 45(2), 343–352 (2009)
Ferguson, D., Stentz, A.: Anytime RRTs. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 5369–5375 (2006)
Geraerts, R., Overmars, M.: Creating high-quality paths for motion planning. IJRR 26(8), 845–863 (2007)
Hsu, D., Latombe, J., Motwani, R.: Path planning in expansive configuration spaces. Int. J. Comp. Geo. & App. 4, 495–512 (1999)
Karaman, S., Frazzoli, E.: Incremental sampling-based optimal motion planning. Robotics: Science and Systems (2010)
Kavraki, L.E., Kolountzakis, M.N., Latombe, J.-C.: Analysis of probabilistic roadmaps for path planning. IEEE Trans. Robot. Automat. 14(1), 166–171 (1998)
Kavraki, L.E., Svestka, P., Latombe, J.C., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Automat. 12(4), 566–580 (1996)
Kim, J., Pearce, R.A., Amato, N.M.: Extracting optimal paths from roadmaps for motion planning. In: ICRA 2003, pp. 2424–2429. IEEE, Los Alamitos (2003)
Kuffner, J.J., Lavalle, S.M.: RRT-Connect: An efficient approach to single-query path planning. In: ICRA 2000, pp. 995–1001 (2000)
Lahijanian, M., Wasniewski, J., Andersson, S., Belta, C.: Motion planning and control from temporal logic specifications with probabilistic satisfaction guarantees. In: ICRA 2010, pp. 3227–3232 (2010)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)
LaValle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: Progress and prospects. In: Donald, B.R., Lynch, K.M., Rus, D. (eds.) Algorithmic and Computational Robotics: New Directions, pp. 293–308. A K Peters, Wellesley (2001)
Mitchell, J.S.B.: Handbook of discrete and computational geometry. Shortest paths and networks, ch. 27, pp. 607–641. CRC Press, Inc., Boca Raton (2004)
Nechushtan, O., Raveh, B., Halperin, D.: Supplementary online proofs, http://acg.cs.tau.ac.il/projects/internal-projects/sda/SuppOnline.pdf
Nieuwenhuisen, D., Overmars, M.H.: Useful cycles in probabilistic roadmap graphs. In: ICRA 2004, pp. 446–452. IEEE, Los Alamitos (2004)
Plaku, E., Bekris, K.E., Kavraki, L.E.: OOPS for motion planning: An online open-source programming system. In: ICRA 2007, pp. 3711–3716 (2007)
Raveh, B., Enosh, A., Halperin, D.: A little more, a lot better: Improving path quality by a simple path merging algorithm. Computing Research Repository, abs/1001.2391 (2010)
Reif, J., Wang, H.: The complexity of the two dimensional curvature-constrained shortest-path problem. In: WAFR 1998, pp. 49–57 (1998)
Reif, J.H.: Complexity of the mover’s problem and generalizations. In: Proceedings IEEE Symposium on Foundations of Computer Science, pp. 421–427 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nechushtan, O., Raveh, B., Halperin, D. (2010). Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners. In: Hsu, D., Isler, V., Latombe, JC., Lin, M.C. (eds) Algorithmic Foundations of Robotics IX. Springer Tracts in Advanced Robotics, vol 68. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17452-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-17452-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17451-3
Online ISBN: 978-3-642-17452-0
eBook Packages: EngineeringEngineering (R0)