一种基于伦理学的多Agent系统模型

多Agent系统是多个自治Agent相交互、协同、合作形成的社会。伦理学是以道德为研究对象的科学。目前存在的多Agent系统模型的主要有BDI模型、效用模型、通信模型等，很少有人从伦理学的角度对多Agent系统模型进行分析。文章基于伦理学的理论，提出一种多Agent模型，并进一步探讨了在这种模型中的Agent协作求解时的有关问题。     

基于黑板的多Agent智能决策支持系统的Agent实现

结合黑板系统及Agent技术,设计基于黑板的多Agent智能决策支持系统模型,同时对该模型中的各Agent功能进行描述。此外,提出系统中Agent的抽象结构,并对Agent的行为进行了描述和建模。该系统有助于多个Agent协同求解大规模复杂问题。     

基于黑板的多Agent智能决策支持系统的Agent实现

结合黑板系统及Agent技术,设计基于黑板的多Agent智能决策支持系统模型,同时对该模型中的各Agent功能进行描述.此外,提出系统中Agent的抽象结构,并对Agent的行为进行了描述和建模.该系统有助于多个Agent协同求解大规模复杂问题.     

基于黑板的多Agent智能决策支持系统的研究

结合黑板系统及Agent技术,设计了基于黑板的多Agent智能决策支持系统模型,并对该模型的功能模块进行了详细分析,每个Agent利用黑板进行交互,通过黑板控制Agent对黑板进行控制,同时给出各Agent的描述。此外,提出了多个决策Agent协调决策的处理方法,该系统可用于多个Agent协同求解大规模复杂问题。     

基于黑板的多Agent智能决策支持系统设计

结合黑板系统及Agent技术,提出了基于黑板的多Agent智能决策支持系统的体系结构,对该系统中的各A-gent功能进行了描述,提出了各个Agent的模型。每个Agent利用黑板进行交互,通过黑板控制Agent对黑板进行控制。该系统有助于多个Agent协同求解大规模复杂问题。     

引入熟人集的Agent协作联盟构成

Agent联盟构成问题是一个复杂的组合优化问题,属于NP完全问题,其求解是很困难的.本文提出了一种Agent联盟构成策略,该策略在系统运行的初始阶段,保证任务分配的最优解.而在随后的运行中基于熟人集形成Agent联盟.该策略保证在接近任务分配优化的情况下,有效减少系统中的可能联盟数以及联盟形成过程中的通信开销和计算量,避免联盟形成过程中的盲目性,从而节省协商时间提高协商效率.     

基于CORBA的移动Agent服务器架构模型

移动Agent是一种全新的分布式计算模型，其优越的性能已受到越来越多的重视。文章分析了Agent技术与面向对象方法之间的关系，阐述了面向对象的分布式计算工业标准－CORBA规范，并在此基础上构建出基于CORBA的移动Agent服务器架构模型，充分利用了现有技术，大大减少了开发Agent系统的工作量，简化了Agent系统的实现，并且系统功能完善、开放灵活、稳定性强。     

基于多智能体的分布式智能诊断方法研究

在传统智能诊断基础上，将多Agent技术应用于动态、分布、实时和不确定的复杂系统故障诊断领域，以求解复杂过程诊断问题．提出了基于MAS的分布式智能故障诊断方法和过程；讨论了基于模式聚类的故障求解机制及对诊断问题任务的辨识、分解；研究了多Agent的约束和关联；设计了应用Agent工作状态的表达机制；确定了应用Agent间的工作状态影响关系及多Agent间的交互、协作和通讯；构建了多Agent模糊关联模型；给出了多Agent诊断系统局部诊断决策与全局诊断决策的集成描述结构：实现了一种分布式Agent诊断系统结构及其原型系统．工程应用表明，该系统能快速、准确地进行故障成因分析，并给出有效的决策意见，取得了与专家相似的诊断结果．     

一种基于蚁群算法的多任务联盟串行生成算法

联盟生成是多Agent系统的一个关键问题,主要研究如何在多Agent系统中动态生成面向任务的最优Agent联盟.引入蚁群算法解决多任务联盟问题.提出了一种基于蚁群算法的多任务联盟串行生成算法,对于任务序列可依次生成全局最优联盟,避免了联盟死锁和资源浪费,同时算法基于蚁群系统的学习能力可以有效减少联盟生成的搜索时间和计算量,可实现性好.     

