Agent Compromises in Distributed Problem Solving

@inproceedings{Tang2003AgentCI,
  title={Agent Compromises in Distributed Problem Solving},
  author={Yi Tang and Jiming Liu and Xiaolong Jin},
  booktitle={IDEAL},
  year={2003}
}
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environments in the process of solving a problem. Each agent has three basic behaviors: least-move, better-move, and random-move. The random-move is the unique behavior that may help the multi-agent system escape from a local minimum. Although random-move is effective, it is not efficient. In this paper, we introduce the notion… CONTINUE READING
2 Citations
9 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Systematic vs

  • H. H. Hoos, T. Stutzle
  • Local Search for SAT , Proc . of KI99 , LNAI
  • 1999

A discrete Lagrangianbased globalsearch method for solving satisfiability problems , Journal of global optimization

  • Y. Shang, B. W. Wah
  • 1998

Wah,B.W.: A discrete Lagrangian-based global-search method for solving satisfiability problems, Journal of global optimization

  • Y. Shang
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…