메뉴 건너뛰기




Volumn , Issue , 2011, Pages 76-83

A polynomial-time algorithm for non-optimal multi-agent pathfinding

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTIVE PROOF; LINEAR-TIME; MULTIPLE AGENTS; PATHFINDING; POLYNOMIAL-TIME ALGORITHMS; SUB-OPTIMAL ALGORITHMS; TREE-BASED;

EID: 84875584389     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (63)

References (10)
  • 2
    • 76249085329 scopus 로고    scopus 로고
    • Solvability of multi robot motion planning problems on trees
    • Ellips Masehian and Azadeh Hassan Nejad. Solvability of multi robot motion planning problems on trees. In IROS, pages 5936-5941, 2009.
    • (2009) IROS , pp. 5936-5941
    • Masehian, E.1    Nejad, A.H.2
  • 4
    • 44449122353 scopus 로고    scopus 로고
    • Exploiting subgraph structure in multi-robot path planning
    • March
    • Malcolm R. K. Ryan. Exploiting subgraph structure in multi-robot path planning. J. Artif. Int. Res., 31:497-542, March 2008.
    • (2008) J. Artif. Int. Res , vol.31 , pp. 497-542
    • Malcolm, R.1    Ryan, K.2
  • 5
    • 77955789592 scopus 로고    scopus 로고
    • Constraint-based multi-robot path planning
    • Malcolm Ryan. Constraint-based multi-robot path planning. In ICRA, pages 922-928, 2010
    • (2010) ICRA , pp. 922-928
    • Ryan, M.1
  • 6
    • 26944472983 scopus 로고    scopus 로고
    • Cooperative pathfinding
    • David Silver. Cooperative pathfinding. In AIIDE, pages 117-122, 2005.
    • (2005) AIIDE , pp. 117-122
    • Silver, D.1
  • 7
    • 85151046953 scopus 로고    scopus 로고
    • Finding optimal solutions to cooperative pathfinding problems
    • T. S. Standley. Finding optimal solutions to cooperative pathfinding problems. In AAAI, 2010.
    • (2010) AAAI
    • Standley, T.S.1
  • 8
    • 84893447954 scopus 로고    scopus 로고
    • Making solutions of multi-robot path planning problems shorter using weak transpositions and critical path parallelism
    • Pavel Surynek. Making solutions of multi-robot path planning problems shorter using weak transpositions and critical path parallelism. In Proceedings of the 2009 International Symposium on Combinatorial Search, 2009.
    • (2009) Proceedings of the 2009 International Symposium on Combinatorial Search
    • Surynek, P.1
  • 9
    • 58849143928 scopus 로고    scopus 로고
    • Fast and memoryefficient multi-agent pathfinding
    • Ko-Hsin Cindy Wang and Adi Botea. Fast and memoryefficient multi-agent pathfinding. In ICAPS, pages 380-387, 2008.
    • (2008) ICAPS , pp. 380-387
    • Wang, K.-H.C.1    Botea, A.2


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