Sciweavers

172 search results - page 11 / 35
» Search Control of Plan Generation in Decision-Theoretic Plan...
Sort
View
AGENTS
1999
Springer
15 years 4 months ago
Planning and Resource Allocation for Hard Real-Time, Fault-Tolerant Plan Execution
We describe the interface between a real-time resource allocation system with an AI planner in order to create fault-tolerant plans that are guaranteed to execute in hard real-tim...
Ella M. Atkins, Tarek F. Abdelzaher, Kang G. Shin,...
AAAI
2004
15 years 1 months ago
Generating Safe Assumption-Based Plans for Partially Observable, Nondeterministic Domains
Reactive planning using assumptions is a well-known approach to tackle complex planning problems for nondeterministic, partially observable domains. However, assumptions may be wr...
Alexandre Albore, Piergiorgio Bertoli
AIPS
2000
15 years 1 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
ATAL
2010
Springer
15 years 25 days ago
Point-based policy generation for decentralized POMDPs
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
SARA
2007
Springer
15 years 5 months ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu