Sciweavers

565 search results - page 40 / 113
» Heuristics for Planning with SAT
Sort
View
AIPS
2006
13 years 9 months ago
A New Principle for Incremental Heuristic Search: Theoretical Results
Planning is often not a one-shot task because either the world or the agent's knowledge of the world changes. In this paper, we introduce a new principle that can be used to ...
Sven Koenig, Maxim Likhachev
AIPS
2009
13 years 9 months ago
Improving Planning Performance Using Low-Conflict Relaxed Plans
The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisficing planning and is used by many state-of-the-art heuristic-search planners. Ho...
Jorge A. Baier, Adi Botea
ATAL
2005
Springer
14 years 1 months ago
Multiagent planning through plan repair
We present a novel approach to multiagent planning for self-interested agents. The main idea behind our approach is that multiagent planning systems should be built upon (single-a...
Roman van der Krogt, Nico Roos, Mathijs de Weerdt,...
AIPS
2003
13 years 9 months ago
Guided Symbolic Universal Planning
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...
IJCAI
2003
13 years 9 months ago
Automated Generation of Understandable Contingency Plans
Markov decision processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely gen...
Max Horstmann, Shlomo Zilberstein