173 search results - page 26 / 35 » Search Complexities for HTN Planning |
AIPS
2009
13 years 8 months ago
2009
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents a path planner for Unmanned Air Vehicles (UAVs) based on Evolutionary Algorithms (EA) that can be used in realistic risky scenarios. The path returned by the a...
JAIR
2008
13 years 7 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,...
SPATIALCOGNITION
2000
Springer
13 years 11 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
NIPS
1993
13 years 8 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...