메뉴 건너뛰기




Volumn 47, Issue , 2008, Pages 253-267

Competitive disconnection detection in on-line mobile robot navigation

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPETITION; FOUNDATIONS; INDUSTRIAL ECONOMICS; MOBILE ROBOTS; NAVIGATION; NAVIGATION SYSTEMS; QUADRATIC PROGRAMMING; ROBOTICS; TARGETS; TECHNICAL PRESENTATIONS;

EID: 53949113118     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/978-3-540-68405-3_16     Document Type: Conference Paper
Times cited : (2)

References (21)
  • 3
    • 0000335670 scopus 로고
    • Problem 63-9
    • Bellman, R.: Problem 63-9. SIAM Review 5(2) (1963)
    • (1963) SIAM Review , vol.5 , Issue.2
    • Bellman, R.1
  • 5
    • 84981460967 scopus 로고
    • Navigating in unfamiliar terrain
    • Blum, A., Raghavan, P., Schieber, B.: Navigating in unfamiliar terrain. STOC, 494-504 (1991)
    • (1991) STOC , pp. 494-504
    • Blum, A.1    Raghavan, P.2    Schieber, B.3
  • 6
    • 0029205883 scopus 로고
    • Sensor based planning, part ii: Incremental construction of the generalized voronoi graph
    • Choset, H., Burdick, J.W.: Sensor based planning, part ii: Incremental construction of the generalized voronoi graph. In: IEEE Int. Conference on Robotics and Automation, pp. 1643-1649 (1995)
    • (1995) IEEE Int. Conference on Robotics and Automation , pp. 1643-1649
    • Choset, H.1    Burdick, J.W.2
  • 9
    • 0032644227 scopus 로고    scopus 로고
    • Motion planning in an unknown polygonal environment with bounded performance guarantee
    • Datta, A., Soundaralakshmi, S.: Motion planning in an unknown polygonal environment with bounded performance guarantee. In: IEEE Int. Conf. on Robotics and Automation, pp. 1032-1037 (1999)
    • (1999) IEEE Int. Conf. on Robotics and Automation , pp. 1032-1037
    • Datta, A.1    Soundaralakshmi, S.2
  • 11
    • 2342634325 scopus 로고    scopus 로고
    • Instabilities of robot motion
    • Farber, M.: Instabilities of robot motion. Topology and its Applications 140, 245-266 (2004)
    • (2004) Topology and its Applications , vol.140 , pp. 245-266
    • Farber, M.1
  • 13
    • 33846121619 scopus 로고    scopus 로고
    • Cbug: A quadratically competitive mobile robot navigation algorithm
    • Gabriely, Y., Rimon, E.: Cbug: A quadratically competitive mobile robot navigation algorithm. In: IEEE Int. Conf. on Robotics and Automation, pp. 954-960 (2005)
    • (2005) IEEE Int. Conf. on Robotics and Automation , pp. 954-960
    • Gabriely, Y.1    Rimon, E.2
  • 15
    • 0032165557 scopus 로고    scopus 로고
    • Tangentbug: A range-sensor based navigation algorithm
    • Kamon, I., Rimon, E., Rivlin, E.: Tangentbug: A range-sensor based navigation algorithm. Int. Journal of Robotics Research 17(9), 934-953 (1998)
    • (1998) Int. Journal of Robotics Research , vol.17 , Issue.9 , pp. 934-953
    • Kamon, I.1    Rimon, E.2    Rivlin, E.3
  • 17
    • 0023568758 scopus 로고
    • Path planning strategies for point automaton moving amidst unknown obstacles of arbitrary shape
    • Lumelsky, V.J., Stepanov, A.: Path planning strategies for point automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica 2, 403-430 (1987)
    • (1987) Algorithmica , vol.2 , pp. 403-430
    • Lumelsky, V.J.1    Stepanov, A.2
  • 18
    • 0027801091 scopus 로고
    • An on-line and deadlock-free path-planning algorithm based on world topology
    • IEEE/RSJ
    • Noborio, H., Yoshioka, T.: An on-line and deadlock-free path-planning algorithm based on world topology. In: Conf. on Intelligent Robots and Systems, IROS, pp. 1425-1430. IEEE/RSJ (1993)
    • (1993) Conf. on Intelligent Robots and Systems, IROS , pp. 1425-1430
    • Noborio, H.1    Yoshioka, T.2
  • 20
    • 0025749041 scopus 로고
    • Path planning for moving a point object amidst unknown obstacles in a plane: The universal lower bound on worst case path lengths and a classification of algorithms
    • Sankaranarayanan, A., Vidyasagar, M.: Path planning for moving a point object amidst unknown obstacles in a plane: the universal lower bound on worst case path lengths and a classification of algorithms. In: IEEE Int. Conf. on Robotics and Automation, pp. 1734-1941 (1991)
    • (1991) IEEE Int. Conf. on Robotics and Automation , pp. 1734-1941
    • Sankaranarayanan, A.1    Vidyasagar, M.2


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