一种基于约束传播的多主体规划算法  

A Multi-agent Planning Algorithm Based on Constraints Propagating

作　　者：赵志崑[1] 史忠植[1] 曹虎[1] 

机构地区：[1]中科院计算所

出　　处：《计算机工程》2004年第20期16-18,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2001AA113121)

摘　　要：提出了一种基于约束传播的分布式多主体规划算法。主体之间的冲突检测与协调通过一种特殊的多主体协商来解决。在确定环境中该算法是可靠的。算法中主体之间交换的只是与冲突有关的动作、因果链和约束,具有通信量小、安全性高的优点。This paper presents a distributed multi-agent planning algorithm based on constraints propagating. Conflicts are detected and resolved via a special type of negotiation among agents, consistency checking for constraints. The algorithm is sound under deterministic circumstance. In this algorithm, agents only exchange information about actions, casual links and constraints related to conflicts. It is of less communication, higher security than that exchanging the whole plan.

关 键 词：规划算法 多主体系统 约束传播 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]