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


Partial Pathfinding Using Map Abstraction and Refinement Nathan Sturtevant and Michael Buro Department of Computing Science, University of Alberta Edmonton, Alberta, Canada T6G 2E8 {nathanst,mburo}@cs.ualberta.ca
Add to Reading List

Document Date: 2010-01-10 09:34:29

Open Document

File Size: 132,17 KB

Share Result on Facebook

City

Los Angeles / Tulsa / New York / /

Company

ABCD Level 2 AB / nodes AB / MultiAgent Systems / /

/

Event

Natural Disaster / /

Facility

By building / When building / After building / University of Alberta Edmonton / /

IndustryTerm

benchmark algorithm / search costs / admissible tree search / partial pathfinding algorithm / search problem / partial solutions / search space / search algorithm / Real-time heuristic search / abstractable search problem / feasible solutions / search methods / search algorithms / /

Organization

Michael Buro Department of Computing Science / American Association for Artificial IntelliCopyright / University of Alberta Edmonton / /

Person

Alberta Edmonton / Markus Enzenberger / Nathan Sturtevant / Michael Buro / /

/

Position

minimal exec. / /

ProvinceOrState

Alberta / /

Technology

RAM / ca Abstract Classical search algorithms / artificial intelligence / search algorithm / search algorithms / partial pathfinding algorithm / PRA* algorithm / caching / Search The QuickPath algorithm / simulation / benchmark algorithm / /

URL

http /

SocialTag