A Dynamic Agent Ordering Based Algorithm for Distributed CSPs
Jian Gao · Computer Technology and Development · 2009
Distributed CSPs have become a new hotspot in AI recently.It extends the application of CSPs to the complex distributed environment.Improves the agent ordering strategy in concurrent search for solving distributed CSPs,and combines dynamic agent ordering with concurrent search.At the same time, an algorithm based on dynamic agent ordering that is fit for distributed environment is proposed.Experiments of several random CSPs have been done,and the results show that the improved method performs better on efficiency and communication overhead.