Data association for mobile robot navigation: a graph theoretic approach
- 7 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 2512-2517
- https://doi.org/10.1109/robot.2000.846406
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Place learning and recognition using hidden Markov modelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Reactive Local Search for the Maximum Clique Problem1Algorithmica, 2001
- Neural network approach for solving the maximal common subgraph problemIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- An Autonomous Guided Vehicle for Cargo Handling ApplicationsThe International Journal of Robotics Research, 1996
- A robot exploration and mapping strategy based on a semantic hierarchy of spatial representationsRobotics and Autonomous Systems, 1991
- A fast line finder for vision-guided robot navigationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Least-Squares Fitting of Two 3-D Point SetsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Backtrack search algorithms and the maximal common subgraph problemSoftware: Practice and Experience, 1982
- Subgraph isomorphism, matching relational structures and maximal cliquesInformation Processing Letters, 1976
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973