A comparative study for consistency-based decision making with interval multiplicative preference relations

ABSTRACT

To ensure the reasonable application and perfect the theory of decision making with interval multiplicative preference relations (IMPRs), this paper continues to discuss decision making with IMPRs. After reviewing previous consistency concepts for IMPRs, we find that Krej?í’s consistency concept is more flexible and natural than others. However, it is insufficient to address IMPRs only using this concept. Considering this fact, this paper researches inconsistent and incomplete IMPRs that are usually encountered. First, programming models for addressing inconsistent and incomplete IMPRs are constructed. Then, this paper studies the consensus of individual IMPRs and defines a consensus index using the defined correlation coefficient. When the consensus requirement does not satisfy requirement, a programming model for improving consensus level is built, which can ensure the consistency. Subsequently, a procedure for group decision making with IMPRs is offered, and associated examples are provided to specifically show the application of main theoretical results.     

Maximizing Convergence Speed for Second Order Consensus in Leaderless Multi-Agent Systems

The paper deals with the consensus problem in a leaderless network of agents that have to reach a common velocity while forming a uniformly spaced string. Moreover, the final common velocity (reference velocity) is determined by the agents in a distributed and leaderless way. Then, the consensus protocol parameters are optimized for networks characterized by a communication topology described by a class of directed graphs having a directed spanning tree, in order to maximize the convergence rate and avoid oscillations. The advantages of the optimized consensus protocol are enlightened by some simulation results and comparison with a protocol proposed in the related literature. The presented protocol can be applied to coordinate agents such as mobile robots, automated guided vehicles (AGVs) and autonomous vehicles that have to move with the same velocity and a common inter-space gap.      

基于滑模的二阶多智能体快速抗扰一致性

针对带有外部未知扰动的二阶多智能体系统的领导—跟随有限时间一致性问题，本文设计出一种带有时变增益的有限时间干扰观测器，用以实现对每个跟随智能体中未知扰动的快速估计，在此基础上，本文结合超螺旋积分滑模控制方法并利用邻居智能体的位置和速度信息设计一种快速抗扰一致性协议，该协议能够保证存在非线性动态的多智能体系统有限时间一致性控制并能抑制抖振现象.同时，利用李亚普诺夫函数进行了稳定性的证明.最后，通过Matlab数值仿真进一步验证了所提出协议的可行性.     

Leader-following consensus of fractional-order multi-agent systems via adaptive control

This article focuses on the consensus problem of leader-following fractional-order multi-agent systems (MASs) with general linear and Lipschitz nonlinear dynamics. First, the distributed adaptive protocols for linear and nonlinear fractional-order MASs are constructed, respectively. We allow the control coupling gains to be time varying for each agent. Moreover, the adaptive modification schemes for the control gain are designed, which renders smaller control gains and thus requires smaller amplitude on the control input without sacrificing consensus convergence. Second, based on fractional-order Lyapunov stability theorem and Barbalat's lemma, two novel sufficient conditions in terms of linear matrix inequalities are provided to ensure that the leader-following consensus can be obtained in the case for any undirected connected communication graph. Furthermore, we show that the proposed algorithm also works for consensus of agents with intrinsic Lipschitz nonlinear dynamics. As a result, the proposed framework requires no global information and thus can be implemented in a fully distributed manner. Finally, the numerical simulations are given to demonstrate the effectiveness of obtained the theoretical results.     

Improved average consensus algorithm based distributed cost optimization for loading shedding of autonomous microgrids

This paper addresses a new distributed cost optimization (DCO) method for load shedding (LS) of an islanded microgrid considering cost. A two-layer improved average consensus algorithm (IACA) of multi-agent system (MAS) is proposed, and the consensus characteristic of which is analyzed in detail. With the global information discovered in the first layer of the IACA, the DCO of LS can be solved by using the synchronization processing of the IACA in the second layer. PSCAD/EMTDC-based simulation models are built to study the value settings of consensus constants and the performances of the proposed DCO method. Simulation results verified the convergence improvement of the IACA and the effectiveness of the proposed DCO.     

