首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于约束传播的多主体规划算法
引用本文:赵志崑,史忠植,曹虎.一种基于约束传播的多主体规划算法[J].计算机工程,2004,30(20):16-18.
作者姓名:赵志崑  史忠植  曹虎
作者单位:1. 中科院计算所,北京,100080;中科院研究生院信息科学与工程学院,北京,100039
2. 中科院计算所,北京,100080
基金项目:国家“863”计划基金资助项目(2001AA113121)
摘    要:提出了一种基于约束传播的分布式多主体规划算法。主体之间的冲突检测与协调通过一种特殊的多主体协商来解决。在确定环境中该算法是可靠的。算法中主体之间交换的只是与冲突有关的动作、因果链和约束,具有通信量小、安全性高的优点。

关 键 词:规划算法  多主体系统  约束传播
文章编号:1000-3428(2004)20-0016-03

A Multi-agent Planning Algorithm Based on Constraints Propagating
ZHAO Zhikun,SHI Zhongzhi,CAO Hu.A Multi-agent Planning Algorithm Based on Constraints Propagating[J].Computer Engineering,2004,30(20):16-18.
Authors:ZHAO Zhikun    SHI Zhongzhi  CAO Hu
Affiliation:ZHAO Zhikun1,2,SHI Zhongzhi1,CAO Hu1
Abstract: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.
Keywords:Planning algorithm  Multi-agent system  Constraints propagating  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号