메뉴 건너뛰기




Volumn 27, Issue 2, 1998, Pages 583-604

Localizing a robot with minimum travel

Author keywords

Competitive strategy; Localization; Navigation; NP hard; Optimization; Positioning; Robot; Sensing; Visibility

Indexed keywords


EID: 0013411157     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794279201     Document Type: Article
Times cited : (50)

References (31)
  • 2
    • 84969929065 scopus 로고
    • Locating a robot with angle measurements
    • D. AVIS AND H. IMAI, Locating a robot with angle measurements, J. Symbolic Comput., 10 (1990), pp. 311-326.
    • (1990) J. Symbolic Comput. , vol.10 , pp. 311-326
    • Avis, D.1    Imai, H.2
  • 4
    • 1542765940 scopus 로고
    • Homing using combinations of model views
    • Chambery, France, August Morgan Kaufmann Publishers, San Francisco, CA
    • R. BASRI AND E. RIVLIN, Homing using combinations of model views, in Proc. 13th Internat. Joint Conference on Artificial Intelligence (IJCAI-93), Chambery, France, August 1993, Morgan Kaufmann Publishers, San Francisco, CA, pp. 1586-1591.
    • (1993) Proc. 13th Internat. Joint Conference on Artificial Intelligence (IJCAI-93) , pp. 1586-1591
    • Basri, R.1    Rivlin, E.2
  • 5
    • 85012701616 scopus 로고
    • Map learning with indistinguishable locations
    • M. Henrion, L. N. Kanal, and J. F. Lemmer, eds., Elsevier Science Publishers, New York
    • K. BASYE AND T. DEAN, Map learning with indistinguishable locations, in Uncertainty in Artificial Intelligence 5, M. Henrion, L. N. Kanal, and J. F. Lemmer, eds., Elsevier Science Publishers, New York, 1990, pp. 331-340.
    • (1990) Uncertainty in Artificial Intelligence , vol.5 , pp. 331-340
    • Basye, K.1    Dean, T.2
  • 6
    • 38249007487 scopus 로고
    • Probing polygons minimally is hard
    • P. BELLEVILLE AND T. C. SHERMER, Probing polygons minimally is hard, Comput. Geom., 2 (1993), pp. 255-265.
    • (1993) Comput. Geom. , vol.2 , pp. 255-265
    • Belleville, P.1    Shermer, T.C.2
  • 8
    • 84957669754 scopus 로고
    • Mobile robot localization using landmarks
    • Munich, Germany, September IEEE Computer Society Press, Los Alamitos, CA, To appear in IEEE Trans, on Robotics and Automation
    • M. BETKE AND L. GURVITS, Mobile robot localization using landmarks, in Proc. IEEE/RSJ/GI Internat. Conference on Intelligent Robots and Systems, Munich, Germany, September 1994, IEEE Computer Society Press, Los Alamitos, CA, pp. 135-142. To appear in IEEE Trans, on Robotics and Automation.
    • (1994) Proc. IEEE/RSJ/GI Internat. Conference on Intelligent Robots and Systems , pp. 135-142
    • Betke, M.1    Gurvits, L.2
  • 10
    • 0003187777 scopus 로고    scopus 로고
    • A. BLUM, P. RAGHAVAN, AND B. SCHIEBER, Navigating in unfamiliar geometric terrain, in Proc. 23rd Annual ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 494-504; SIAM J. Comput., 26 (1997), pp. 110-137.
    • (1997) SIAM J. Comput. , vol.26 , pp. 110-137
  • 11
    • 1542555584 scopus 로고
    • Master's thesis, University of Waterloo, Waterloo, Ontario, Canada, December
    • P. K. BOSE, Visibility in Simple Polygons, Master's thesis, University of Waterloo, Waterloo, Ontario, Canada, December, 1991.
    • (1991) Visibility in Simple Polygons
    • Bose, P.K.1
  • 12
    • 0012957851 scopus 로고
    • Efficient visibility queries in simple polygons
    • C. A. Wang, ed., St. John's, Newfoundland, Canada, August 10-14, Memorial University of Newfoundland
    • P. K. BOSE, A. LUBIW, AND J. I. MUNRO, Efficient visibility queries in simple polygons, in Proc. 4th Canadian Conference on Computational Geometry, C. A. Wang, ed., St. John's, Newfoundland, Canada, August 10-14, 1992, Memorial University of Newfoundland, pp. 23-28.
    • (1992) Proc. 4th Canadian Conference on Computational Geometry , pp. 23-28
    • Bose, P.K.1    Lubiw, A.2    Munro, J.I.3
  • 13
    • 0028056596 scopus 로고
    • Competitive searching in a generalized street
    • Stony Brook, NY, June 6-8, ACM Press, New York
    • A. DATTA AND C. ICKING, Competitive searching in a generalized street, in Proc. 10th Annual ACM Symposium on Computational Geometry, Stony Brook, NY, June 6-8, 1994, ACM Press, New York, pp. 175-182.
    • (1994) Proc. 10th Annual ACM Symposium on Computational Geometry , pp. 175-182
    • Datta, A.1    Icking, C.2
  • 16
    • 0348165191 scopus 로고
    • Performance guarantees for motion planning with temporal uncertainty
    • P. EADES, X. LIN, AND N. WORMALD, Performance guarantees for motion planning with temporal uncertainty, Austral. Comput. J., 25 (1993), pp. 21-28.
    • (1993) Austral. Comput. J. , vol.25 , pp. 21-28
    • Eades, P.1    Lin, X.2    Wormald, N.3
  • 18
    • 0000955797 scopus 로고
    • A linear algorithm for computing the visibility polygon from a point
    • H. A. E. GINDY AND D. AVIS, A linear algorithm for computing the visibility polygon from a point, J. Algorithms, 2 (1981), pp. 186-197.
    • (1981) J. Algorithms , vol.2 , pp. 186-197
    • Gindy, H.A.E.1    Avis, D.2
  • 19
    • 0023247608 scopus 로고
    • Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
    • L. J. GUIBAS, J. HERSHBERGER, D. LEVEN, M. SHARIR, AND R. E. TARJAN, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica, 2 (1987), pp. 209-233.
    • (1987) Algorithmica , vol.2 , pp. 209-233
    • Guibas, L.J.1    Hershberger, J.2    Leven, D.3    Sharir, M.4    Tarjan, R.E.5
  • 21
    • 0001815269 scopus 로고
    • Constructing optimal binary decision trees is NP-complete
    • L. HYAFIL AND R. L. RIVEST, Constructing optimal binary decision trees is NP-complete, Inform. Process. Lett., 5 (1976), pp. 15-17.
    • (1976) Inform. Process. Lett. , vol.5 , pp. 15-17
    • Hyafil, L.1    Rivest, R.L.2
  • 22
    • 0027035404 scopus 로고
    • Walking an unknown street with bounded detour
    • R. KLEIN, Walking an unknown street with bounded detour, Comput. Geom., 1 (1992), pp. 325-351.
    • (1992) Comput. Geom. , vol.1 , pp. 325-351
    • Klein, R.1
  • 24
    • 0000636382 scopus 로고
    • The localization problem for mobile robots
    • Santa Fe, NM, November 20-22, IEEE Computer Society Press, Los Alamitos, CA
    • J. KLEINBERG, The localization problem for mobile robots, in Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, Santa Fe, NM, November 20-22, 1994, IEEE Computer Society Press, Los Alamitos, CA, pp. 521-533.
    • (1994) Proc. 35th Annual IEEE Symposium on Foundations of Computer Science , pp. 521-533
    • Kleinberg, J.1
  • 25
    • 0027316806 scopus 로고
    • Vision-guided mobile robot navigation using retroactive updating of position uncertainty
    • Atlanta, GA, May, IEEE Computer Society Press, Los Alamitos, CA
    • A. KOSAKA, M. MENG, AND A. C. KAK, Vision-guided mobile robot navigation using retroactive updating of position uncertainty, in Proc. IEEE Internat. Conference on Robotics and Automation, Volume 2, Atlanta, GA, May, 1993, IEEE Computer Society Press, Los Alamitos, CA, pp. 1-7.
    • (1993) Proc. IEEE Internat. Conference on Robotics and Automation , vol.2 , pp. 1-7
    • Kosaka, A.1    Meng, M.2    Kak, A.C.3
  • 26
    • 0009357678 scopus 로고
    • A qualitative approach to robot exploration and map-learning
    • Los Altos, CA, IEEE Computer Society Press, Los Alamitos, CA
    • B. J. KUIPERS AND Y. T. BYUN, A qualitative approach to robot exploration and map-learning, in Proc. IEEE Workshop on Spatial Reasoning and Multi-Sensor Fusion, Los Altos, CA, 1987, IEEE Computer Society Press, Los Alamitos, CA, pp. 390-404.
    • (1987) Proc. IEEE Workshop on Spatial Reasoning and Multi-Sensor Fusion , pp. 390-404
    • Kuipers, B.J.1    Byun, Y.T.2
  • 27
  • 28
    • 0021483844 scopus 로고
    • Euclidean shortest paths in the presence of rectilinear barriers
    • D. LEE AND F. P. PREPARATA, Euclidean shortest paths in the presence of rectilinear barriers, Networks, 14 (1984), pp. 393-410.
    • (1984) Networks , vol.14 , pp. 393-410
    • Lee, D.1    Preparata, F.P.2
  • 30
    • 0022012946 scopus 로고
    • Amortized efficiency of list update and paging rules
    • D. D. SLEATOR AND R. E. TARJAN, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202-208.
    • (1985) Comm. ACM , vol.28 , pp. 202-208
    • Sleator, D.D.1    Tarjan, R.E.2
  • 31
    • 0026940009 scopus 로고
    • Position estimation for an autonomous mobile robot in an outdoor environment
    • R. TALLURI AND J. K. AGGARWAL, Position estimation for an autonomous mobile robot in an outdoor environment, IEEE Trans. on Robotics and Automation, 8 (1992), pp. 573-584.
    • (1992) IEEE Trans. on Robotics and Automation , vol.8 , pp. 573-584
    • Talluri, R.1    Aggarwal, J.K.2


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