메뉴 건너뛰기




Volumn 93, Issue 1, 1999, Pages 89-108

Relocalization - Theory and practice

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0042205837     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-218x(99)00008-6     Document Type: Article
Times cited : (4)

References (11)
  • 3
    • 0026136157 scopus 로고
    • Blanche - An experiment in guidance and navigation of an autonomous robot vehicle
    • I.J. Cox, Blanche - an experiment in guidance and navigation of an autonomous robot vehicle, IEEE Trans. Robot. Automat. 7 (2) (1991) 193-204.
    • (1991) IEEE Trans. Robot. Automat. , vol.7 , Issue.2 , pp. 193-204
    • Cox, I.J.1
  • 5
    • 0002511132 scopus 로고
    • The robot localization problem
    • K. Goldberg, D. Halperin, J.-C. Latombe, R. Wilson (Eds.)
    • L.J. Guibas, R. Motwani, P. Raghavan, The robot localization problem, in: K. Goldberg, D. Halperin, J.-C. Latombe, R. Wilson (Eds.), Algorithmic Foundations of Robotics A.K. Peters, 1995, pp. 269 -282. http://theory.stanford.edu/people/motwani/postscripts/localiz.ps.Z.
    • (1995) Algorithmic Foundations of Robotics A.K. Peters , pp. 269-282
    • Guibas, L.J.1    Motwani, R.2    Raghavan, P.3
  • 6
    • 0005089781 scopus 로고    scopus 로고
    • A sharper complexity bound for the robot localization problem
    • Department of Computer Science I, University of Würzburg, June
    • O. Karch, A sharper complexity bound for the robot localization problem, Technical Report No. 139, Department of Computer Science I, University of Würzburg, June 1996. http://www-infol.informatik.uni-wuerzburg.de/publications/karch/tr139.ps.gz.
    • (1996) Technical Report No. 139 , vol.139
    • Karch, O.1
  • 7
    • 0029184961 scopus 로고
    • LEDA - A platform for combinatorial and geometric computing
    • K. Mehlhorn, S. Näher, LEDA - a platform for combinatorial and geometric computing, Commun. ACM 38 (1995) 96-102. http://www.mpi-sb.mpg.de/guide/staff/uhrig/ledapub/reports/leda.ps.Z.
    • (1995) Commun. ACM , vol.38 , pp. 96-102
    • Mehlhorn, K.1    Näher, S.2
  • 8
    • 0041976365 scopus 로고
    • A data structure for representing and efficient querying large scenes of geometric objects: MB-trees
    • G. Farin, H. Hagen, H. Noltemeier (Eds.), Springer, Berlin
    • H. Noltemeier, K. Verbarg, C. Zirkelbach, A data structure for representing and efficient querying large scenes of geometric objects: MB-trees, in: G. Farin, H. Hagen, H. Noltemeier (Eds.), Geometric Modelling, Computing Supplement, vol. 8. Springer, Berlin, 1993, pp. 211-226.
    • (1993) Geometric Modelling, Computing Supplement , vol.8 , pp. 211-226
    • Noltemeier, H.1    Verbarg, K.2    Zirkelbach, C.3
  • 9
    • 0041801666 scopus 로고    scopus 로고
    • Efficient robot self-localization in simple polygons
    • O. Karch, H. Noltemeier, K. Verbarg (Eds.), University of Würzburg
    • S. Schuierer, Efficient robot self-localization in simple polygons, in: O. Karch, H. Noltemeier, K. Verbarg (Eds.), 13th European Workshop on Computational Geometry (CG '97), University of Würzburg, 1997, pp. 20-22.
    • (1997) 13th European Workshop on Computational Geometry (CG '97) , pp. 20-22
    • Schuierer, S.1
  • 11
    • 0042476972 scopus 로고
    • Location estimation and uncertainty analysis for mobile robots
    • I.J. Cox, G.T. Wilfong (Eds.), Springer, Berlin
    • C.M. Wang, Location estimation and uncertainty analysis for mobile robots, in: I.J. Cox, G.T. Wilfong (Eds.), Autonomous Robot Vehicles, Springer, Berlin, 1990.
    • (1990) Autonomous Robot Vehicles
    • Wang, C.M.1


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