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.     

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.     

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.     

Linear uncertain extensions of the minimum cost consensus model based on uncertain distance and consensus utility

Uncertainty theory adopts the belief degree and uncertainty distribution to ensure good alignment with a decision-maker’s uncertain preferences, making the final decisions obtained from the consensus-reaching process closer to the actual decision-making scenarios. Under the constraints of the uncertain distance measure and consensus utility, this article explores the minimum-cost consensus model under various linear uncertainty distribution-based preferences. First, the uncertain distance is used to measure the deviation between individual opinions and the consensus through uncertainty distributions. A nonlinear analytical formula is derived to avoid the computational complexity of integral and piecewise function operations, thus reducing the calculation cost of the uncertain distance measure. The consensus utility function defined in this article characterizes the adjustment value and degree of aggregation of individual opinions. Three new consensus models are constructed based on the consensus utility and linear uncertainty distribution. The results show that, in complex group decision-making contexts, the uncertain consensus models are more flexible than traditional minimum-cost consensus models: compared with the high volatility of the adjusted opinions in traditional deterministic consensus models with crisp number-based preferences, the variation trends of both individual adjusted opinions and the collective opinion with a linear uncertainty distribution are much smoother and the fitting range is closer to reality. The introduction of the consensus utility not only reflects the relative changes of individual opinions, but also accounts for individual psychological changes during the opinion-adjustment process. Most importantly, it reduces the cost per unit of consensus utility, facilitates the determination of the optimal threshold for the consensus utility, and improves the efficiency of resource allocation.     

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.     

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.      

David Godschalk

David R. Godschalk, professor emeritus in the Department of City and Regional Planning at the University of North Carolina, Chapel Hill, passed away in early 2018. In this essay we reflect on Dave’s planning scholarship and practice. We discuss his main contributions in 4 prominent areas. First is the importance of public participation and collaboration for the planning and governance of communities. He argued for democratizing and recasting public participation, with planners working alongside community members coproducing plans and incorporating uncertainty, new information, and different viewpoints. Second is Dave’s focus on the tenets of the comprehensive plan and its core element, the land use plan. In the plan, central principles of livable urban forms and model planning processes can be integrated and translated to practice. With academic collaborators and practitioners he pioneered theoretical and empirical research on what constitutes a high-quality plan, a fundamental question at the heart of planning. Third is his research demonstrating how spatial planning can be used for hazard mitigation and urban resilience. This work forged a new generation of planning academics and practitioners who focused on hazard plans for predisaster mitigation and postdisaster recovery at multiple governmental levels. Finally, fourth is his personal involvement in planning-related institutions that he helped create, lead, or steer. In his various roles as scholar, teacher, mentor, collaborator, supervisor, planning director, and elected official, Dave touched the lives of many who now build on his contributions in creating better communities.     

基于RANSAC分割的点云数据K-近邻去噪算法研究

针对基于TOF深度相机的空间目标表面重建的点云源数据容易受到仪器本身、扫描环境、外界干扰等影响,而含有大量的无效点和噪声点,增加了计算负担且影响了重建质量等问题,提出了一种基于随机采样一致性背景分割的点云K 近邻去噪方法,以消除目标数据的异常值和无效点。首先,改进RANSAC算法,通过设置不同的阙值对原始点云进行背景分割,以确保准确提取待重建目标的主要特征。然后,通过K 近邻点云平均算法和双边滤波算法移除离群点,最后使用体素化网格方法实现点云大数据的下采样,简化了目标点云,保留了局部特征,加快了曲面重建速度。实验结果表明,该算法能够有效的剔除噪声点,准确率高,实时性好,满足应用的要求。     

无线传感器网络混合触发一致性时间同步

针对无线传感器节点能量有限、无线通信环境差的特点,将事件触发通信机制应用于无线传感器网络(WSNs)的时间同步中,提出一种混合触发一致性时间同步(MTCTS)算法,并研究同步能耗的降低方法及传输延迟和数据丢包对同步算法的影响。节点的时钟特性建模成二阶状态方程,每个节点通过与其邻居节点交换本地时间这一状态信息获得同步控制输入,从而实现WSNs的时间同步。在所提出的一致性同步算法中,每个节点周期性地更新状态,根据当前状态是否满足给定的事件触发条件去触发通信事件的发生,如此降低通信事件的发生频率。在假定传输延迟服从指数分布和所有节点丢包率相同的情况下,进一步研究了传输延迟、信息丢包对同步精度和算法收敛性的影响。实验和MATLAB仿真验证了所提算法的有效性,并通过仿真确定出了传输延迟和丢包率的上界。