CAJ | 학술논문

多Agent协作过程中的许多问题都可在分布式约束优化问题( DCOP)框架下建模,但多局限于规划问题,且一般需Agent具有完全、准确收益函数。针对DCOP局限性,定义动态分布式约束优化问题(DDCOP),分析求解它的两个关键操作：Exploration和Exploitation,提出基于混沌蚂蚁的DDCOP协同求解算法( CA-DDCOP)。该算法借鉴单只蚂蚁的混沌行为和蚁群的自组织行为,实现Exploration和Exploitation,根据玻尔兹曼分布,建立平衡Explora-tion和Exploitation的协同方法。通过多射频多信道无线Ad Hoc网络的信道分配验证该算法的有效性。
다Agent협작과정중적허다문제도가재분포식약속우화문제( DCOP)광가하건모,단다국한우규화문제,차일반수Agent구유완전、준학수익함수。침대DCOP국한성,정의동태분포식약속우화문제(DDCOP),분석구해타적량개관건조작：Exploration화Exploitation,제출기우혼돈마의적DDCOP협동구해산법( CA-DDCOP)。해산법차감단지마의적혼돈행위화의군적자조직행위,실현Exploration화Exploitation,근거파이자만분포,건립평형Explora-tion화Exploitation적협동방법。통과다사빈다신도무선Ad Hoc망락적신도분배험증해산법적유효성。
A large number of problems in the multiagent collaboration process can be modeled under the framework of distributed constraint optimization problem ( DCOP) . However, DCOP framework is limited to the issue of planning, and the agents in DCOP generally require a complete and accurate reward function. To resolve this issue, a dynamic distributed constraint optimization problem ( DDCOP ) is defined, and DDCOP's crucial operations, exploration and exploitation, are analyzed. Furthermore, a chaotic ant based collaborative solving algorithm for dynamic distributed constraint optimization problem ( CA-DDCOP ) is proposed. The CA-DDCOP algorithm is established based on chaotic behavior of a single ant and self-organizing behavior of ant colony, thereby the exploration and exploitation are realized. The proposed algorithm achieves the collaboration of exploration and exploitation according to the Boltzmann distribution. Then a channel allocation in multi-radio multi-channel Ad Hoc networks is solved by the CA-DDCOP algorithm. The simulation results show that the CA-DDCOP algorithm performs effectively.