Sampling-diagram automata: A tool for analyzing path quality in tree planners

Springer Tracts in Advanced Robotics

Volumn 68, Issue STAR, 2010, Pages 285-301

  Nechushtan, Oren ^a   Raveh, Barak ^a,b   Halperin, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DUAL-TREE; HIGH QUALITY; LOW QUALITIES; MOTION PLANNERS; OTHER ALGORITHMS; PATH LENGTH; PLANNING ALGORITHMS; PROBABILISTIC AUTOMATA; SAMPLING-BASED; THEORETICAL BOUNDS;

ALGORITHMS; AUTOMATA THEORY; MOTION PLANNING; PLANNING; ROBOTICS;

ROBOTS;

EID: 78650095694     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/978-3-642-17452-0_17     Document Type: Conference Paper

References (24)

1. Asano, T., Kirkpatrick, D., Yap, C.: d1-Optimal motion of a rod. In: 12th ACM Symposium on Computational Geometry, pp. 252-263 (1996)
2. Bhatia, A., Kavraki, L.E., Vardi, M.Y.: Sampling-based motion planning with temporal goals. In: ICRA 2010, pp. 2689-2696 (2010)
3. Canny, J., Reif, J.: New lower bound techniques for robot motion planning problems. In: FOCS 1987, pp. 49-60. IEEE, Los Alamitos (1987)
4. 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)
5. 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)
6. Fainekos, G.E., Girard, A., Kress-Gazit, H., Pappas, G.J.: Temporal logic motion planning for dynamic robots. Automatica 45(2), 343-352 (2009)
7. Ferguson, D., Stentz, A.: Anytime RRTs. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 5369-5375 (2006)
8. Geraerts, R., Overmars,M.: Creating high-quality paths for motion planning. IJRR 26(8), 845-863 (2007)
9. Hsu, D., Latombe, J., Motwani, R.: Path planning in expansive configuration spaces. Int. J. Comp. Geo. &App. 4, 495-512 (1999)
10. Karaman, S., Frazzoli, E.: Incremental sampling-based optimal motion planning. Robotics: Science and Systems (2010)
11. 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)
12. 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)
13. 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)
14. Kuffner, J.J., Lavalle, S.M.: RRT-Connect: An efficient approach to single-query path planning. In: ICRA 2000, pp. 995-1001 (2000)
15. 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)
16. LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)
17. 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)
18. 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)
19. Nechushtan, O., Raveh, B., Halperin, D.: Supplementary online proofs, SuppOnline.pdf
20. Nieuwenhuisen, D., Overmars, M.H.: Useful cycles in probabilistic roadmap graphs. In: ICRA 2004, pp. 446-452. IEEE, Los Alamitos (2004)
21. Plaku, E., Bekris, K.E., Kavraki, L.E.: OOPS for motion planning: An online opensource programming system. In: ICRA 2007, pp. 3711-3716 (2007)
22. 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)
23. Reif, J., Wang, H.: The complexity of the two dimensional curvature-constrained shortest-path problem. In: WAFR 1998, pp. 49-57 (1998)
24. Reif, J.H.: Complexity of the mover's problem and generalizations. In: Proceedings IEEE Symposium on Foundations of Computer Science, pp. 421-427 (1979)