Computing spanners of asymptotically optimal probabilistic roadmaps

IEEE International Conference on Intelligent Robots and Systems

Volumn , Issue , 2011, Pages 4292-4298

  Marble, James D ^a   Bekris, Kostas E ^a  

^a Reno   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; GEOMETRIC PROBLEMS; PATH LENGTH; PROBABILISTIC ROAD MAPS; QUERY RESOLUTION; ROAD-MAPS; ROADMAP; SUBGRAPHS;

ALGORITHMS; GRAPH THEORY; INTELLIGENT ROBOTS; MOTION PLANNING; OPTIMIZATION; ROBOTICS;

ROBOT PROGRAMMING;

EID: 84455188441     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2011.6048831     Document Type: Conference Paper

References (41)

1. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," TRA, vol. 12, no. 4, pp. 566-580, 1996. (Pubitemid 126774162)
2. R. Wein, J. van den Berg, and D. Halperin, "Planning High-Quality Paths and Corridors amidst Obstacles," IJRR, vol. 27, no. 11-12, pp. 1213-1231, Nov. 2008.
3. L. Jaillet and T. Simeon, "Path deformation roadmaps," in WAFR, New York City, NY, 2006.
4. E. Schmitzberger, J. L. Bouchet, M. Dufaut, D. Wolf, and R. Husson, "Capture of homotopy classes with probabilistic roadmap," in IROS, Switzerland, 2002, pp. 2317-2322.
5. B. Raveh, A. Enosh, and D. Halperin, "A Little More, a Lot Better: Improving Path Quality by a Path-Merging Algorithm," Robotics, IEEE Transactions on, vol. 27, no. 2, pp. 365-370, 2011.
6. S. Karaman and E. Frazzoli, "Sampling-based algorithms for optimal motion planning," IJRR, vol. 30, no. 7, pp. 846-894, June 2011.
7. R. Arumugam, V. Enti, and L. Bingbing, "DAvinCi: A cloud computing framework for service robots," ICRA, pp. 3084-3089, 2010.
8. K. Bekris and L. Kavraki, "Informed and Probabilistically Complete Search for Motion Planning under Differential Constraints," TRA, pp. 3-10, 2008.
9. Y. Li and K. E. Bekris, "Learning approximate cost-to-go metrics to improve sampling-based motion planning," in ICRA, Shanghai, China, 9-13 May 2011.
10. J. van den Berg, D. Ferguson, and J. Kuffner, "Anytime path planning and replanning in dynamic environments," in ICRA, May 2006, pp. 2366-2371.
11. M. Kallman and M. Mataric, "Motion planning using dynamic roadmaps," in ICRA, vol. 5, no. April. IEEE, 2004, pp. 4399-4404.
12. N. M. Amato, O. B. Bayazit, L. K. Dale, C. Jones, and D. Vallejo, "OBPRM: An Obstacle-based PRM for 3D Workspaces," in WAFR, 1998, pp. 155-168.
13. L. J. Guibas, C. Holleman, and L. E. Kavraki, "A probabilistic roadmap planner for flexible objects with a workspace medial-axis-based sampling approach," in IROS, vol. 1, October 1999, pp. 254,259.
14. D. Hsu, L. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin, "On finding narrow passages with probabilistic roadmap planners,"in WAFR, Houston, TX, 1998.
15. T. Simeon, J.-P. Laumond, and C. Nissoux, "Visibility-based probabilistic roadmaps for motion planning," ARJ, vol. 41, no. 6, pp. 477-494, 2000.
16. G. Sanchez and J.-C. Latombe, "A single-query, bi-directional probabilistic roadmap planner with lazy collision checking," in ISRR, 2001, pp. 403-418.
17. D. Xie, M. Morales, R. Pearce, S. Thomas, J.-L. Lien, and N. M. Amato, "Incremental Map Generation (IMG)," in WAFR, New York City, NY, July 2006.
18. E. Plaku, K. E. Bekris, B. Y. Chen, A. M. Ladd, and L. E. Kavraki, "Sampling-based roadmap of trees for parallel motion planning," TRA, vol. 21, no. 4, pp. 587-608, 2005.
19. S. M. LaValle and J. J. Kuffner, "Randomized Kinodynamic Planning,"IJRR, vol. 20, no. 5, pp. 378-400, May 2001.
20. D. Hsu, R. Kindel, J. C. Latombe, and S. Rock, "Randomized Kinodynamic Motion Planning with Moving Obstacles," IJRR, vol. 21, no. 3, pp. 233-255, Mar. 2002.
21. O. Nechushtan, B. Raveh, and D. Halperin, "Sampling-Diagrams Automata : a Tool for Analyzing Path Quality in Tree Planners," in WAFR, 2010.
22. D. Ferguson and A. Stentz, "Anytime RRTs," in IROS, no. line 3. IEEE, Oct. 2006, pp. 5369-5375.
23. R. Geraerts and M. H. Overamrs, "Creating small graphs for solving motion planning problems," in MMAR, 2005, pp. 531-536.
24. R. Geraerts and M. H. Overmars, "Reachability-based analysis for probabilistic roadmap planners," RAS, vol. 55, pp. 824-836, 2007. (Pubitemid 47576575)
25. M. A. Morales, R. Pearce, and N. M. Amato, "Metrics for analyzing the evolution of C-space models," in ICRA, Orlando, FL, May 2006, pp. 1268-1273.
26. J. Kim, R. A. Pearce, and N. M. Amato, "Extracting optimal paths from roadmaps for motion planning," in ICRA, vol. 2, 14-19 September 2003, pp. 2424-2429.
27. D. Nieuwenhuisen and M. H. Overmars, "Using cycles in probabilistic roadmap graphs," in ICRA, 2004, pp. 446-452.
28. R. Geraerts and M. H. Overmars, "Creating high-quality roadmaps for motion planning in virtual environments," in IROS, 2006, pp. 4355-4361.
29. S. Karaman, M. Walter, A. Perez, E. Frazzoli, and S. Teller, "Anytime Motion Planning using the RRT," in ICRA, 2011.
30. R. Pearce, M. Morales, and N. Amato, "Structural Improvement Filtering Strategy for PRM," in RSS, 2008.
31. D. Peleg and A. Schäffer, "Graph Spanners," Journal of Graph Theory, vol. 13, no. 1, pp. 99-116, 1989.
32. E. Cohen, "Fast Algorithms for Constructing t-Spanners and Paths with Stretch t," Journal on Computing, vol. 28, no. 1, p. 210, 1998.
33. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, "Near-Linear Time Construction of Sparse Neighborhood Covers," Journal on Computing, vol. 28, no. 1, p. 263, 1998.
34. M. Thorup and U. Zwick, "Approximate distance oracles," in JACM, vol. 52, no. 1. ACM, Jan. 2005, pp. 1-24.
35. I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares, "On sparse spanners of weighted graphs," Discrete and Computational Geometry, vol. 9, no. 1, pp. 81-100, 1993.
36. L. Roditty, M. Thorup, and U. Zwick, "Deterministic constructions of approximate distance oracles and spanners," in ICALP. Springer, 2005, pp. 261-272.
37. S. Baswana and S. Sen, "A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs," Random Structures and Algorithms, vol. 30, no. 4, pp. 532-563, July 2007.
38. J. M. Keil, "Approximating the complete Euclidean graph," in Scandinavian Workshop on Algorithm Theory. London, UK: Springer-Verlag, 1988, pp. 208-213.
39. M. Elkin and D. Peleg, "Strong inapproximability of the basic k-spanner problem," Automata, Languages and Programming, vol. 1853, pp. 636-648, 2000.
40. I. A. Sucan, M. Moll, and L. E. Kavraki, "The open motion planning library (ompl)," http://ompl.kavrakilab.org, 2010.
41. J. D. Marble and K. E. Bekris, "Asymptotically Near-Optimal is Good Enough for Motion Planning," in ISRR, 2011.