Real-time search methods were devised as alternatives to more traditional search methods for searching known deter-ministic domains. We argue that real-time search methods have additional advantages for searching unknown or non-deterministic domains. Instead of planning for every con-tingency, real-time search methods execute the partial plan obtained after a bounded amount of planning, observe the resulting successor state, and then plan for only the resulting successorstate, not for all states that could have resulted from the execution of the plan. In this paper, we give two examples for how real-time search can be used in unknown or nonde-terministic domains, namely for goal-directed navigation and localization in the presence of initia...
In real-time planning, an agent must select the next action to take within a fixed time bound. Many ...
Real-time heuristic search is a standard approach to pathfind-ing when agents are required to make d...
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...
In this report, we investigate the in uence of domain properties on the perfor-mance of real-time se...
Learning Real-Time A* (LRTA*) is a popular control method that interleaves planning and plan executi...
Many systems, such as mobile robots, need to be controlled in real time. Real-time heuristic search ...
Real-time search methods are suited for tasks in which the agent is interacting with an initially un...
AbstractReal-time heuristic search methods interleave planning and plan executions and plan only in ...
Real-time search methods have successfully been used to solve a large variety of search problems but...
For problems such as pathfinding in video games and robotics, a search algorithm must be real-time (...
We consider real-time planning problems in which some states are unsolvable, i.e., have no path to a...
Real-time heuristic search is a standard approach to pathfind- ing when agents are required to make ...
In this paper we propose a real-time search algorithm called Real-Time Target Evaluation Search (RTT...
Recently, real-time planning has been actively studied for solving problems in uncertain and dy-nami...
In real-time planning, an agent must select the next action to take within a fixed time bound. Many ...
Real-time heuristic search is a standard approach to pathfind-ing when agents are required to make d...
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...
In this report, we investigate the in uence of domain properties on the perfor-mance of real-time se...
Learning Real-Time A* (LRTA*) is a popular control method that interleaves planning and plan executi...
Many systems, such as mobile robots, need to be controlled in real time. Real-time heuristic search ...
Real-time search methods are suited for tasks in which the agent is interacting with an initially un...
AbstractReal-time heuristic search methods interleave planning and plan executions and plan only in ...
Real-time search methods have successfully been used to solve a large variety of search problems but...
For problems such as pathfinding in video games and robotics, a search algorithm must be real-time (...
We consider real-time planning problems in which some states are unsolvable, i.e., have no path to a...
Real-time heuristic search is a standard approach to pathfind- ing when agents are required to make ...
In this paper we propose a real-time search algorithm called Real-Time Target Evaluation Search (RTT...
Recently, real-time planning has been actively studied for solving problems in uncertain and dy-nami...
In real-time planning, an agent must select the next action to take within a fixed time bound. Many ...
Real-time heuristic search is a standard approach to pathfind-ing when agents are required to make d...
In real-time domains such as video games, a planning algo- rithm has a strictly bounded time before ...