一种基于Agent的通讯模型设计及其应用

Agent的一个显著特点就是它的社会性;Agent的应用主要是以多个Agent协作的形式出现;MAS的求解问题的能力超过单个Agent,Agent间的通信是系统中较为关键的问题;操作性较好的通信方式,以＂黑板＂最为著名,也有人提出了介于黑板方式和预定点方式之间的类黑板方法;本模型需要解决3类通信;采用该TTMAS通讯模型,整体运行时间可以节约30%以上。     

一种基于博弈的联盟组网方法

针对缺乏有效联盟收益分配机制,导致发送端拒绝协作,同时发送信号,造成接收端信号重叠,该文提出一种基于博弈的安全联盟组网方法。首先,将协作博弈机制中的收益分摊机制引入安全联盟组网自适应形成方法,建立发送端联盟组网模型。然后,为实现联盟方式组网,基于博弈方法将联盟组网相比非联盟时增加的总安全速率作为可转移的收益函数,平均分配给组网内各个发送端;之后,发送端遍历所有可能形成的联盟组网,得到均摊收益最大的联盟组网方式;最后,发送端自适应形成该联盟组网,无需发送信号或相同需求下窃听信道条件最坏的发送端发信号,其余所有发送端通过发送人工噪声进行协作。仿真分析验证了该方法的公平性和有效性,当发送端功率等于20 mW时,高斯信道下的网络平均安全速率相比初始状态提高1.8 。     

联盟环境中的资源安全共享模型

文章以分布式计算环境中缔结的联盟工作环境(Coalition Environment)为背景，探讨了在这种环境下．联盟中各成员之间的资源共享和保护问题，并针对这个问题提出了自己的解决方案一资源安全共享模型(secure resources sharing)，简称为SRS。SRS是RBAC(基于角色的访问控制模型)在联盟环境中的拓展。在SRS中，联盟成员间完全平等地进行信任协商；通过引入了访问请求证书、管理者和监听者等结构要素，使得联盟的安全结构和联盟中各成员的本地安全结构得到有效隔离。SRS采用了TBAC的基于任务的访问权限管理机制，使其安全机制联盟环境中任务进程有机地统一起来，从而具有了动态安全模型的特征。     

Dynamic Spectrum Allocation with Maximum Efficiency and Fairness in Interactive Cognitive Radio Networks

In Interactive Cognitive Radio Networks (ICRNs), secondary usage of spectrum is of competition and cooperation, and radio frequency environment is time-varying. In order to realize real-time secondary spectrum usage, coalition-competition architecture for the ICRNs is introduced in this paper. In the coalition-competition architecture, the ICRNs are divided into many coalitions according to geographical locations, utilization degree of spectrum, frequency range and transmission power level. There exists competition among different coalitions. In the same coalition with competition and cooperation, a model based on cooperative differential games is proposed to solve dynamic spectrum allocation, and cooperative equilibrium solution to the model is given and analyzed in this paper. From an overall perspective, the relationships between available spectrum percentage and the spectrum access rate are studied. How to form a coalition, and the mechanism to allocate total spectrum among secondary users considering Pareto optimality and individual rationality in the coalition are analyzed. The simulation results show the dynamic spectrum allocation model is fair and efficient, and it reflects realistically time-varying radio frequency environment. Cooperative differential games are particularly helpful for the spectrum management in the time-varying radio environment.     

面向移动目标跟踪的动态联盟平滑切换方法

针对传统动态联盟离散生成方式所导致的能耗较大且历史信息易失等不足,提出一种动态联盟的平滑切换方法。首先,预估目标移动的下一位置;然后,检测联盟切换的触发条件;最后,通过新盟主选择、新旧盟主交接以及盟员变动等一系列过程实现联盟的平滑切换。并在目标丢失后,进行联盟修复。联盟的平滑切换将避免联盟因目标移动而反复生成和解散,并保持和利用联盟收集的历史信息。仿真结果显示,该方法能有效维持动态联盟,实现联盟的平滑切换,与传统动态联盟方法相比,降低了系统的能耗和通信成本,提高了目标跟踪的精度,验证了该方法的有效性。     

