Slides of the Invited Talk at the CAEPIA Workshop on Planning, Scheduling and Temporal Reasoning (Held on November 11, 2003 by Alexander Nareyek) Note that because the slides do not contain the verbal components of the talk, it might be hard or even misleading to study the document if you did not attend the talk. The demos are also not included. Most of them are part of the DragonBreath Engine, which can be downloaded at: http://www.ai-center.com/projects/dragonbreath/
25
Embed
Slides of the Invited Talk at the CAEPIA Workshop on Planning, Scheduling and Temporal Reasoning (Held on November 11, 2003 by Alexander Nareyek) Note.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Slides of the Invited Talk at theCAEPIA Workshop on
Planning, Scheduling and Temporal Reasoning(Held on November 11, 2003 by Alexander Nareyek)
Note that because the slides do not contain the verbal components of the talk, it might be hard or even misleading to
study the document if you did not attend the talk.
The demos are also not included. Most of them are part of the DragonBreath Engine, which can be downloaded at:
http://www.ai-center.com/projects/dragonbreath/
TitleAt the Intersection of Planning and Constraint Programming
AbstractGeneral frameworks for formulating and solving search problems, like constraint programming, integer linear programming or propositional satisfiability, provide
useful means to tackle planning problems. While usually not as efficient as specialized search techniques, general frameworks support a modular and flexible modeling, and readily available solvers already draw on a huge pool of research
on search. This talk will give an overview of related planning approaches, placing special emphasis on constraint programming.
BioAlexander Nareyek received his diploma and Ph.D. from the TU Berlin. Since
2002, he is on an Emmy Noether fellowship of the German Research Foundation (DFG), and is guest researcher at Carnegie Mellon University. His main research interests include the generation and execution of behavior plans for goal-driven
intelligent agents. He is also active in the application area of computer games and serves as chairperson of the IGDA's Artificial Intelligence Interface Standards
Committee (AIISC).
At the Intersection ofPlanning and Constraint
Programming
Alexander Nareyek
Carnegie Mellon University
5
0
1
Action Planning
Action Types: • Preconditions• State changes• (Operations)
Constraints and AI Planningby Alexander Nareyek, Robert Fourer, Eugene C. Freuder, Enrico Giunchiglia, Robert P. Goldman, Henry Kautz, Jussi Rintanen and Austin Tate
• We need efficient AND flexible technology: Constraint programming is great for this!
• For “pure” efficiency gain goals, study the technologies used in constraint programming!