Summary
A new algorithm for solving Distributed Constraint Satisfaction Problems is developed (asynchronous weak-commitment search).
- solving CSPs in which multiple automated agents are involved
- simple, but very efficient
- based on intuitively natural notions of agent cooperation
- dynamic, flexible organization
- consideration/kindness for other agents