Simultaneous spectrum sensing,data transmission and Energy harvesting in multi‐channel cognitive sensor Networks with imperfect signal cancellation

In multichannel cognitive sensor networks, the sensor users which have limited energy budgets sense the spectrum to determine the activity of the primary user. If the spectrum is idle, the sensor user can access the licensed spectrum. However, during the spectrum sensing, no data transmits. For improving the network throughput and saving more energy consumption, we propose the simultaneous spectrum sensing and data transmission scheme where the sensor receiver decodes the received signal, and from the remaining signal, the status of the channel (idle/busy) is determined. We also consider that the sensor users are powered by a radio‐frequency (RF) energy harvester. In this case, energy harvesting, data transmission, and spectrum sensing are done simultaneously. On the other hand, we select the proper sensor users for spectrum sensing and energy harvesting. We also allocate the best channels for data transmission simultaneously so that the network throughput maximizes and the constraints on the energy consumption and the detection performance are satisfied for each band. We formulate the problem and model it as a coalition game in which sensors act as game players and decide to make coalitions. Each coalition selects one of the channels to sense and transmit data, while the necessary detection probability and false alarm probability and also the energy consumption constraints are satisfied. The utility function of a coalition is proposed based on the energy consumption, false alarm probability, detection probability, and the network throughput. This paper proposes an efficient algorithm to reach a Nash‐stable coalition structure. It is demonstrated that the proposed method maximizes the network throughput and reduces the energy consumption while it provides sufficient detection quality, in comparison to other existent methods.     

OA系统中的动态工作流模型分析

针对办公业务流程的多变性，研究了工作流技术在OA系统中的应用，对WFMC定义元模型作了适当的扩展，使之能够实现OA系统中工作流的动态管理。提出并建立了该工作流系统的数学模型。     

基于合作微分博弈的物联网能量带宽优化模型（英文）

Internet of Things(IoT) refers to an infrastructure which enables the forms of communication and collaboration between people and things,and between things themselves.In order to improve its performance,we present a tradeoff between bandwidth and energy consumption in the IoT in this paper.A service providing model is built to find the relationship between bandwidth and energy consumption using a cooperative differential game model.The game solution is gotten in the condition of grand coalition,feedback Nash equilibrium and intermediate coalitions and an allocation policy is obtain by Shapley theory.The results are shown as follows.Firstly,the performance of IoT decreases with the increasing of bandwidth cost or with the decreasing of energy cost;secondly,all the nodes in the IoT composing a grand coalition can save bandwidth and energy consumption;thirdly,when the factors of bandwidth cost and energy cost are equal,the obtained number of provided services is an optimised value which is the trade-off between energy and bandwidth consumption.     

A coalition formation game based relay selection scheme for cooperative cognitive radio networks

In a cognitive radio network, cooperative communications between a primary user (PU) and a second user (SU) may be able to significantly improve the spectrum utilization, and thus, the network performance. To be specific, the PU can select a number of SUs as its relays to cooperatively transmit its data. In turn, these relays can be granted access to the licensed channel of the PU to transmit their data. In this paper, an effective cooperation strategy for SUs is presented. We formulate the problem of cooperative relay selection as a coalition formation game, and develop a utility function based on the game. The utility function considers various factors such as transmission power and noise level. With the utility function, a distributed coalition formation algorithm is proposed, which can be used by SUs to decide whether to join or leave a coalition. Such a decision is based on whether it can increase the maximal coalition utility value. We rigorously prove that our proposed coalition formation algorithm can terminate and reach a stable state. Finally, this paper demonstrates that the proposed scheme is able to enhance the network throughput via a simulation study.     

运维系统工作流引擎的设计与实现

在工作流管理联盟给出的工作流参考模型中,工作流引擎是参考模型的核心,是任务调度器和资源分配器。文中将FSM(有限状态机)的理念应用于引擎,设计了一个工作流引擎,详细描述了工作流参考模型、有限状态机模型、引擎的调度以及3层B/S模式。最后,采用 J2EE 技术对工作流引擎进行了实现,并成功地将工作流引擎在某企业运维系统中加以应用,取得了良好的效果。