Incremental Map Generation (IMG)

Springer Tracts in Advanced Robotics

Volumn 47, Issue , 2008, Pages 53-68

  Xie, Dawen ^a   Morales, Marco ^a   Pearce, Roger ^a   Thomas, Shawna ^a   Lien, Jyh Ming ^a   Amato, Nancy M ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE STRATEGIES; ALGORITHMIC FOUNDATIONS; APPLICATION DOMAINS; COMPUTATIONAL BIOLOGY; EVALUATION CRITERIA; HIGH DEGREE OF FREEDOM; MAP GENERATION; MOTION PLANNING PROBLEMS; PLANNING STRATEGIES; PROBABILISTIC ROADMAP METHODS; ROAD MAPS; SAMPLING METHODS; TRIAL AND ERROR;

BIOINFORMATICS; COMPUTER AIDED DESIGN; FOUNDATIONS; MAPS; PROCESS ENGINEERING; ROBOTS; TECHNICAL PRESENTATIONS;

ROBOTICS;

EID: 53849096045     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/978-3-540-68405-3_4     Document Type: Conference Paper

References (26)

1. Amato, N.M., Bayazit, O.B., Dale, L.K., Jones, C.V., Vallejo, D.: OBPRM: An obstacle-based PRM for 3D workspaces. In: Proc. Third Workshop on Algorithmic Foundations of Robotics (WAFR), Houston, TX, Natick, MA, pp. 155-168. A.K. Peters (1998)
2. Amato, N.M., Bayazit, O.B., Dale, L.K., Jones, C.V., Vallejo, D.: Choosing good distance metrics and local planners for probabilistic roadmap methods. IEEE Trans. Robot. Automat. 16(4), 442-447 (2000)
3. Apaydin, M., Singh, A., Brutlag, D., Latombe, J.-C.: Capturing molecular energy landscapes with probabilistic conformational roadmaps. In: Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pp. 932-939 (2001)
4. Boor, V., Overmars, M.H., van der Stappen, A.F.: The Gaussian sampling strategy for probabilistic roadmap planners. In: Proc. IEEE Int. Conf. Robot. Autom. (ICRA), vol. 2, pp. 1018-1023 (1999)
5. Burns, B., Brock, O.: Sampling-based motion planning using predictive models. In: Proc. IEEE Int. Conf. Robot. Autom. (ICRA) (2005)
6. Corneil, D.G., Dragan, F.F., Köhler, E.: On the power of bfs to determine a graph's diameter. Networks 42(4), 209-222 (2003)
7. Geraerts, R., Overmars, M.H.: Reachablility analysis of sampling based planners. In: Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pp. 406-412 (2005)
8. Gottschalk, S., Lin, M.C., Manocha, D.: OBB-tree: A hierarchical structure for rapid interference detection. Comput. Graph. 30, 171-180 (1996); Proc. SIGGRAPH 1996
9. Hsu, D., Jiang, T., Reif, J., Sun, Z.: Bridge test for sampling narrow passages with proabilistic roadmap planners. In: Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pp. 4420-4426 (2003)
10. Hsu, D., Latombe, J.-C., Motwani, R.: Path planning in expansive configuration spaces. In: Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pp. 2719-2726 (1997)
11. Hsu, D., Sánchez-Ante, G., Sun, Z.: Hybrid PRM sampling with a cost-sensitive adaptive strategy. In: Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pp. 3885-3891 (2005)
12. Kavraki, L.E., Latombe, J.-C., Motwani, R., Raghavan, P.: Randomized query processing in robot path planning. In: Proc. ACM Symp. Theory of Computing (STOC), pp. 353-362 (May 1995)
13. 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)
14. Latombe, J.-C.: Robot Motion Planning. Kluwer Academic Publishers, Boston (1991)
15. La Valle, S.M., Kuffner, J.J.: Randomized kinodynamic planning. In: Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pp. 473-479 (1999)
16. Mazer, E., Ahuactzin, J.M., Bessiere, P.: The Ariadne's clew algorithm. Journal of Artificial Robotics Research (JAIR) 9, 295-316 (1998)
17. Morales, M., Tapia, L., Pearce, R., Rodriguez, S., Amato, N.M.: A machine learning approach for feature-sensitive motion planning. In: Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), Utrecht/Zeist, The Netherlands, pp. 361-376 (July 2004)
18. Morales, M.A., Pearce, A.R., Amato, N.M.: Metrics for comparing C-Space roadmaps. In: Proc. IEEE Int. Conf. Robot. Autom. (ICRA) (2006)
19. Nauli, S., Kuhlman, B., Baker, D.: Computer-based redesign of a protein folding pathway. Nature Struct. Biol. 8(7), 602-605 (2001)
20. Nissoux, C., Simeon, T., Laumond, J.-P.: Visibility based probabilistic roadmaps. In: Proc. IEEE Int. Conf. Intel. Rob. Syst (IROS), pp. 1316-1321 (1999)
21. Reif, J.H.: Complexity of the mover's problem and generalizations. In: Proc. IEEE Symp. Foundations of Computer Science (FOCS), San Juan, Puerto Rico, pp. 421-427 (October 1979)
22. Seidel, R.: On the all-pairs-shortest-path problem. In: Proc. 24th Annu. ACM Sympos. Theory Comput., pp. 745-749 (1992)
23. Song, G., Amato, N.M.: Using motion planning to study protein folding pathways. In: Proc. Int. Conf. Comput. Molecular Biology (RECOMB), pp. 287-296 (2001)
24. Thomas, S., Tang, X., Tapia, L., Amato, N.M.: Simulating protein motions with rigidity analysis. In: Proc. Int. Conf. Comput. Molecular Biology (RECOMB) (2006)
25. Wilmarth, S.A., Amato, N.M., Stiller, P.F.: MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space. In: Proc. IEEE Int. Conf. Robot. Autom. (ICRA), vol. 2, pp. 1024-1031 (1999)
26. Xie, D., Morales, M.A., Pearce, R., Thomas, S., Lien, J.-M., Amato, N.M.: Incremental map generation (IMG). Technical Report TR06-005, Parasol Lab, Dept. of Computer Science, Texas A&M University (March 2006)