ECP 2001 Very Preliminary Program

[Subbarao Kambhampati <rao@cotopaxi.eas.asu.edu>]

Submitted papers: 92
This is just a summary:

-- accepted papers 28
-- benchmark papers 2
-- poster papers 11
-- demos 5



Full presentations
------------------

3. S. Edelkamp
Planning with Pattern Databases


5. C. Domshlak, Y. Dinitz
Multy-Agent Off-Line Coordination: Structure and Complexity


7. J-P Watson, J. Cristophe Beck, A.E.  Howe, L. Darrell Whitley
Toward an Understanding of Local Search Cost in Job-Shop Scheduling


8. P. Laborie
Algorithms for Propaganting Resource Constraints in AI Planning and
Scheduling: Existing Approaches and New Results


14. Y. Dimopoulos
Improved Integer Programming Models and Heuristic Search fo AI Planning


16. A.J. Davenport, C. Gefflot, J.C. Beck
Slack-based Techniques for Building Robust Schedules


17. J. Hoffmann, B. Nebel
RIFO Revisited: Detecting Relaxed Irrelevance


18. I.Razgon, R.I. Brafman
A Forward Search Planning Algorithm with a Goal Ordering Heuristic


26. L. Castillo, J. Fdez-Olivares, A. González
On the Adequacy of Hierarchical Planning Characterirtics for Real-World
Problem Solving


31. D. Vrakas, I. Vlahavas
Combining Progression and Regression in State.Space Heuristic Planning


37. J. Porteous, L. Sebastia, J. Hoffmann
On the Extraction, Ordering, and Usage of Landmarks in Planning


38. M. Pistore, R. Bettin, P. Traverso
Symbolic technique for planning with extended goals in non-deterministic
domains


40. P. Haslum, H. Geffner
Heuristic Planning with Time and Resources


49. D. Camacho, D. Boorajo, JM. Molina, R. Aler
Flexible Integration of Planning and Information Gathering


53. M. Helmert
On the Complexity of Planning in Trasportation Domains


54. W. Zhang
Solving Informative POMDPs


56. W. Hatzack, B. Nebel
Solving the Operational Traffic Control Problem


59. R.M.. Jensen, M.M. Veloso, M.H. Bowling
OBDD-Based Optimistic and Strong Cyclic Adversarial Planning


61. S. Biundo, B. Schattenberg