TY - GEN
T1 - Distributed constraint satisfaction
T2 - 1998 International Conference on Multi Agent Systems, ICMAS 1998
AU - Yokoo, Makoto
PY - 1998/1/1
Y1 - 1998/1/1
N2 - When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints. The research on constraint satisfaction problems has a long and distinguished history in AI as a general framework that can formalize various application problems. Similarly, a distributed CSP is a fundamental problem for achieving coordination among agents and can formalize various application problems in multi-agent systems.
AB - When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints. The research on constraint satisfaction problems has a long and distinguished history in AI as a general framework that can formalize various application problems. Similarly, a distributed CSP is a fundamental problem for achieving coordination among agents and can formalize various application problems in multi-agent systems.
UR - http://www.scopus.com/inward/record.url?scp=85013604902&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85013604902&partnerID=8YFLogxK
U2 - 10.1109/ICMAS.1998.699026
DO - 10.1109/ICMAS.1998.699026
M3 - Conference contribution
AN - SCOPUS:85013604902
SN - 081868500X
SN - 9780818685002
T3 - Proceedings - International Conference on Multi Agent Systems, ICMAS 1998
SP - 14
EP - 15
BT - Proceedings - International Conference on Multi Agent Systems, ICMAS 1998
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 3 July 1998 through 7 July 1998
ER -