메뉴 건너뛰기




Volumn 1, Issue , 2010, Pages 173-178

Finding optimal solutions to cooperative pathfinding problems

Author keywords

[No Author keywords available]

Indexed keywords

MULTI AGENT SYSTEMS;

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

References (12)
  • 2
    • 84883230894 scopus 로고    scopus 로고
    • Biased cost pathfinding
    • Laird, J. E., and Schaeffer, J., eds. The AAAI Press
    • Geramifard, A.; Chubak, P.; and Bulitko, V. 2006. Biased cost pathfinding. In Laird, J. E., and Schaeffer, J., eds., AIIDE, 112-114. The AAAI Press.
    • (2006) AIIDE , pp. 112-114
    • Geramifard, A.1    Chubak, P.2    Bulitko, V.3
  • 4
    • 25444523204 scopus 로고    scopus 로고
    • PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
    • Hearn, R. A., and Demaine, E. D. 2005. PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. 343(1-2):72-96.
    • (2005) Theor. Comput. Sci. , vol.343 , Issue.1-2 , pp. 72-96
    • Hearn, R.A.1    Demaine, E.D.2
  • 5
    • 0021589170 scopus 로고
    • On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the warehouseman's problem
    • Hopcroft, J.; Schwartz, J.; and Sharir, M. 1984. On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE-Hardness of the Warehouseman's Problem. The International Journal of Robotics Research 3(4):76-88.
    • (1984) The International Journal of Robotics Research , vol.3 , Issue.4 , pp. 76-88
    • Hopcroft, J.1    Schwartz, J.2    Sharir, M.3
  • 6
    • 84883059022 scopus 로고    scopus 로고
    • Direction maps for cooperative pathfinding
    • Darken, C, and Mateas, M., eds. The AAAI Press
    • Jansen, M. R., and Sturtevant, N. R. 2008a. Direction maps for cooperative pathfinding. In Darken, C, and Mateas, M., eds., AIIDE. The AAAI Press.
    • (2008) AIIDE
    • Jansen, M.R.1    Sturtevant, N.R.2
  • 7
    • 84899912307 scopus 로고    scopus 로고
    • A new approach to cooperative pathfinding
    • Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems
    • Jansen, R., and Sturtevant, N. 2008b. A new approach to cooperative pathfinding. In AAMAS, 1401-1404. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.
    • (2008) AAMAS , pp. 1401-1404
    • Jansen, R.1    Sturtevant, N.2
  • 8
    • 44449122353 scopus 로고    scopus 로고
    • Exploiting subgraph structure in multi-robot path planning
    • Ryan, M. R. K. 2008. Exploiting subgraph structure in multi-robot path planning. J. Artif. Int. Res. 31(1):497-542.
    • (2008) J. Artif. Int. Res. , vol.31 , Issue.1 , pp. 497-542
    • Ryan, M.R.K.1
  • 9
    • 26944472983 scopus 로고    scopus 로고
    • Cooperative pathfinding
    • Young, R. M., and Laird, J. E., eds. AAAI Press
    • Silver, D. 2005. Cooperative pathfinding. In Young, R. M., and Laird, J. E., eds., AIIDE, 117-122. AAAI Press.
    • (2005) AIIDE , pp. 117-122
    • Silver, D.1
  • 10
    • 77958615156 scopus 로고    scopus 로고
    • Technical Report UU-CS-1996-43, Department of Information and Computing Sciences, Utrecht University
    • Svestka, P., and Overmars, M. H. 1996. Coordinated path planning for multiple robots. Technical Report UU-CS-1996-43, Department of Information and Computing Sciences, Utrecht University.
    • (1996) Coordinated Path Planning for Multiple Robots
    • Svestka, P.1    Overmars, M.H.2
  • 11
    • 77958536732 scopus 로고    scopus 로고
    • Fast and memory-efficient multi-agent pathfinding
    • Wang, K.-H. C, and Botea, A. 2008. Fast and memory-efficient multi-agent pathfinding. AAAI 2008.
    • (2008) AAAI 2008
    • Wang, K.-H.C.1    Botea, A.2


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