Multi-level submap based SLAM using nested dissection

IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings

Volumn , Issue , 2010, Pages 2558-2565

  Ni, Kai ^a   Dellaert, Frank ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE APPROACH; BASE NODES; BATCH ALGORITHMS; CLUSTER TREE; GLOBAL COORDINATES; GRAPH REPRESENTATION; MULTI-LEVEL; NESTED DISSECTION; REAL WORLD EXPERIMENT; RIGID TRANSFORMATIONS; SPEED-UPS; SUBTREES;

DISTRIBUTED COMPUTER SYSTEMS; INFERENCE ENGINES; INTELLIGENT ROBOTS; OPTIMIZATION; TREES (MATHEMATICS);

CLUSTERING ALGORITHMS;

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

References (30)

1. B. Shneiderman, "Tree visualization with tree-maps: 2-d space-filling approach," in ACM Transactions on Graphics, 1992.
2. U. Frese and L. Schröder, "Closing a million-landmarks loop," in IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS), Oct 2006, pp. 5032-5039.
3. R. Kummerle, B. Steder, C. Dornhege, A. Kleiner, G. Grisetti, and W. Burgard, "Large scale graph-based slam using aerial images as prior information," in Robotics: Science and Systems (RSS), 2009.
4. S. Agarwal, N. Snavely, I. Simon, S. M. Seitz, and R. Szeliski, "Building rome in a day," in Intl. Conf. on Computer Vision (ICCV), Kyoto; Japan, October 2009.
5. S. Julier and J. Uhlmann, "A counter example to the theory of simultaneous localization and map building," in IEEE Intl. Conf. on Robotics and Automation (ICRA), vol. 4, 2001, pp. 4238-4243.
6. S. Williams, "Efficient solutions to autonomous mapping and navigation problems," Ph.D. dissertation, The University of Sydney, 2001.
7. M. Bosse, P. Newman, J. Leonard, and S. Teller, "Simultaneous localization and map building in large-scale cyclic environments using the Atlas framework," Intl. J. of Robotics Research, vol. 23, no. 12, pp. 1113-1139, Dec 2004.
8. C. Estrada, J. Neira, and J. D. Tardas, "Hierarchical SLAM: Real-time accurate mapping of large environments," IEEE Trans. Robotics, vol. 21, no. 4, pp. 588-596, Aug 2005.
9. L. Paz, J. Tardos, and J. Neira, "Divide and conquer : Ekf slam in o(n)," IEEE Trans. Robotics, vol. 24, no. 5, October 2008.
10. D. C. Brown, "The bundle adjustment - progress and prospects," Int. Archives Photogrammetry, vol. 21, no. 3, 1976.
11. J. A. George and J. W. H. Liu, Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, 1981.
12. J. Blair and B. Peyton, "An introduction to chordal graphs and clique trees," in Graph Theory and Sparse Matrix Computations, ser. IMA Volumes in Mathematics and its Applications, J. George, J. Gilbert, and J.-H. Liu, Eds. New York: Springer-Verlag, 1993, vol. 56, pp. 1-27.
13. F. Dellaert and M. Kaess, "Square Root SAM: Simultaneous localization and mapping via square root information smoothing," Intl. J. of Robotics Research, vol. 25, no. 12, pp. 1181-1203, Dec 2006.
14. M. Yannakakis, "Computing the minimum fill-in is np-complete," vol. 2, no. 1, pp. 77-79, 1981.
15. J. Liu, "Modification of the minimum-degree algorithm by multiple elimination," ACM Trans. Math. Softw., vol. 11, no. 2, pp. 141-153, 1985.
16. P. Amestoy, T. Davis, and I. Duff, "An approximate minimum degree ordering algorithm," SIAM Journal on Matrix Analysis and Applications, vol. 17, no. 4, pp. 886-905, 1996.
17. A. George, "Nested dissection of a regular finite element mesh," SIAM Journal on Numerical Analysis, vol. 10, no. 2, pp. 345-363, April 1973.
18. R. Lipton and R. Tarjan, "Generalized nested dissection," SIAM Journal on Applied Mathematics, vol. 16, no. 2, pp. 346-358, 1979.
19. P. Krauthausen, F. Dellaert, and A. Kipp, "Exploiting locality by nested dissection for square root smoothing and mapping," in Robotics: Science and Systems (RSS), 2006.
20. L. Grigori, E. Boman, S. Donfack, and T. A. Davis, "Hypergraph-based unsymmetric nested dissection ordering for sparse lu factorization," University of Florida, Tech. Rep., April 2008.
21. M. A. Paskin, "Thin junction tree filters for simultaneous localization and mapping," in Intl. Joint Conf. on AI (IJCAI), 2003.
22. U. Frese, "Efficient 6-dof slam with treemap as a generic backend," in IEEE Intl. Conf. on Robotics and Automation (ICRA), 2007.
23. G. Grisetti, R. Kummerle, C. Stachniss, U. Frese, and C. Hertzberg, "Hierarchical optimization on manifolds for online 2d and 3d mapping," in IEEE Intl. Conf. on Robotics and Automation (ICRA), 2010.
24. K. Ni, D. Steedly, and F. Dellaert, "Tectonic SAM: Exact; out-of-core; submap-based SLAM," in IEEE Intl. Conf. on Robotics and Automation (ICRA), Rome; Italy, April 2007.
25. D. Koller and N. Friedman, Probabilistic Graphical Models: Principles and Techniques. The MIT Press, August 2009.
26. F. Kschischang, B. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, no. 2, February 2001.
27. H. Durrant-Whyte and T. Bailey, "Simultaneous localisation and mapping (SLAM): Part I the essential algorithms," Robotics & Automation Magazine, Jun 2006.
28. G. Karypis, V. Kumar, and V. Kumar, "Multilevel k-way partitioning scheme for irregular graphs," Journal of Parallel and Distributed Computing, vol. 48, pp. 96-129, 1998.
29. T. A. Davis, "Multifrontal multithreaded rank-revealing sparse qr factorization," University of Florida, Tech. Rep., 2009.
30. G. Grisetti, C. Stachniss, and W. Burgard, "Non-linear constraint network optimization for efficient map learning," Trans. on Intelligent Transportation systems, 2009.