Sciweavers

6957 search results - page 47 / 1392
» Planning before plans
Sort
View
AIPS
1996
13 years 9 months ago
Planning Experiments: Resolving Interactions between Two Planning Spaces
Learning from experimentation allows a system to acquire planning domain knowledge by correcting its knowledge when an action execution fails. Experiments are designed and planned...
Yolanda Gil
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
AGENTS
1999
Springer
14 years 11 days 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,...
IJCAI
2003
13 years 9 months ago
Multiagent Planning with Partially Ordered Temporal Plans
This paper discusses the specifics of planning in multiagent environments. It presents the formal framework MAPL (“maple”) for describing multiagent planning domains. MAPL al...
Michael Brenner
ASE
2006
122views more  ASE 2006»
13 years 8 months ago
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
Andrew Ireland, Jamie Stark