Multiagent systems
Distributed Dynamic Backtracking
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Consistency Maintenance for ABT
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Distributed Dynamic Backtracking
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Support-based distributed search: a new approach for multiagent constraint processing
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
A Distributed Generative CSP Framework for Multi-site Product Configuration
CIA '08 Proceedings of the 12th international workshop on Cooperative Information Agents XII
Solving DisCSPs with penalty driven search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Min-domain ordering for asynchronous backtracking
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Simple support-based distributed search
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
| Hi-index | 0.00 |
In the scope of distributed constraint reasoning, the main algorithms presented so far have a feature in common: the addition of links between previously unrelated agents, before or during search. Our work presents a new search procedure for finding a solution in a distributed constraint satisfaction problem. This algorithm makes use of some of the good properties of centralized dynamic backtracking. It is sound, complete and allows a high level of asynchronism by sidestepping the unnecessary addition of links.