共查询到19条相似文献,搜索用时 125 毫秒
1.
2.
3.
一种多属性的MAS任务分配机制研究 总被引:1,自引:0,他引:1
利用决策论模型对任务分配问题进行建模是当前研究MAS任务分配问题的重要方向之一.利用决策论模型提出了一种多属性MAS任务分配模型及最优任务分配原理,并采用了基于效用理论的多属性决策方法PROMETHEE-Ⅱ对MAS任务分配算法进行有效地实证分析.通过实证分析说明,这种方法非常有效且能够作出比较合理的任务分配决策. 相似文献
4.
5.
6.
7.
多Agent技术为网络中心战的研究和发展提供了新的思路。以网络中心战环境下飞机编队协同对地攻击系统为对象,对其多Agent系统体系结构进行了研究,分析了编队协同对地攻击作战方式的战斗组成和作战特点,提出了有限中央控制下的分布式控制结构,构建了网络中心战编队协同对地攻击多Agent系统体系结构,特别对编队协同对地攻击指挥控制系统进行了详细分析,最后,基于所建立的MAS体系结构,在HLA仿真环境中进行了仿真实验,表明论文所采用理论的正确性和所建立体系结构的合理性。编队协同对地攻击多Agent系统体系结构的研究为后续的工作奠定了基础。 相似文献
8.
有人机/无人机编队协同任务分配方法 总被引:5,自引:1,他引:4
任务分配方法是任务控制过程的重要组成部分,是编队协同作战指挥策略的关键。以合同网协议(contract net protocol, CNP)和多智能体系统(multi-agent system, MAS)理论为基础,建立了有人机/无人机编队MAS结构和基于投标过程的任务分配模型,将任务优先权引入任务分配模型中,可以实现预先任务分配和执行过程中动态任务分配,保证动态环境下编队整体分配效能较优。针对作战想定进行了仿真计算,结果表明,基于CNP和MAS理论的有人机/无人机编队协同任务分配策略具有良好的预先任务分配和实时任务分配效果,能够满足编队作战任务的需要。 相似文献
9.
10.
11.
有人/无人作战智能体任务联盟是面向分布式网络化作战体系提出的一种作战样式,任务分配问题是研究任务联盟指挥策略的关键点之一。以有人/无人作战智能体任务联盟为研究对象,提出与之适应的分布式体系结构。将任务执行质量引入任务分配问题建模中,以拍卖算法为基础,通过编组整体拍卖、方案预处理等改进机制,有效降低了个体方案的构建开销,并在约束的时间内实现任务联盟的动态任务分配。针对作战想定进行了仿真计算,结果表明算法能在有限拍卖次数下给出接近理想优化效果的分配方案。 相似文献
12.
基于多agent系统的舰艇编队防空辅助决策系统 总被引:4,自引:0,他引:4
提出基于多agent系统(multi-agent system,MAS)技术的分布式编队防空辅助决策系统基本框架。在目标信息共享和平台间实时作战参数交换的前提下建立了基于平等协商的分布式目标协商算法,混合运用Ta-bu搜索算法和基于规则的计划算法。在目标分配协商中,采用~Brown算法通过agent之间平等协商进行目标分配。在本舰防空计划中,采取软/硬防空计划并行比较消解冲突,实现本舰软/硬防空武器防空计划的协调。 相似文献
13.
在瞬息万变的网络化体系作战环境中,如何准确、及时地提取有用信息并作出决策,有效应对实际作战中作战效益低、资源损耗大、作战时间长等问题一直是研究的热点之一。本文以多平台协同完成对来袭目标的拦截任务为背景,提出了一种多平台分布式协同作战下基于模型预测控制(model prediction control, MPC)和多智能体系统(multi-agent system, MAS)的指挥控制系统模型。通过引入分布式多平台协同的模型概念,使各平台之间实现完全信息共享,并且采用全局分布-局部集中的决策结构,设计了分布式指挥控制的协同模型框架,选定蒙特卡罗方法进行仿真实验对比。实验结果证明了该模型具有收敛性好、误差低、损失值低等优点,可以高效地解决分布式环境下协同作战的指挥控制模型构建问题。 相似文献
14.
15.
Recently the integrated modular avionics (IMA) architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture.A novel hierarchical approach is proposed to solve the resource allocation problem for IMA systems in distributed environments.Firstly,the worst case response time of tasks with arbitrary deadlines is analyzed for the two-level scheduler.Then,the hierarchical resource allocation approach is presented in two levels.At the platform level,a task assignment algorithm based on genetic simulated annealing (GSA) is proposed to assign a set of pre-defined tasks to different processing nodes in the form of task groups,so that resources can be allocated as partitions and mapped to task groups.While yielding to all the resource constraints,the algorithm tries to find an optimal task assignment with minimized communication costs and balanced work load.At the node level,partition parameters are optimized,so that the computational resource can be allocated further.An example is shown to illustrate the hierarchal resource allocation approach and manifest the validity.Simulation results comparing the performance of the proposed GSA with that of traditional genetic algorithms are presentod in the context of task assignment in IMA systems. 相似文献
16.
17.
Heterogeneous computing is one effective method of high performance computing with many advantages. Task scheduling is a critical issue in heterogeneous environments as well as in homogeneous environments. A number of task scheduling algorithms for homogeneous environments have been proposed, whereas, a few for heterogeneous environments can be found in the literature. A novel task scheduling algorithm for heterogeneous environments, called the heterogeneous critical task (HCT) scheduling algorithm is presented. By means of the directed acyclic graph and the gantt graph, the HCT algorithm defines the critical task and the idle time slot. After determining the critical tasks of a given task, the HCT algorithm tentatively duplicates the critical tasks onto the processor that has the given task in the idle time slot, to reduce the start time of the given task. To compare the performance of the HCT algorithm with several recently proposed algorithms, a large set of randomly generated applications and the Gaussian elimination application are randomly generated. The experimental result has shown that the HCT algorithm outperforms the other algorithm. 相似文献
18.
任务和资源调度方法是云系统的关键技术之一。但是,现有的研究往往忽略实时任务的高动态性和任务执行时间的随机性,使得调度方案的实际性能与期望性能相差甚远。针对以上问题,本文设计一个随机性感知的调度框架;提出一个启发式调度算法集成前摄性和反应式策略(proactive and reactive strategy, PRS)来对任务进行调度,以提高云系统保障实时任务时效性的能力;并提出3个计算资源伸缩策略来动态调整计算资源,以减少能量消耗。最后,通过实验将算法PRS的性能与其他4个算法进行比较。实验结果表明,在任务完成率和能耗方面,算法PRS的性能比已有算法提高13.85%和17.23%。 相似文献
19.
A newly proposed distributed dynamic state estimation algorithm based on the maximum a posteriori (MAP) technique is generalised and studied for power systems. The system model involves linear time-varying load dynamics and nonlinear measurements. The main contribution of this paper is to compare the performance and feasibility of this distributed algorithm with several existing distributed state estimation algorithms in the literature. Simulations are tested on the IEEE 39-bus and 118-bus systems under various operating conditions. The results show that this distributed algorithm performs better than distributed quasi-steady state estimation algorithms which do not use the load dynamic model. The results also show that the performance of this distributed method is very close to that by the centralized state estimation method. The merits of this algorithm over the centralized method lie in its low computational complexity and low communication load. Hence, the analysis supports the efficiency and benefits of the distributed algorithm in applications to large-scale power systems. 相似文献