Sciweavers

1146 search results - page 26 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
CDC
2009
IEEE
162views Control Systems» more  CDC 2009»
14 years 15 days ago
Distributed optimal planning: an approach by weighted automata calculus
— We consider a distributed system modeled as a possibly large network of automata. Planning in this system consists in selecting and organizing actions in order to reach a goal ...
Eric Fabre, Loig Jezequel
AAAI
2008
13 years 10 months ago
Hypothesis Pruning and Ranking for Large Plan Recognition Problems
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
Gita Sukthankar, Katia P. Sycara
EWCBR
2008
Springer
13 years 9 months ago
Situation Assessment for Plan Retrieval in Real-Time Strategy Games
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
Kinshuk Mishra, Santiago Ontañón, As...
AAAI
1998
13 years 9 months ago
Fast Transformation of Temporal Plans for Efficient Execution
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
Ioannis Tsamardinos, Nicola Muscettola, Paul H. Mo...
ATAL
2008
Springer
13 years 9 months ago
Multi-agent plan diagnosis and negotiated repair
In the complex, dynamic domain of Air Traffic Control (ATC) many unexpected events can happen during the execution of a plan. Sometimes these disruptions make the plan infeasible ...
Huib Aldewereld, Pieter Buzing, Geert Jonker