메뉴 건너뛰기




Volumn , Issue , 2008, Pages 65-74

GPU accelerated pathfinding

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL INTELLIGENCE; COMPUTATIONAL RESOURCES; DATA ELEMENTS; DATA PARALLEL; GPU IMPLEMENTATION; NAVIGATION PLANNING; PATHFINDING; PROGRAMMABLE PROCESSORS; PROGRAMMING ENVIRONMENT; SPARSE GRAPHS;

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

References (25)
  • 8
    • 0022094206 scopus 로고
    • Generalized best-first search strategies and the optimality of A*
    • (Jul)
    • DECHTER R., PEARL J.: Generalized Best-First Search Strategies and the Optimality of A*. Journal of the ACM, 32 (Jul. 1985), 505-536.
    • (1985) Journal of the ACM , vol.32 , pp. 505-536
    • Dechter, R.1    Pearl, J.2
  • 14
    • 77952010176 scopus 로고    scopus 로고
    • Cambridge University Press
    • LAVALLE S. M.: Planning Algorithms. Cambridge University Press. http://msl.cs.uiuc.edu/planning/, (2006).
    • (2006) Planning Algorithms
    • Lavalle, S.M.1
  • 15
    • 36349023251 scopus 로고    scopus 로고
    • Motion planning of multiple agents in virtual environments on parallel architectures
    • (Apr)
    • LI, Y., GUPTA, K.: Motion Planning of Multiple Agents in Virtual Environments on Parallel Architectures. IEEE International Conference on Robotics and Automation, (Apr. 2007), 1009-1014.
    • (2007) IEEE International Conference on Robotics and Automation , pp. 1009-1014
    • Li, Y.1    Gupta, K.2
  • 17
    • 84948735973 scopus 로고
    • Search strategies for ai production systems
    • Morgan Kaufmann Publishers
    • NILLSSON N. J.: Search Strategies for AI Production Systems. Principles of Artificial Intelligence. Morgan Kaufmann Publishers, 1986, 53-96.
    • (1986) Principles of Artificial Intelligence , pp. 53-96
    • Nillsson, N.J.1
  • 19
    • 78651298552 scopus 로고    scopus 로고
    • Amit's A* Pages
    • PATEL A.: Amit's A* Pages. http://theory.stanford.edu/-amitp/ GameProgramming/, 2007.
    • (2007)
    • Patel, A.1
  • 24
    • 0021503808 scopus 로고
    • A result on the computational complexity of heuristic estimates for the A* algorithm
    • (Jan)
    • VALTORTA M.: A Result on the Computational Complexity of Heuristic Estimates for the A* Algorithm. Information Sciences, 34 (Jan. 1983), 48-59.
    • (1983) Information Sciences , vol.34 , pp. 48-59
    • Valtorta, M.1


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