Sciweavers

1146 search results - page 5 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
MMAS
2004
Springer
14 years 1 months ago
Challenges in Building Very Large Teams
Abstract. When agents coordinate according to the principles of teamwork they can flexibly, robustly and reliably achieve complex goals in complex, dynamic and even hostile enviro...
Paul Scerri, Katia Sycara-Cyranski
AUSAI
2007
Springer
13 years 11 months ago
Planning as Satisfiability with Relaxed $-Step Plans
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
Martin Wehrle, Jussi Rintanen
ICCBR
2001
Springer
14 years 5 days ago
An Accurate Adaptation-Guided Similarity Metric for Case-Based Planning
In this paper, we present an adaptation-guided similarity metric based on the estimate of the number of actions between states, called ADG (Action Distance-Guided). It is determine...
Flavio Tonidandel, Marcio Rillo
AIIDE
2008
13 years 10 months ago
Stochastic Plan Optimization in Real-Time Strategy Games
We present a domain independent off-line adaptation technique called Stochastic Plan Optimization for finding and improving plans in real-time strategy games. Our method is based ...
Andrew Trusty, Santiago Ontañón, Ash...
IJCAI
1989
13 years 8 months ago
A Planning/Scheduling Methodology for the Constrained Resource Problem
This paper presents a new planning/scheduling methodology for the constrained resource problem (CRP), in which the amount of available resources is limited and usually monotonical...
Naiping Keng, David Y. Y. Yun