Introduction to Multiagent Systems
Introduction to Multiagent Systems
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Consistency Maintenance for ABT
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Asynchronous backtracking without adding links: a new member in the ABT family
Artificial Intelligence - Special issue: Distributed constraint satisfaction
| Hi-index | 0.00 |
In this paper we show how the asynchronous backtracking algorithm, a well-known distributed constraint satisfaction algorithm, produces unnecessary messages and introduce our optimized algorithm, message management asynchronous backtracking, which reduces the number of messages the agents send. The message management mechanism removes the redundant messages, keeps the message queue updated, and handles messages by package instead of individually in order to improve efficiency. Our test results shows that the algorithm significantly reduces the total number of messages sent and drastically reduces the number of cycles used when solving instances of the graph colouring problem.