547 search results - page 7 / 110 » A Planning Algorithm not based on Directional Search |
115
click to vote
FLAIRS
2008
15 years 3 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
113
click to vote
IJCAI
2003
15 years 2 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
106
click to vote
ATAL
2009
Springer
15 years 2 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
105
click to vote
AIPS
2008
15 years 3 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
107
click to vote
JAIR
2008
15 years 1 months ago
2008
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...