Simple Majority Consensus in Networks with Unreliable Communication

In this work, we analyze the performance of a simple majority-rule protocol solving a fundamental coordination problem in distributed systems—binary majority consensus—in the presence of probabilistic message loss. Using probabilistic analysis for a large-scale, fully-connected, network of 2n agents, we prove that the Simple Majority Protocol (SMP) reaches consensus in only three communication rounds, with probability approaching 1 as n grows to infinity. Moreover, if the difference between the numbers of agents that hold different opinions grows at a rate of n, then the SMP with only two communication rounds attains consensus on the majority opinion of the network, and if this difference grows faster than n, then the SMP reaches consensus on the majority opinion of the network in a single round, with probability converging to 1 as exponentially fast as n→∞. We also provide some converse results, showing that these requirements are not only sufficient, but also necessary.     

基于SURF-RANSAC配准的三维重建

为了提高三维重建中双目特征匹配的匹配效率和重建质量,在基于传统的加速鲁棒特征(SURF)匹配算法基础上,提出了一种基于SURF-RANSAC配准的三维重建算法。利用左右两幅图像来进行三维重建,首先通过Hessian矩阵来获取目标图像的初始特征点,并用邻近快速搜索算法完成初步的特征点匹配,然后融合随机抽样一致性算法(RANSAC)来优化匹配,最后利用三维坐标和纹理映射来完成三维重建。在Open CV上对该算法进行验证。结果表明,本文算法比传统的三维重建算法具有更高的精确度和更快的速度。     

基于切换层次网络的一致性算法研究

针对多智能体网络一致性问题,受自然界中鸽群的启发,提出一种新的有向网络拓扑即层次网络,且证明了所提出的层次网络的性能优于当前应用广泛的leader-following网络,研究了基于层次拓扑的一阶积分器网络对机动目标跟踪的一致性误差,证明一致性误差有界且与网络拉普拉斯矩阵第二小特征值及目标状态有关,并讨论了切换层次网络的一致性误差问题. 仿真结果验证了理论的有效性.      

Consensus protocol for multi-agent continuous systems

Based on the algebraic graph theory, the networked multi-agent continuous systems are investigated. Firstly, the digraph （directed graph） represents the topology of a networked system, and then a consensus convergence criterion of system is proposed. Secondly, the issue of stability of multi-agent systems and the consensus convergence problem of information states are all analysed. Furthermore, the consensus equilibrium point of system is proved to be global and asymptotically reach the convex combination of initial states. Finally, two examples are taken to show the effectiveness of the results obtained in this paper.     

VoteDock: Consensus docking method for prediction of protein–ligand interactions

Molecular recognition plays a fundamental role in all biological processes, and that is why great efforts have been made to understand and predict protein–ligand interactions. Finding a molecule that can potentially bind to a target protein is particularly essential in drug discovery and still remains an expensive and time‐consuming task. In silico, tools are frequently used to screen molecular libraries to identify new lead compounds, and if protein structure is known, various protein–ligand docking programs can be used. The aim of docking procedure is to predict correct poses of ligand in the binding site of the protein as well as to score them according to the strength of interaction in a reasonable time frame. The purpose of our studies was to present the novel consensus approach to predict both protein–ligand complex structure and its corresponding binding affinity. Our method used as the input the results from seven docking programs (Surflex, LigandFit, Glide, GOLD, FlexX, eHiTS, and AutoDock) that are widely used for docking of ligands. We evaluated it on the extensive benchmark dataset of 1300 protein–ligands pairs from refined PDBbind database for which the structural and affinity data was available. We compared independently its ability of proper scoring and posing to the previously proposed methods. In most cases, our method is able to dock properly approximately 20% of pairs more than docking methods on average, and over 10% of pairs more than the best single program. The RMSD value of the predicted complex conformation versus its native one is reduced by a factor of 0.5 Å. Finally, we were able to increase the Pearson correlation of the predicted binding affinity in comparison with the experimental value up to 0.5. © 2010 Wiley Periodicals, Inc. J Comput Chem 32: 568–581, 2011     

Nonlinear consensus protocols for multi-agent systems based on centre manifold reduction

Nonlinear consensus protocols for dynamic directed networks of multi-agent systems with fixed and switching topologies are investigated separately in this paper. Based on the centre manifold reduction technique, nonlinear consensus protocols are presented. We prove that a group of agents can reach a β-consensus, the value of which is the group decision value varying from the minimum and the maximum values of the initial states of the agents. Moreover, we derive the conditions to guarantee that all the agents reach a β--consensus on a desired group decision value. Finally, a simulation study concerning the vertical alignment manoeuvere of a team of unmanned air vehicles is performed. Simulation results show that the nonlinear consensus protocols proposed are more effective than the linear protocols for the formation control of the agents and they are an improvement over existing protocols.     

Distributed event-triggered consensus tracking of second-order multi-agent systems with a virtual leader

This paper investigates the consensus tracking problems of second-order multi-agent systems with a virtual leader via event-triggered control. A novel distributed event-triggered transmission scheme is proposed, which is intermittently examined at constant sampling instants. Only partial neighbor information and local measurements are required for event detection. Then the corresponding event-triggered consensus tracking protocol is presented to guarantee second-order multi-agent systems to achieve consensus tracking. Numerical simulations are given to illustrate the effectiveness of the proposed strategy.     

坚持和发展中国特色社会主义必须凝聚社会共识

学习贯彻党的十八大精神,坚持和发展中国特色社会主义,当前最关键、最紧要的,就是要在坚持改革开放、坚持社会和谐、坚持科学发展和坚持"中国特色"上,最大限度地凝聚社会共识。结合当前经济社会发展实际,必须在化解矛盾、解决问题中,必须在交流互动、博彩众长中,必须在警惕极端思潮、僵化教条中,最大限度地凝聚社会共识。     

离散异质多智能体系统的分组一致性控制

针对一类混合异质多智能体系统的分组一致性控制问题进行了研究。具体分析了由一阶智能体和二阶智能体组成的混合异质系统,研究其在离散情况下的分组一致性。基于两个合理的假设提出了线性控制协议,运用代数图论、稳定性理论和矩阵理论,分析协议作用下闭环系统的系统矩阵及动态特性,取得了系统渐近实现分组一致性的充分条件,该条件与系统拓扑结构、采样周期以及控制参数有关。结论同时适用于有向拓扑与无向拓扑,最后通过仿真实例对所得分析结果进行了验证。     

基于Android平台的障碍物检测系统的设计与实现

为了提高视觉导盲仪障碍物检测系统的便携性,建立了基于Android平台的障碍物检测系统。对该系统所采用的Android平台采集双目图像、路面平面提取和障碍物检测等算法进行研究。首先,根据Android平台的USB HOST API介绍了Android平台以非ROOT的方式采集双目图像数据;然后,提取并匹配双目图像的特征点得到稀疏的三维点云,在三维点云中用随机抽样一致性算法(random sample consensus,RANSAC)来提取路面平面;最后,在利用双目图像路面平面单应性来区分路面与障碍物的基础上,说明了采用半全局块匹配(semi-global block matching,SGBM)进行障碍物检测的算法。实验结果表明:系统5 m以内的障碍物检测准确率达到90%;检测时间达到1 s/帧。完全满足视觉导盲仪障碍物检测系统的检测准确率高、实时性高、易便携等要求。