메뉴 건너뛰기




Volumn 3, Issue , 2000, Pages 2512-2517

Data association for mobile robot navigation: a graph theoretic approach

Author keywords

[No Author keywords available]

Indexed keywords

DATA ASSOCIATION; MAXIMUM COMMON SUBGRAPH; MOBILE ROBOT NAVIGATION; TWO DIMENSIONAL SCANNING LASER SENSOR;

EID: 0033721825     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (128)

References (16)
  • 1
    • 84890517975 scopus 로고
    • Least squares fitting of two 3-D point sets
    • Arun K. S., Huang T. S., Blostein S. D., "Least Squares Fitting of Two 3-D Point Sets", IEEE Transactions on PAMI, vol. 9, no. 5, pp. 698-700, 1987.
    • (1987) IEEE Transactions on PAMI , vol.9 , Issue.5 , pp. 698-700
    • Arun, K.S.1    Huang, T.S.2    Blostein, S.D.3
  • 4
    • 3142669879 scopus 로고
    • Subgraph isomorphism, matching relational structures and maximal cliques
    • Barrow H.G., Burstall R.M., "Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques", Informaiion Processing Letters, vol. 4, no. 4, pp. 83-84, 1976.
    • (1976) Informaiion Processing Letters , vol.4 , Issue.4 , pp. 83-84
    • Barrow, H.G.1    Burstall, R.M.2
  • 7
    • 84976668743 scopus 로고
    • Algorithm 457 - Finding all cliques of an undirected graph
    • Bron C., Kerbosch J., "Algorithm 457 - Finding all Cliques of an Undirected Graph", Communications of ihe ACM, vol. 16, pp. 575-577, 1973.
    • (1973) Communications of Ihe ACM , vol.16 , pp. 575-577
    • Bron, C.1    Kerbosch, J.2
  • 13
    • 0026258475 scopus 로고
    • A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations
    • Kuipers B. J., Byun Y. T., "A Robot Exploration and Mapping Strategy Based on a Semantic Hierarchy of Spatial Representations", Journal of Robotics and Auionomous Systems, pp. 47-63, 1991.
    • (1991) Journal of Robotics and Auionomous Systems , pp. 47-63
    • Kuipers, B.J.1    Byun, Y.T.2
  • 14
    • 0019909679 scopus 로고
    • Backtrack search algorithms and the maximal common subgraph problem
    • McGregor J. J., "Backtrack Search Algorithms and the Maximal Common Subgraph Problem", Sofhvare-Practice and Experience, vol. 12, pp. 23-34, 1982.
    • (1982) Sofhvare-Practice and Experience , vol.12 , pp. 23-34
    • McGregor, J.J.1
  • 15
    • 0030270310 scopus 로고    scopus 로고
    • Neural network approach for solving the maximal common subgraph problem
    • Shoukry A., Aboutabl M., "Neural Network Approach for Solving the Maximal Common Subgraph Problem", IEEE Transactions on Systems, Man, andcyberneiics, vol. 26, no. 5, pp. 785-790, 1996.
    • (1996) IEEE Transactions on Systems, Man, Andcyberneiics , vol.26 , Issue.5 , pp. 785-790
    • Shoukry, A.1    Aboutabl, M.2
  • 16
    • 0003383658 scopus 로고    scopus 로고
    • Satellite constellation and geometric dilution of precision
    • Spilker J. J., "Satellite Constellation and Geometric Dilution of Precision", Progress in Astronautics and Aeronauircs, vol. 163, pp. 177-208, 1996.
    • (1996) Progress in Astronautics and Aeronauircs , vol.163 , pp. 177-208
    • Spilker, J.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.