메뉴 건너뛰기




Volumn 41, Issue 2-3, 2002, Pages 89-99

Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots

Author keywords

Mobile robot navigation; Multi robot coordination; Path planning

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MOTION PLANNING; NAVIGATION; OPTIMIZATION; ROBOTICS;

EID: 0037202511     PISSN: 09218890     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0921-8890(02)00256-7     Document Type: Conference Paper
Times cited : (220)

References (22)
  • 1
    • 0003896351 scopus 로고
    • Kluwer Academic Publishers, Boston, MA, ISBN 0-7923-9206-X
    • J. Latombe, Robot Motion Planning, Kluwer Academic Publishers, Boston, MA, 1991. ISBN 0-7923-9206-X.
    • (1991) Robot Motion Planning
    • Latombe, J.1
  • 3
    • 0003837936 scopus 로고    scopus 로고
    • Ph.D. Thesis, University of Southern California
    • M. McHenry, Slice-based path planning, Ph.D. Thesis, University of Southern California, 1998.
    • (1998) Slice-based path planning
    • McHenry, M.1
  • 15
    • 0026880820 scopus 로고
    • A minimum-time trajectory planning method for two robots
    • Bien Z., Lee J. A minimum-time trajectory planning method for two robots IEEE Transactions on Robotics and Automation 8 3 1992 414-418.
    • (1992) IEEE Transactions on Robotics and Automation , vol.8 , Issue.3 , pp. 414-418
    • Bien, Z.1    Lee, J.2
  • 18
    • 0002668912 scopus 로고
    • Approximate reasoning using anytime algorithms
    • S. Natarajan (Ed.), Kluwer Academic Publishers, Dordrecht
    • S. Zilberstein, S. Russell, Approximate reasoning using anytime algorithms, in: S. Natarajan (Ed.), Imprecise and Approximate Computation, Kluwer Academic Publishers, Dordrecht, 1995.
    • (1995) Imprecise and Approximate Computation
    • Zilberstein, S.1    Russell, S.2


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