Sciweavers

1146 search results - page 94 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 3 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
AIPS
2009
13 years 10 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
14 years 2 months ago
Mission planning for joint suppression of enemy air defenses using a genetic algorithm
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
Jeffrey P. Ridder, Jason C. HandUber
ATAL
2006
Springer
14 years 27 days ago
Hierarchical planning in BDI agent programming languages: a formal approach
This paper provides a general mechanism and a solid theoretical basis for performing planning within Belief-Desire-Intention (BDI) agents. BDI agent systems have emerged as one of...
Sebastian Sardiña, Lavindra de Silva, Lin P...
ATAL
2011
Springer
12 years 9 months ago
Learning action models for multi-agent planning
In multi-agent planning environments, action models for each agent must be given as input. However, creating such action models by hand is difficult and time-consuming, because i...
Hankz Hankui Zhuo, Hector Muñoz-Avila, Qian...