Abstract—Recent real-time heuristic search algorithms have demonstrated outstanding performance in video-game pathfind-ing. However, their applications have been thus far limited to that domain. We proceed with the aim of facilitating wider applica-tions of real-time search by fostering a greater understanding of the performance of recent algorithms. We first introduce eight algorithm-independent complexity measures for search spaces and correlate their values with algorithm performance. The complexity measures are statistically shown to be significant predictors of algorithm performance across a set of commercial video-game maps. We then extend this analysis to a wider variety of search spaces in the first application of database-driven re...
Real-time heuristic search methods, such as LRTA*, are used by situated agents in applications that ...
Real-time search methods are suited for tasks in which the agent is interacting with an initially un...
Real-time heuristic search algorithms are used for planning by agents in situations where a constant...
Real-time heuristic search algorithms that precompute search space-specific databases have demonstra...
Abstract. Real-time heuristic search algorithms are useful when the amount of time or memory resourc...
In real-time domains such as video games, a planning algo-rithm has a strictly bounded time before i...
In real-time domains such as video games, a planning algo- rithm has a strictly bounded time before ...
Real-time (heuristic) search methods allow for fine-grained control over how much planning to do bet...
Large real-time search problems such as path-finding in com-puter games and robotics limit the appli...
Real-time heuristic search algorithms satisfy a constant bound on the amount of planning per action,...
In this report, we investigate the in uence of domain properties on the perfor-mance of real-time se...
Real-time heuristic search algorithms satisfy a constant bound on the amount of planning per action,...
Real-time heuristic search is a standard approach to pathfind-ing when agents are required to make d...
Real-time heuristic search is a standard approach to pathfind- ing when agents are required to make ...
Search has been vital to artificial intelligence from the very beginning as a core technique in prob...
Real-time heuristic search methods, such as LRTA*, are used by situated agents in applications that ...
Real-time search methods are suited for tasks in which the agent is interacting with an initially un...
Real-time heuristic search algorithms are used for planning by agents in situations where a constant...
Real-time heuristic search algorithms that precompute search space-specific databases have demonstra...
Abstract. Real-time heuristic search algorithms are useful when the amount of time or memory resourc...
In real-time domains such as video games, a planning algo-rithm has a strictly bounded time before i...
In real-time domains such as video games, a planning algo- rithm has a strictly bounded time before ...
Real-time (heuristic) search methods allow for fine-grained control over how much planning to do bet...
Large real-time search problems such as path-finding in com-puter games and robotics limit the appli...
Real-time heuristic search algorithms satisfy a constant bound on the amount of planning per action,...
In this report, we investigate the in uence of domain properties on the perfor-mance of real-time se...
Real-time heuristic search algorithms satisfy a constant bound on the amount of planning per action,...
Real-time heuristic search is a standard approach to pathfind-ing when agents are required to make d...
Real-time heuristic search is a standard approach to pathfind- ing when agents are required to make ...
Search has been vital to artificial intelligence from the very beginning as a core technique in prob...
Real-time heuristic search methods, such as LRTA*, are used by situated agents in applications that ...
Real-time search methods are suited for tasks in which the agent is interacting with an initially un...
Real-time heuristic search algorithms are used for planning by agents in situations where a constant...