APO算法的完备性和性能
Completeness and Performance Of The APO Algorithm
摘要:
异步部分覆盖(APO)是一种使用协作中介来解决分布式约束满足问题(DisCSP)的搜索算法。该算法将搜索划分为不同的子问题的DisCSP。APO算法完备性的原始证明是基于子问题规模的增长。本文证明,这种预期的增长的子问题不会发生在某些情况下,导致终止问题的算法。APO算法中的问题部分,干扰其完整性的确定和必要的修改,以解决这些问题的部分的算法。该算法的最终版本,完全异步部分覆盖(CompAPO),确保其完整性。给出了CompAPO的可靠性和完备性的形式证明。CompAPO的详细性能评估比较它与其他DisCSP算法,以及广泛的实验评估算法的独特行为。此外,该算法的优化版本,CompOptAPO,提出,讨论和评估。
英文摘要:
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 original proof of completeness of the APO algorithm is based on the growth of the size of the subproblems. The present paper demonstrates that this expected growth of subproblems does not occur in some situations, leading to a termination problem of the algorithm. The problematic parts in the APO algorithm that interfere with its completeness are identified and necessary modifications to the algorithm that fix these problematic parts are given. 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. A detailed performance evaluation of CompAPO comparing it to other DisCSP algorithms is presented, along with an extensive experimental evaluation of the algorithm's unique behavior. Additionally, an optimization version of the algorithm, CompOptAPO, is presented, discussed, and evaluated.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。