一种分布式多主体规划算法  

A PLANNING ALGORITHM BASED ON CONSTRAINTS PROPAGATING

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

机构地区：[1]中国科学院研究生院信息科学与工程学院,北京100039 [2]中国科学院计算技术研究所智能信息处理重点实验室,北京100080

出　　处：《模式识别与人工智能》2004年第4期405-411,共7页Pattern Recognition and Artificial Intelligence

基　　金：国家863计划(No.2001AA113121);国家自然科学基金(No.90104021);中国科学院院长基金(No.yzjj200306)

摘　　要：提出一种分布式多主体规划算法.在此算法中,主体规划之间的冲突检测与协调通过多主体协商来解决,即主体规划之间约束一致性的分布式判断.在确定环境中该算法是可靠的.由于算法中主体之间交换的只是与冲突有关的动作、因果链和约束.因此具有通信量小、安全性高的优点.This paper presents a distributed multi-agent planning algorithm based on constraints propagating. In our algorithm, conflicts are detected and resolved through a special type of negotiation among agents, i. e. consistency checking for constraints. The algorithm is sound under deterministic circumstance. In our 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.

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

分 类 号：O221.6[理学—运筹学与控制论]