Back to Results
First PageMeta Content
Artificial intelligence / Routing algorithms / Graph theory / Combinatorial optimization / Any-angle path planning / A* search algorithm / Pathfinding / Heuristic function / Shortest path problem / Search algorithms / Mathematics / Game artificial intelligence


Block A*: Database-Driven Search with Applications in Any-angle Path-Planning Peter Yap and Neil Burch and Rob Holte and Jonathan Schaeffer Computing Science Department
Add to Reading List

Document Date: 2011-05-17 10:41:28


Open Document

File Size: 1,17 MB

Share Result on Facebook

Company

S Block A* G S G S A / /

/

Facility

Jonathan Schaeffer Computing Science Department University of Alberta Edmonton / /

IndustryTerm

deciding which algorithm / path solutions / search performance / pre-processing costs / search domain / path planning algorithm / grid-based path-planning algorithms / any-angle search algorithm / breadth-first search / individual search / particular search / robotics applications / search speed / path planning algorithms / search space / search algorithm / real-time nature / search results / search problems / /

Organization

Association for the Advancement of Artificial Copyright / Jonathan Schaeffer Computing Science Department University of Alberta Edmonton / /

Person

Dave Churchill / Nathan Sturtevant / Jonathan Schaeffer / Neil Burch / Rob Holte / Alberta Edmonton / /

Position

representative / head / /

Product

RPG / /

PublishedMedium

Communications of the ACM / /

Technology

field D* algorithm / any-angle search algorithm / LDDB-based algorithm / artificial intelligence / path planning algorithms / search algorithm / 1 In Algorithm / A*-based pathfinding algorithm / 1000x1000 Algorithm / Block A* algorithm / competing algorithms / GPS / grid-based path-planning algorithms / LOS algorithm / expensive LOS algorithm / pathfinding algorithm / path planning algorithm / /

URL

www.aaai.org / /

SocialTag