Single-cluster spectral graph partitioning for robotics applications

Robotics: Science and Systems

Volumn 1, Issue , 2005, Pages 265-272

  Olson, Edwin ^a   Walter, Matthew ^a   Teller, Seth ^a   Leonard, John ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGRICULTURAL ROBOTS; GRAPH ALGORITHMS; GRAPH THEORY; NP-HARD; POLYNOMIAL APPROXIMATION; ROBOTICS;

ADJACENCY MATRICES; APPROXIMATE SOLUTION; DATA ASSOCIATION ALGORITHMS; LINE FITTING; POLYNOMIAL-TIME; ROBOTICS APPLICATIONS; SPECTRAL GRAPH PARTITIONING; SPECTRAL PROPERTIES;

CLUSTERING ALGORITHMS;

EID: 84959508519     PISSN: None     EISSN: 2330765X     Source Type: Conference Proceeding    
DOI: 10.15607/rss.2005.i.035     Document Type: Conference Paper

References (17)

1. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), pp. 888-905, August 2000.
2. C. Ding, X. He, H. Zha, M. Gu, and H. D. Simon, "A minmaxcut spectral method for data clustering and graph partitioning," Lawrence Berkeley National Laboratory, Tech. Rep. 54111, 2003.
3. W. Donath and A. Hoffman, "Lower bounds for the partitioning of graphs," IBM J. of Research and Developement, vol. 17, pp. 420-425, 1973.
4. M. Fiedler, "Algebraic connectivity of graphs," Czecheslovak Mathematical Journal, vol. 23, no. 98, pp. 298-305, 1973.
5. M. Fiedler , "A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory,"Czecheslovak Mathematical Journal, vol. 25, no. 100, pp. 619-633, 1975.
6. M. Fiedler, "Laplacians of graphs and algebraic connectivity," in Combinatorics and Graph Theory, ser. Banach Center Publications, vol. 25, Warsaw, 1989, pp. 57-70.
7. P. Perona and W. Freeman, "A factorization approach to grouping," Lecture Notes in Computer Science, vol. 1406, pp. 655-670, 1998. [Online]. Available: citeseer.ist.psu.edu/perona98factorization.html
8. H. Zha, X. He, C. Ding, H. Simon, and M. Gu, "Bipartite graph partitioning and data clustering," in CIKM '01: Proceedings of the tenth international conference on Information and knowledge management. ACM Press, 2001, pp. 25-32.
9. M. A. Fischer and R. C. Bolles, "A paradigm for model-fi tting with applications to image analysis and automated cartography," 1981.
10. J. Neira and J. D. Tardos, "Data association in stochastic mapping using the joint compatibility test," IEEE Transactions on Robotics and Automation, December 2001.
11. R. A. Horn, Topics in matrix analysis. New York, NY, USA: Cambridge University Press, 1986.
12. G. Strang, Introduction to Linear Algebra. Wellesley-Cambridge Press, 1993.
13. M. Montemerlo, "Fastslam: A factored solution to the simultaneous localization and mapping problem with unknown data association," Ph.D. dissertation, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, July 2003.
14. J. J. Leonard and R. J. Rikoski, "Incorporation of delayed decision making into stochastic mapping," in Proceedings of Autonomous Underwater Vehicles, 2000, pp. 533-542.
15. E. Olson, J. Leonard, and S. Teller, "Robust range-only beacon localization," in IEEE Autonomous Underwater Vehicles (AUV '04), 2004.
16. P. M. Newman and J. Leonard, "Pure range-only sub-sea SLAM," in Proceedings of the IEEE Conference on Robotics and Automation (ICRA '02), 2003.
17. G. A. Kantor and S. Singh, "Preliminary results in range-only localization and mapping," in Proceedings of the IEEE Conference on Robotics and Automation (ICRA '02), May 2002.