Index
Asynchronous Weak-Commitment Search for Solving Distributed Constraint Satisfaction Problems
Summary
Overview
Background: Constraint Satisfaction Problems
Background: Distributed CSPs
Distributed CSP”āParallel Processing
Example : MultiAgent Truth Maintenance
Example: Distributed Interpretation Problem
Asynchronous Backtracking (Yokoo, et al. 92)
Asynchronous Backtracking
Asynchronous Weak-commitment Search
Min-conflict Heuristics (Minton, et al. 92)
Dynamically Changing Priority Order
Effect of Changing Priority Order
Example of Algorithm Execution
Algorithm Completeness
Evaluations (distributed n-queens)
Evaluations (path assignment problem in communication network)
Related Studies
Evaluations (distributed 50-queens)
Avoiding Infinite Processing Loops
Escaping from Dead-Ends
|