CompAPO: A complete version of the APO Algorithm

Tal Grinshpoun, Amnon Meisels

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions the search into different subproblems of the DisCSP. The proof of completeness of the APO algorithm is based on the growth of the size of the subproblems. We have discovered that this expected growth of groups does not occur in some situations, leading to a termination problem of the algorithm. The present paper identifies the problematic parts in the algorithm that interfere with its completeness. Some necessary modifications are given to the algorithm to fix these problematic parts. The resulting version of the algorithm, Complete Asynchronous Partial Overlay (CompAPO), ensures its completeness. Formal proofs for the soundness and completeness of CompAPO are given.

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
Pages370-376
Number of pages7
ISBN (Print)0769530273, 9780769530277
DOIs
StatePublished - 1 Jan 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

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Fingerprint

Dive into the research topics of 'CompAPO: A complete version of the APO Algorithm'. Together they form a unique fingerprint.

Cite this