The message management asynchronous backtracking algorithm

: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and introduces 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 message queue updated, and handles messages by package instead of individually in order to improve efficiency. Our test results show the algorithm significantly reduces the total number of messages sent and drastically reduces the number of cycles used when solving instances of the graph coloring problem. Keywords : Constraint Satisfaction Problem, Backtracking Algorithm, Distributed, Hyper-resolution, Multiagent System

• Type: Journal
• Year: 2008
• Where: JETAI
• Authors: Hong Jiang, José M. Vidal
• Keywords: Algorithm, Backtracking, Constraint Satisfaction, JETAI 2008