期刊文献+

基于混合MAS的保障任务分布规划设计与研究 被引量:1

Design and Research on Distributed Support Task Planning and Scheduling Based on Hybrid Multi-Agent System
下载PDF
导出
摘要 任务自动规划是当前指控系统的重点研究内容,针对网络化指控环境下的信息分布特征和任务传播流程,建立了面向网络化指挥控制的保障任务自动迁移规划模型.以决策节点属性和任务需求为基础,研究了保障任务规划过程的混合多智能体(MAS)模型,在任务发起节点建立主控agent,设计了移动agent用于任务的迁移与本地计算,并以任务执行节点的资源信息模型进行局部求解,采用基于图最短路径搜索的任务耗费时间计算方法,建立了任务完成度模型,最后通过序列比较实现了分布式任务规划.通过建立的原型系统进行仿真实验,表明该方案能够完成任务的自动规划处理,具有可行性. Task automated planning and scheduling is current focus in the area of command and control system. By taking the C2 environment of information distribution and task processes into account, a support task automated planning and scheduling (TAPS) model is proposed, which is oriented to the network command and control (C2). Based on the decision-nodes' properties and tasks' requirements, a hybrid multi-agent system (MAS) model is studied, whose control agent (CA) is initialized on a beginning decision-node, and some mobile agents (MAs) are designed for migration and local computation. A local optimal solution is constructed by a MA at an implementing decision-node, which gives a task completion degree (TCD). The time cost is calculated based on the model of shortest path searching problem on a weighted undirected graph. TCD's collection is used for intercomparison of tasks' local solutions, and finally a task's distributed planning and scheduling procedure is implemented. Experiments on the developed prototype system show that the method for the TAPS is practical.
出处 《中北大学学报(自然科学版)》 CAS 北大核心 2012年第4期437-442,共6页 Journal of North University of China(Natural Science Edition)
关键词 自动任务规划 迁移计算 移动AGENT 保障任务 混合MAS task automated planning and scheduling migration computation mobile agent supporting task hybrid multi-agent system
  • 相关文献

参考文献5

二级参考文献28

  • 1盛秋戬,赵志崑,刘少辉,史忠植.多主体团队交互协议[J].软件学报,2004,15(5):689-696. 被引量:15
  • 2蒋建国,韩晓征.移动Agent目标主机选择策略研究[M].合肥:中国科学技术大学出版社.2001:260-263.
  • 3Dorigo M, Gambardella L. Ant colony system:a cooperative learning approach to the traveling salesman problem[ J]. IEEE Transactions on Evolutionary Computation, 1997,1 ( 1 ) : 53-56.
  • 4Stutzle T, Hoos H. MAX-MIN ant system [ J]. Future Generation Computer Systems Journal,2000,16 (8) : 889-914.
  • 5Rosenkrantz D J, Steams R E, Lewis P M. An analysis of several heuristics for the traveling salesman problem[ J]. SIAM Journal on Computing, 1997,6:563-581.
  • 6Stutzle T, Hoos H. Improvements on the ant system :introducing the MAX-MIN ant system [ C ]. Proceedings of Artificial Neural Nets and Genetic Algorithms 1997, Smith G D, Steele N C, Albrecht R F(editors). Springer Veriag, 1998: 245-249.
  • 7Moizumi K. The mobile agent planning problem [ D ]. Thayer School of Engineedng, Dartmouth College, Novermber, 1998.
  • 8[1]Chess D M. Security issues in mobile code systems. In G Vigna, editor, Mobile Agents and Security, volume 1419 of Lecture Notes in Computer Science, New York, NY: Springer-Verlag,1998, 1-14.
  • 9[2]Karnik N M, Tripathi A R. Design issues in mobile agent programming systems. IEEE Concurrency Magazine, 1998, 6(3): 52-61.
  • 10[3]Wang X F, Yi X, Lam K Y, Okamoto E. 1998, Secure information gathering agent for internet trading. Proc. of the 4th Australian Workshop on Distributed Artificial Intelligence in joint with the 8th Australian Joint Conference on Artificial Intelligence (DAI 1998), Australia, Lecture Notes in Artificial Intelligence, Springer-Verlag, Vo1.1544: 183-193.

共引文献144

同被引文献13

引证文献1

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部