The message management asynchronous backtracking algorithm
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.
backtracking algorithm distributed constraint satisfaction problem hyper-resolution multiagent system