CompAPO: A complete version of the APO algorithm Conference Paper uri icon


  • 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 …

publication date

  • January 1, 2007