Date: 2010-01-10 09:34:29Artificial 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.caAdd to Reading ListSource URL: www.societyofrobots.comDownload Document from Source Website File Size: 132,17 KBShare Document on Facebook
|