ECP
1997
Springer
13 years 9 months ago
1997
Springer
Systems that act autonomously in the environment have to be able to integrate three basic behaviors: planning, execution, and learning. Planning involves describing a set of action...
ECP
1997
Springer
13 years 9 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
ECP
1997
Springer
13 years 9 months ago
1997
Springer
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
ECP
1997
Springer
13 years 9 months ago
1997
Springer
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (T RP), in which resource r...
ECP
1997
Springer
13 years 9 months ago
1997
Springer
ECP
1999
Springer
13 years 9 months ago
1999
Springer
We extend a planning algorithm to cover simple forms of arithmetics. The operator preconditions can refer to the values of numeric variables and the operator postconditions can mod...
ECP
1999
Springer
13 years 9 months ago
1999
Springer
ECP
1999
Springer
13 years 9 months ago
1999
Springer
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
ECP
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...