101 search results - page 5 / 21 » Reviving Partial Order Planning |
KR
1992
Springer
15 years 1 months ago
1992
Springer
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have co...
PAAMS
2010
Springer
15 years 2 months 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...
ICTAI
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
IAT
2007
IEEE
15 years 1 months ago
2007
IEEE
The purpose of this paper is to introduce a multi-agent model for plan synthesis in which the production of a global shared plan is based on a promising unified framework based on...
ICTAI
2000
IEEE
15 years 1 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...