www.ai-center.com

Reference	Nareyek, A. 2001. Constraint-Based Agents - An Architecture for Constraint-Based Modeling and Local-Search-Based Reasoning for Planning and Scheduling in Open and Dynamic Worlds. Reading, Springer LNAI 2062.
Abstract	The book describes the state of the EXCALIBUR project as of March 2001. It is the PhD thesis of Alexander Nareyek (Technical University of Berlin, Department of Computer Science, Germany). For a five-page abstract, please follow this link.
Download	The book is not available for download. You may order it from Springer.
Online Content	The book includes content from the AI Center pages below. Please note that the online pages may contain updated/revised versions, and probably do not cover the complete book: Preface Introduction Artificial Intelligence for Computer Games Autonomous Agents Reactive Agents Triggering Agents Deliberative Agents Hybrid Agents Anytime Agents Planning Temporal Ontologies Sequence-oriented Representations Explicit Timeline Representations Resources The Orc Quest Example The Application of Planning Systems The Real Optimum A Question of Relevance The Nearby Wizard Plan-Length Bound A Question of Efficiency Complexity Decision-Theoretic Planning Search Paradigms Refinement Search Total-Order Planning Partial-Order Planning Hierarchical Planning Refinement Using Maximal Graphs Local Search Search-Paradigm Discussion Search Frameworks Operations Research Propositional Satisfiability Constraint Programming The "Send More Money" Problem Search-Framework Discussion Conclusion Using Global Constraints for Local Search Global Constraints Global Constraints from a Local Search Perspective Internal Structures Improvement Heuristics Granularity Global Search Control A Case Study: Dynamic Job-Shop Scheduling Realization Global Action Resource Constraints Global Task Constraints Results Constraint Weights Susceptibility to Local Minima and Plateaus Randomization Random Walks Tabu Lists Extending the Constraints More Knowledge Aggressive Heuristics Conclusion Structural Constraint Satisfaction Algebraic Graph Grammars Graph Elements for SCSPs Structural Constraints The Representation of Structural Constraints Examples Structural Constraint Satisfaction Problems Generating the Search Space Productions for Variables Productions for Nonextensible Constraints Productions for Extensible Constraints Productions for Constraint Extensions Avoiding Redundancy Combination with the Global Constraint Approach Application of Structural Constraints Types of Global Constraints Global Search Control Goal Optimization Conclusion The Planning Model The Model's Basics Actions, Action Tasks and Action Resources State Resources, State Tasks and Precondition Tasks Objects and References Sensors and Existence The Planning Model as SCSP The Current Time Actions Operations States Objects References Sensors Existence Projections Correctness Problem Formulation Incomplete Knowledge A Single-Plan Approach Missing Information Information Gathering Run-Time Variables Hands-off Goals Partial Knowledge Unordered Domains Ordered Domains Probabilities Conclusion Application Revisiting the Orc Quest Example The Constraints The Constraints' Heuristics The Global Search Control Evaluation Domain-Independent Planning Extending the ARC and TC A State Resource Constraint with a Symbolic State Domain Internal Structures Selecting an Improvement Heuristic SRC-H1: Adding an Event SRC-H2: Moving an Event SRC-H3: Moving a Precondition SRC-H4: Deleting an Event SRC-H5: Deleting a Precondition Evaluation The Logistics Domain Realization Results Tabu Lists Enhancing the Problem Domain Durations Optimization Dynamics Other Extensions Conclusion (Preliminary) Conclusion