314 search results - page 8 / 63 » Goal Ordering in Partially Ordered Plans |
UAI
2008
13 years 9 months ago
2008
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
PAAMS
2010
Springer
14 years 7 days ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
ECAI
2004
Springer
14 years 26 days ago
2004
Springer
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
We present an argumentation-based formalism that an agent could use for constructing plans. We will analyze the interaction of arguments and actions when they are combined to cons...