Fully distributed tracking control for non‐identical multi‐agent systems with matching uncertainty

This article addresses the fully distributed consensus tracking control problem of linear multi‐agent systems with parameter uncertainties. First, a new class of distributed protocol, based on the relative states of neighbors, is proposed. Theoretical analysis indicates that the considered problem can be solved if the control gain constant of the protocol is larger than the norm bound of the leader's nonlinear inputs. Furthermore, a distributed adaptive control protocol is proposed for the case without available global information. The distributed consensus tracking control problem of uncertain linear multi‐agent systems is solved based only on local information under the proposed adaptive protocol. Finally, an application in low‐Earth‐orbit satellite formation flying is provided to illustrate the theoretical results. Copyright © 2014 John Wiley & Sons, Ltd.     

Minimum cost consensus model for CRP-driven preference optimization analysis in large-scale group decision making using Louvain algorithm

Large-scale group decision-making problems based on social network analysis and minimum cost consensus models (MCCMs) have recently attracted considerable attention. However, few studies have combined them to form a complete decision-making system. Accordingly, we define the satisfaction index to optimize the classical MCCM by considering the effect of the group on individuals. Similarly, we define the consistency index to optimize the consensus reaching process (CRP). Regarding the evolution of the consensus network, the Louvain algorithm is used to divide the entire group into several subgroups to ensure that each subgroup is independent but has strong cohesion. By constructing the MCCM based on the satisfaction index and the optimized consensus-reaching process, the group opinions in each subgroup are ranked to obtain the final ranking of alternatives. Finally, to verify the validity of CRP and the practical value of the proposed model, we conduct consensus network evolution and decision-making analysis in the case of a negotiation between the government and polluting companies to achieve uniform pollution emissions. Sensitivity analysis is performed to demonstrate the stability of the subgroup weights. Furthermore, a comparative analysis using existing models verifies the effectiveness of the proposed model.     

An objective and interactive-information-based feedback mechanism for the consensus-reaching process considering a non-support degree for minority opinions

The consensus-reaching process (CRP) to achieve higher unanimity and ensure common agreement before deriving a final decision has become an important procedure in group decision-making problems. The demand for high-quality decision results has motivated the development of large-scale group decision-making (LGDM). In such cases, the issue of minority opinion has gained awareness due to the related effects on enhancing consensus and decision quality. A minority opinion cannot exert an effect unless the majority attach importance to whether that opinion is supported or not. To reflect the effect of minority opinions on consensus, this paper establishes a LGDM framework with an objective and interactive-information-based feedback mechanism for the CRP. Given the natural forms of human expression, multi-granular linguistic information and a 2-tuple linguistic model are used. First, initial weights are objectively assigned to decision-makers (DMs) to weaken the impact of the majority. Subsequently, a non-support degree function is newly defined to reflect the extent to which other DMs dissent from a minority opinion. More importantly, feedback rules are constructed to make corresponding adjustments to the powers of discourse among all DMs in the attempt to reach consensus. Finally, the proposed three-phase LGDM framework is applied to new product development (NPD), and simulation experiments are conducted based on two algorithms to verify the framework's applicability and feasibility.     

基于一致性算法的电力系统分布式经济调度方法综述

传统集中式调度方法难以满足高渗透率分布式电能资源接入背景下电力系统经济调度的需求,分布式经济调度方案因具有可靠性高、可扩展性强、通信计算负载均匀等特点得到了越来越多的关注。对电力系统分布式经济调度方法的国内外研究现状进行了综述,重点阐述了一致性算法的原理、应用及成为分布式经济调度主导算法的原因。比较了集中式和分布式经济调度系统及问题的求解过程,分析了分布式经济调度实现过程的关键环节,并对现有关键问题解决方法的优缺点进行了评述,分析了电力系统分布式经济调度方法研究中有待解决的问题并提出了未来可进一步研究的方向。