Ultra-fast Optimal Pathfinding without Runtime Search

dc.contributor.authorBotea, Adi
dc.coverage.spatialPalo Alto California USA
dc.date.accessioned2015-12-08T22:43:10Z
dc.date.createdOctober 12-14 2011
dc.date.issued2011
dc.date.updated2016-02-24T11:30:01Z
dc.description.abstractPathfinding is important in many applications, including games, robotics and GPS itinerary planning. In games, most pathfinding methods rely on runtime search. Despite numerous enhancements introduced in recent years, runtime search has the disadvantage t
dc.identifier.urihttp://hdl.handle.net/1885/37158
dc.relation.ispartofseriesAI and interactive digital entertainment conference (AIIDE 2011)
dc.sourceUltra-fast Optimal Pathfinding without Runtime Search
dc.subjectKeywords: Compression factor; Itinerary planning; Memory requirements; Optimal paths; Orders of magnitude; Pathfinding; Performance degradation; Reasonable value; Artificial intelligence; Human computer interaction; Robot programming; Optimization
dc.titleUltra-fast Optimal Pathfinding without Runtime Search
dc.typeConference paper
local.bibliographicCitation.lastpage6
local.bibliographicCitation.startpage1
local.contributor.affiliationBotea, Adi , College of Engineering and Computer Science, ANU
local.contributor.authoremailrepository.admin@anu.edu.au
local.contributor.authoruidBotea, Adi , u1814829
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080199 - Artificial Intelligence and Image Processing not elsewhere classified
local.identifier.absseo890299 - Computer Software and Services not elsewhere classified
local.identifier.ariespublicationu4963866xPUB145
local.identifier.scopusID2-s2.0-84869846976
local.identifier.uidSubmittedByu4963866
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
01_Botea_Ultra-fast_Optimal_Pathfinding_2011.pdf
Size:
256.24 KB
Format:
Adobe Portable Document Format