Recent Advances in AI Planning: 5th European Conference on Planning, ECP'99 Durham, UK, September 8-10, 1999 Proceedings
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.
Planning as Model Checking
Conformant Planning via Model Checking
Strong Cyclic Planning Revisited
Scaleability in Planning
Exploiting Competitive Planner Performance
A Parallel Algorithm for POMDP Solution
Plan Merging Plan Reuse as Satisﬁability
SATBased Procedures for Temporal Reasoning
Task Decomposition Support to Reactive Scheduling
Greedy Algorithms for the Multicapacitated Metric Scheduling Problem
AutomataTheoretic Approach to Planning for Temporally Extended Goals
Integer Programs and Valid Inequalities for Planning Problems
Deductive Synthesis of Recursive Plans in Linear Logic
with Nonlinear Utility Functions
Toward a Uniﬁed Framework for Planning and Execution
What Is the Expressive Power of Disjunctive Preconditions?
Numeric State Variables in ConstraintBased Planning
Hierarchical Task Network Planning as Satisﬁability
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
Action Constraints for Planning
Least Commitment on Variable Binding in Presence of Incomplete Knowledge
Scaling Up Planning by Teasing Out Resource Scheduling
RealTime Scheduling for Multiagent Call Center Automation
Other editions - View all
Recent Advances in AI Planning: 5th European Conference on Planning, ECP'99 ...
Susanne Biundo,Maria Fox
No preview available - 2000
achieve action constraints action sequence agent application approach Artificial Intelligence Biundo Blackbox blocks world boolean Büchi automata causal encodings clauses computation conditional Conference on Artificial conformant planning corresponding CPLEX defined denotes disjunctive effects example execution facts Figure finite formalism formula function goal Graphplan heuristic hspr HTN encodings implemented initial instance iteration Kambhampati Kautz Kripke Structure linear logic Loaded Locked Markov decision process merging Model Checking mutex NextStates node nondeterministic operators optimal package pairs parcPLAN partial order performance plan-execution costs planner planning algorithm planning domain planning graph planning problem POMDP possible preconditions predicates problem type Proc propositional propositional logic PSPACE recursive reduction schemas regression represent representation resource reuse robots satisfiability scheduling solution solve specification state-action table step strong cyclic plans task task models techniques temporal constraints UCPOP variables vector