作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2004, Vol. 30 ›› Issue (20): 16-18.

• 论文 • 上一篇    下一篇

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

赵志崑,史忠植,曹虎   

  1. 中科院计算所,中科院计算所,中科院计算所 北京 100080中科院研究生院信息科学与工程学院,北京 100039
  • 发布日期:2004-10-25

A Multi-agent Planning Algorithm Based on Constraints Propagating

ZHAO Zhikun1,2,SHI Zhongzhi1,CAO Hu1   

  1. (1.Institute of Computing Technology, CAS, Beijing 100080;2.School of Information Science and Engineering, Graduate School, CAS, Beijing100039)
  • Published:2004-10-25

摘要: 提出了一种基于约束传播的分布式多主体规划算法。主体之间的冲突检测与协调通过一种特殊的多主体协商来解决。在确定环境中该算法是可靠的。算法中主体之间交换的只是与冲突有关的动作、因果链和约束,具有通信量小、安全性高的优点。

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

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.

中图分类号: