Title :
An Empirical Study on a Locality Based Heuristic in Multi-Agent Constraint Satisfaction
Author :
Minotra, Dev ; Liu, Jiming
Author_Institution :
Univ. of Windsor, Windsor
Abstract :
Previous work on multi-agent oriented constraint-satisfaction shows that ERA is competitively suitable in solving the n-queen problem, and is capable of providing approximate solutions to different types of CSPs in about two or three time steps. Challenges remain in developing more efficient ERA based systems for solving CSPs beyond just approximation. In this paper, a modified ERA algorithm, involving a locality based heuristic and a random tie-breaking method, is proposed and tested. Experimental results have shown significant performance improvements, indicating some of the key characteristics and strengths of ERA as a multi-agent solution search process.
Keywords :
constraint theory; graph colouring; heuristic programming; multi-agent systems; problem solving; search problems; ERA algorithm; empirical study; graph coloring problem; locality based heuristic; multiagent constraint satisfaction; multiagent solution search process; n-queen problem solving; random tie-breaking method; Clocks; Computational modeling; Computer science; Distributed computing; Intelligent agent; Measurement; Testing;
Conference_Titel :
Intelligent Agent Technology, 2007. IAT '07. IEEE/WIC/ACM International Conference on
Conference_Location :
Fremont, CA
Print_ISBN :
978-0-7695-3027-7
DOI :
10.1109/IAT.2007.83
