Distributed constraint Satisfaction problems 2 Asynchronous algorithms Thomas leaute 16.412J-Cognitive Robotics april 7. 2004 Presentation outline Introduction to CSPs and DCSPs 2. The Asynchronous Backtracking Algorithm 3. The asynchronous Weak-Commitment Search algorithm 4. Conclusion and Introduction to the task Allocation problem M. Yokoo, E Durfee, T. Ishida and K. Kuwabara, Distributed Constraint Satisfa

Constraint Satisfaction Problems (CSP) Backtracking search for CSPs Local search for CSPs

Constraint Satisfaction Problems: Formulation Brian C. Williams 16410-13 September 29th, 2003 Slides adapted fro 6. 034 Tomas lozano perez and AIMA Stuart Russell Peter Norvig Reading Assignments: Constraints Much of the material covered only in lecture slides

Solving CsPs Solving CSPs involves some combination of 1. Constraint propagation eliminates values that cant be part of any solution 2. Search explores valid assignments Arc Consistency Arc consistency eliminates values of each variable domain that

How Might a mouse search a Maze for Cheese? heese · State Space Search? As a Constraint Satisfaction Problem? Goal-directed Planning As a rule or production System? What is missing? Ideas in this lecture Objective is to accumulate rewards rather than goal states Task is to generate policies for how to act in all situations rather than a plan for a single starting situation

Fast Solutions to CSp's Based on PROSSER, P. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence

《计算机基础》课程教学资源（参考论文）A Multiagent Evolutionary Algorithm for Constraint Satisfaction Problems

香港城市大学：香港僱員信心、工作滿意度及年齡歧視問題調查 Employee Confidence, Job Satisfaction and Age Discrimination Survey

CSP examples Backtracking search for CSPs Problem structure and problem decomposition Local search for CSPs

《Artificial Intelligence：A Modern Approach》教学资源（教材，英文版）Part II Problem Solving 5 Constraint Satisfaction Problems