119 search results - page 6 / 24 » Domain Independent Approaches for Finding Diverse Plans |
AIPS
2006
13 years 9 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
AI
2008
Springer
13 years 7 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
PUK
2003
13 years 8 months ago
2003
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
AUSAI
2007
Springer
13 years 11 months ago
2007
Springer
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
AIIA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we present a mixed-initiative planning approach to humanrobot interaction in a rescue domain. We deploy a model-based executive monitoring system to coordin...