Download:
|
by Alexander Nareyek
In Local Search for Planning and Scheduling, ECAI 2000 Workshop, LNCS 2148
http://www.ai-center.com/publications/drafts/nareyek-draft00.ps.Z
Add To MetaCart
Abstract:
Abstract. Resources such as food, hit points or magical power are standard features of today's computer games. Computer-guided characters often have goals that are related to these resources and must take this into account in planning their behavior. In the field of artificial intelligence, resource-based action planning systems have recently begun to mushroom. However, these systems still tend to neglect resources. Conventional plan length is the primary optimization goal, resources being of only secondary importance. This paper illustrates the problem and gives an overview of the Excalibur agent's planning system, which overcomes these deficiencies by applying an extended constraint programming framework to planning. It allows the search space to be explored without the need to focus on plan length, makes it possible to optimize other criteria like resource-related properties and promotes the inclusion of domain-dependent knowledge to guide and accelerate the search for a plan. 1
Citations
|
740
|
Fast Planning Through Planning Graph Analysis
– Blum, Furst
- 1997
|
|
383
|
Partial constraint satisfaction
– Freuder, Wallace
- 1992
|
|
246
|
Decisiontheoretic planning: Structural assumptions and computationalleverage
– Boutilier, Dean, et al.
- 1999
|
|
133
|
HSTS: Integrating planning and scheduling
– Muscettola
- 1994
|
|
103
|
Planning with sharable resource constraints
– Laborie, Ghallab
- 1995
|
|
102
|
Complexity, decidability and undecidability results for domain-indepenedent planning
– Erol, Nau, et al.
- 1994
|
|
79
|
Planning Under Resource Constraints
– Koehler
- 1998
|
|
76
|
Pushing the Envelope
– Kautz, Selman
|
|
67
|
CPlan: A constraint programming approach to planning
– Beek, Chen
- 1999
|
|
61
|
The LPSAT-engine & its application to resource planning
– Wolfman, Weld
- 1999
|
|
57
|
State-space planning by integer optimization
– Kautz, Walser
- 1999
|
|
50
|
Planning by Rewriting: Efficiently Generating High-Quality Plans
– Ambite, Knoblock
- 1997
|
|
50
|
Optimal Planning with a Goal-Directed Utility Model
– Williamson, Hanks
- 1994
|
|
49
|
Implementation of resource constraints in ilog schedule: A library for the development of constraint-based scheduling systems
– Pape
- 1994
|
|
46
|
Temporal and resource reasoning in planning: the parcPLAN approach
– El-Kholy, Richards
- 1996
|
|
38
|
Automating space mission operations using automated planning and scheduling
– Chien, Rabideu, et al.
- 2000
|
|
34
|
Scaling up Planning by teasing out Resource Scheduling
– Srivastava, Kambhampati
- 1999
|
|
32
|
Iterative Repair Planning for Spacecraft Operations
– Rabideau, Knight, et al.
- 1999
|
|
21
|
The Use of Optimistic and Pessimistic Resource Profiles to Inform Search in an Activity Based Planner
– Drabble, Tate
- 1994
|
|
19
|
Using global constraints for local search
– Nareyek
- 2001
|
|
18
|
Mixed integer programming models for planning problems
– Bockmayr, Dimopoulos
- 1998
|
|
12
|
Structural constraint satisfaction
– Nareyek
- 1999
|
|
11
|
Fast planning through greedy action graphs
– Gerevini, Serina
- 1999
|
|
9
|
A Cost-Directed Planner: Preliminary Report
– Ephrati, Pollack, et al.
- 1996
|
|
6
|
To encode or not to encode - i: linear planning
– Brafman, Hoos
- 1999
|
|
6
|
Open world planning as SCSP
– Nareyek
- 2000
|
|
5
|
Applying Local Search to Structural Constraint Satisfaction
– Nareyek
- 1999
|
|
5
|
The Handbook of Graph Grammars. Volume I: Foundations
– Rozenberg
- 1997
|
|
1
|
Optimization Technology White Paper --- A comparative study of optimization technologies. White Paper
– ILOG
- 2000
|
|
1
|
The Tolkien Monster Encyclopedia
– Mattsson
- 2000
|
