Recent Advances in AI Planning: 5th European Conference on Planning, ECP'99 Durham, UK, September 8-10, 1999 Proceedings (Google eBook)

Front Cover
Susanne Biundo, Maria Fox
Springer Science & Business Media, Jul 26, 2000 - Computers - 372 pages
0 Reviews
TheEuropeanConferencesonPlanning(ECP)areamajorforumforthepres- tation of new research in Arti?cial Intelligence Planning and Scheduling. They developed from a series of European workshops and became successfully es- blished as international meetings. Previous conferences took place in St. Au- stin (Germany) in 1991, Vadstena (Sweden) in 1993, Assisi (Italy) in 1995, and Toulouse (France) in 1997. ECP-99 was held in Durham, United Kingdom. The conference received s- missions from all over Europe, from the US, Canada, South America, and New Zealand. This volume contains the 27 papers that were presented at the conference. They cover a variety of aspects in current AI Planning and Scheduling. Several p- minent planning paradigms are represented, including planning as satis?ability andothermodelcheckingstrategies,planningasheuristicstate-spacesearch,and Graphplan-Based approaches. Moreover, various new scheduling approaches and combinations of planning and scheduling methods are introduced. Inadditiontotheconferencepapers,threeinvitedtalkswerepresentedbydist- guished researchers of the ?eld: Fausto Giunchiglia (IRST Trento, Italy) gave an introduction to Planning as Model Checking. The corresponding paper by F- sto Giunchiglia and Paolo Traverso is included in this volume. Claude Le Pape (BouyguesTelecom,France)presentedConstraint-BasedScheduling:Theoryand Applications, and Nicola Muscettola (NASA Ames, USA) talked aboutPlanning at 96 Million Kilometers from Earth. ECP-99 received support fromPLANET,the European Network of Excellence in AI Planning, the University of Durham, United Kingdom, and the University of Ulm, Germany.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Planning as Model Checking
1
Conformant Planning via Model Checking
21
Strong Cyclic Planning Revisited
35
Scaleability in Planning
49
Exploiting Competitive Planner Performance
62
Pyeatt and Adele E Howe
83
Mali
96
Numeric State Variables in ConstraintBased Planning
109
Greedy Algorithms for the Multicapacitated Metric Scheduling Problem
213
AutomataTheoretic Approach to Planning for Temporally Extended Goals
226
Integer Programs and Valid Inequalities for Planning Problems
239
Deductive Synthesis of Recursive Plans in Linear Logic
252
Sensor Planning with Nonlinear Utility Functions
265
Toward a Unified Framework for Planning and Execution
278
What Is the Expressive Power of Disjunctive Preconditions?
294
Some Results on the Complexity of Planning with Incomplete Information
308

Hierarchical Task Network Planning as Satisfiability
122
Exhibiting Knowledge in Planning Problems to Minimize State Encoding
135
Action Constraints for Planning
148
Scaling up Planning by Teasing out Resource Scheduling
172
RealTime Scheduling for Multiagent Call Center Automation
187
Task Decomposition Support to Reactive Scheduling
200
Making Graphplan GoalDirected
333
A Domain Independent Heuristic for STRIPS Worlds Based
347
New Results
360
Author Index
373
Copyright

Common terms and phrases

Popular passages

Page 3 - intuitively means that for every path (for some path) there exists an initial prefix of the path such that q holds at the last state of the prefix and p holds at all the other states along the prefix. Formulas AFp and EFp (where the temporal operator F stands for "future" or "eventually") are abbreviations of
Page 2 - L assigns to each state the set of atomic propositions true in that state. A Kripke Structure encodes