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

Dev Minotra; Jiming LIU

doi:10.1109/IAT.2007.83

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

Dev Minotra, Jiming LIU^*

^*Corresponding author for this work

Department of Computer Science

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-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 language	English
Title of host publication	Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007
Publisher	IEEE
Pages	505-511
Number of pages	7
ISBN (Print)	0769530273, 9780769530277
DOIs	https://doi.org/10.1109/IAT.2007.83
Publication status	Published - 2007
Event	IEEE Computer Society Technical Committee on Intelligent Informatics(TCII) - Fremont, CA, United States Duration: 2 Nov 2007 → 5 Nov 2007

Publication series

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

Conference

Conference	IEEE Computer Society Technical Committee on Intelligent Informatics(TCII)
Country/Territory	United States
City	Fremont, CA
Period	2/11/07 → 5/11/07

Scopus Subject Areas

Computer Networks and Communications
Software

Access to Document

10.1109/IAT.2007.83

Cite this

Minotra, D., & LIU, J. (2007). An empirical study on a locality based heuristic in multi-agent constraint satisfaction. In Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007 (pp. 505-511). Article 4407335 (Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007). IEEE. https://doi.org/10.1109/IAT.2007.83

@inproceedings{b35371840ce94eadb66a86f9836b8ece,

title = "An empirical study on a locality based heuristic in multi-agent constraint satisfaction",

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.",

author = "Dev Minotra and Jiming LIU",

year = "2007",

doi = "10.1109/IAT.2007.83",

language = "English",

isbn = "0769530273",

series = "Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007",

publisher = "IEEE",

pages = "505--511",

booktitle = "Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007",

address = "United States",

}

Minotra, D & LIU, J 2007, An empirical study on a locality based heuristic in multi-agent constraint satisfaction. in Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007., 4407335, Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007, IEEE, pp. 505-511, IEEE Computer Society Technical Committee on Intelligent Informatics(TCII), Fremont, CA, United States, 2/11/07. https://doi.org/10.1109/IAT.2007.83

An empirical study on a locality based heuristic in multi-agent constraint satisfaction. / Minotra, Dev; LIU, Jiming.
Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007. IEEE, 2007. p. 505-511 4407335 (Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

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

AU - Minotra, Dev

AU - LIU, Jiming

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=44149100794&partnerID=8YFLogxK

U2 - 10.1109/IAT.2007.83

DO - 10.1109/IAT.2007.83

M3 - Conference proceeding

AN - SCOPUS:44149100794

SN - 0769530273

SN - 9780769530277

T3 - Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007

SP - 505

EP - 511

BT - Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007

PB - IEEE

T2 - IEEE Computer Society Technical Committee on Intelligent Informatics(TCII)

Y2 - 2 November 2007 through 5 November 2007

ER -

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

Abstract

Publication series

Conference

Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this