Back to Results
First PageMeta Content
Search algorithms / Network theory / Game artificial intelligence / Routing algorithms / Shortest path problem / Breadth-first search / Contraction hierarchies / A* search algorithm / Graph / Mathematics / Graph theory / Theoretical computer science


A Comparison of High-Level Approaches for Speeding Up Pathfinding Nathan R. Sturtevant1 Robert Geisberger Department of Computing Science
Add to Reading List

Document Date: 2010-09-17 13:23:12

Open Document

File Size: 671,13 KB

Share Result on Facebook

Company

CHs / /

/

Facility

Computing Science University of Alberta Edmonton / Informatics Karlsruhe Institute of Technology Karlsruhe / University of Denver / /

IndustryTerm

backward search / breadth-first search / heuristic search community / search scopes / search space / road networks / forward search / bidirectional search / /

MarketIndex

set 10 / /

Organization

Artificial Copyright Intelligence / Association for the Advancement / Computing Science University of Alberta Edmonton / Faculty of Informatics Karlsruhe Institute of Technology Karlsruhe / Department of Computer Science / Speeding Up Pathfinding Nathan R. Sturtevant1 Robert Geisberger Department / University of Denver / Computational Intelligence / /

Person

Robert Geisberger / S. Rabin / Alberta Edmonton / /

Position

high-quality motion planner / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

ESA / RAM / Engineering Route Planning Algorithms / artificial intelligence / AI system / /

URL

www.aaai.org / /

SocialTag