An empirical study on a locality based heuristic in multi-agent constraint satisfaction

Dev Minotra, Jiming LIU*

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference contributionpeer-review

Abstract

Previous work on multi-agent oriented constraint- satisfaction [8] shows that ERA Is competitively suitable in solving the n-queen problem, and is capable of providing approximate solutions to different types of CSFs 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.

Original languageEnglish
Title of host publicationProceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages505-511
Number of pages7
ISBN (Print)0769530273, 9780769530277
DOIs
Publication statusPublished - 2007
EventIEEE Computer Society Technical Committee on Intelligent Informatics(TCII) - Fremont, CA, United States
Duration: 2 Nov 20075 Nov 2007

Publication series

NameProceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007

Conference

ConferenceIEEE Computer Society Technical Committee on Intelligent Informatics(TCII)
Country/TerritoryUnited States
CityFremont, CA
Period2/11/075/11/07

Scopus Subject Areas

  • Computer Networks and Communications
  • Software

Cite this