Exploiting Locality in SLAM by Nested Dissection

Presented at the 2006 Robotics: Science and Systems Conference II (RSS), 16-19 August 2006, Philadelphia, PA.

[1]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[2]  Michael Bosse,et al.  An Atlas framework for scalable mapping , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[3]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[4]  J. M. M. Montiel,et al.  The SPmap: a probabilistic framework for simultaneous localization and map building , 1999, IEEE Trans. Robotics Autom..

[5]  Eduardo Mario Nebot,et al.  The HYbrid metric maps (HYMMs): a novel map representation for DenseSLAM , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[6]  D. Rose,et al.  Generalized nested dissection , 1977 .

[7]  Vipin Kumar,et al.  Multilevel Algorithms for Multi-Constraint Graph Partitioning , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[8]  J. Leonard,et al.  Decoupled Stochastic Mapping , 2001 .

[9]  Timothy A. Davis,et al.  Algorithm 8 xx : a concise sparse Cholesky factorization package , 2004 .

[10]  Illah R. Nourbakhsh,et al.  The mobot museum robot installations: a five year experiment , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[11]  John J. Leonard,et al.  Decoupled stochastic mapping [for mobile robot & AUV navigation] , 2001 .

[12]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[13]  Peter C. Cheeseman,et al.  Estimating uncertain spatial relationships in robotics , 1986, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[14]  Andrew W. Fitzgibbon,et al.  Bundle Adjustment - A Modern Synthesis , 1999, Workshop on Vision Algorithms.

[15]  Tom Duckett,et al.  A Multigrid Approach for Acceleration Relaxation-Based SLAM , 2003, AMS.

[16]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[17]  Frank Dellaert,et al.  Square Root SAM , 2005, Robotics: Science and Systems.

[18]  Patrick R. Amestoy,et al.  An Approximate Minimum Degree Ordering Algorithm , 1996, SIAM J. Matrix Anal. Appl..

[19]  Joseph W. H. Liu,et al.  Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.

[20]  Timothy A. Davis,et al.  A column approximate minimum degree ordering algorithm , 2000, TOMS.

[21]  Frank Dellaert,et al.  Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing , 2006, Int. J. Robotics Res..

[22]  Henrik I. Christensen,et al.  Graphical SLAM - a self-correcting map , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[23]  P. Heggernes,et al.  Finding Good Column Orderings for Sparse QR Factorization , 1996 .

[24]  Udo Frese.  Treemap: An O(log n) Algorithm for Simultaneous Localization and Mapping , 2004, Spatial Cognition.

[25]  Vipin Kumar,et al.  Highly Scalable Parallel Algorithms for Sparse Matrix Factorization , 1997, IEEE Trans. Parallel Distributed Syst..

[26]  Mark A. Paskin,et al.  Thin Junction Tree Filters for Simultaneous Localization and Mapping , 2002, IJCAI.

[27]  Wolfram Burgard,et al.  Probabilistic Algorithms and the Interactive Museum Tour-Guide Robot Minerva , 2000, Int. J. Robotics Res..

[28]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[29]  Ingemar J. Cox,et al.  Dynamic Map Building for an Autonomous Mobile Robot , 1992 .