scholarly journals A Novel Clustering Method Based on Quasi-Consensus Motions of Dynamical Multiagent Systems

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Ning Cai ◽  
Chen Diao ◽  
M. Junaid Khan
Keyword(s):  
Multiagent Systems ◽  
Multiagent System ◽  
Theoretical Foundation ◽  
Cluster Structure ◽  
Group Consensus ◽  
Necessary And Sufficient Condition ◽  
Graph Topology ◽  
Novel Approach ◽  
Similar Cluster ◽  
Necessary And Sufficient

This paper presents a novel approach for clustering, which is based on quasi-consensus of dynamical linear high-order multiagent systems. The graph topology is associated with a selected multiagent system, with each agent corresponding to one vertex. In order to reveal the cluster structure, the agents belonging to a similar cluster are expected to aggregate together. To establish the theoretical foundation, a necessary and sufficient condition is given to check the achievement of group consensus. Two numerical instances are furnished to illustrate the results of our approach.

Engineering of Experience Based Trust for E-Commerce

2010 ◽  
pp. 342-367 ◽  
Author(s):  
Zhaohao Sun ◽  
Jun Han ◽  
Dong Dong ◽  
Shuliang Zhao
Keyword(s):  
Artificial Intelligence ◽  
Sustainable Development ◽  
Research And Development ◽  
Multiagent Systems ◽  
System Architecture ◽  
Intelligent Systems ◽  
Multiagent System ◽  
Theoretical Foundation ◽  
Knowledge Based ◽  
Trust Inference

Trust is significant for sustainable development of e-commerce and has received increasing attention in e-commerce, multiagent systems (MAS), and artificial intelligence (AI). However, little attention has been given to the theoretical foundation and intelligent techniques for trust in e-commerce from a viewpoint of intelligent systems and engineering. This chapter will fill this gap by examining engineering of experience-based trust in e-commerce from the viewpoint of intelligent systems. It looks at knowledgebased trust, inference-based trust and their interrelationships with experience-based trust. It also examines scalable trust in e-commerce. It proposes a knowledge based model of trust in e-commerce and a system architecture for METSE: a multiagent system for experience-based trust in e-commerce. The proposed approach in this chapter will facilitate research and development of trust, multiagent systems, e-commerce and e-services.

scholarly journals Heavy-tailed asymptotics of stationary probability vectors of Markov chains of gi/g/1 type

2005 ◽  
Vol 37 (02) ◽  
pp. 482-509 ◽  
Author(s):  
Quan-Lin Li ◽  
Yiqiang Q. Zhao
Keyword(s):  
Transition Matrix ◽  
Stationary Probability ◽  
Probability Vector ◽  
Necessary And Sufficient Condition ◽  
Hopf Equation ◽  
Novel Approach ◽  
Matrix Sequence ◽  
Heavy Tailed ◽  
Necessary And Sufficient ◽  
Stationary Probability Vector

In this paper, we provide a novel approach to studying the heavy-tailed asymptotics of the stationary probability vector of a Markov chain of GI/G/1 type, whose transition matrix is constructed from two matrix sequences referred to as a boundary matrix sequence and a repeating matrix sequence, respectively. We first provide a necessary and sufficient condition under which the stationary probability vector is heavy tailed. Then we derive the long-tailed asymptotics of the R-measure in terms of the RG-factorization of the repeating matrix sequence, and a Wiener-Hopf equation for the boundary matrix sequence. Based on this, we are able to provide a detailed analysis of the subexponential asymptotics of the stationary probability vector.

scholarly journals Consensus of Third-Order Multiagent Systems with Time Delay in Undirected Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-5 ◽  
Author(s):  
Yanfen Cao ◽  
Yuangong Sun
Keyword(s):  
Time Delay ◽  
Multiagent Systems ◽  
Continuous Time ◽  
Matrix Analysis ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Third Order ◽  
Necessary And Sufficient ◽  
Frequency Domain Approach ◽  
Order Continuous

We consider consensus of a class of third-order continuous-time multiagent systems with time delay in undirected networks. By using matrix analysis and a frequency domain approach, a necessary and sufficient condition for consensus is established. A simulation result is also given to illustrate the main theoretical result.

Multi-Group Consensus of Heterogeneous Fractional-Order Nonlinear Agents via Pinning Control

2011 ◽  
Author(s):  
Wei Sun ◽  
YangQuan Chen ◽  
Changpin Li
Keyword(s):  
Fractional Order ◽  
Chaotic Systems ◽  
Pinning Control ◽  
Graph Laplacian ◽  
Control Law ◽  
Group Consensus ◽  
Necessary And Sufficient Condition ◽  
Zero Eigenvalue ◽  
Geometric Multiplicity ◽  
Necessary And Sufficient

The present work concerns the multi-group consensus behavior of directed complex networks. The network consists of agents with heterogeneous fractional-order non-linear dynamics. It can be divided into several groups due to their dynamics or equilibriums. Each group will be stabilized at an equilibrium and different groups may have different steady state values. A necessary and sufficient condition is provided for the proposed pinning control law to be locally Mittag-Leffler stable. The conclusion turns to guarantee the exponential stable for integer-order systems. The collection of heterogeneous equilibriums is determined by the geometric multiplicity of the zero eigenvalue respect to the graph Laplacian. Simulations on fractional-order chaotic systems demonstrated the conclusions.

scholarly journals An Approach to Model Based Testing of Multiagent Systems

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Shafiq Ur Rehman ◽  
Aamer Nadeem
Keyword(s):  
Multiagent Systems ◽  
Autonomous Agents ◽  
Multiagent System ◽  
Dynamic Environment ◽  
Proactive Behavior ◽  
Prototype Tool ◽  
Novel Approach ◽  
Model Based Testing ◽  
Coverage Criterion ◽  
Prometheus Methodology

Autonomous agents perform on behalf of the user to achieve defined goals or objectives. They are situated in dynamic environment and are able to operate autonomously to achieve their goals. In a multiagent system, agents cooperate with each other to achieve a common goal. Testing of multiagent systems is a challenging task due to the autonomous and proactive behavior of agents. However, testing is required to build confidence into the working of a multiagent system. Prometheus methodology is a commonly used approach to design multiagents systems. Systematic and thorough testing of each interaction is necessary. This paper proposes a novel approach to testing of multiagent systems based on Prometheus design artifacts. In the proposed approach, different interactions between the agent and actors are considered to test the multiagent system. These interactions include percepts and actions along with messages between the agents which can be modeled in a protocol diagram. The protocol diagram is converted into a protocol graph, on which different coverage criteria are applied to generate test paths that cover interactions between the agents. A prototype tool has been developed to generate test paths from protocol graph according to the specified coverage criterion.

scholarly journals Consensus of Discrete Time Second-Order Multiagent Systems with Time Delay

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Wei Zhu
Keyword(s):  
Time Delay ◽  
Convergence Rate ◽  
Theoretical Result ◽  
Multiagent Systems ◽  
Discrete Time ◽  
Second Order ◽  
Sufficient Condition ◽  
Consensus Problem ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient

The consensus problem for discrete time second-order multiagent systems with time delay is studied. Some effective methods are presented to deal with consensus problems in discrete time multiagent systems. A necessary and sufficient condition is established to ensure consensus. The convergence rate for reaching consensus is also estimated. It is shown that arbitrary bounded time delay can safely be tolerated. An example is presented to illustrate the theoretical result.

scholarly journals Heavy-tailed asymptotics of stationary probability vectors of Markov chains of gi/g/1 type

2005 ◽  
Vol 37 (2) ◽  
pp. 482-509 ◽  
Author(s):  
Quan-Lin Li ◽  
Yiqiang Q. Zhao
Keyword(s):  
Transition Matrix ◽  
Stationary Probability ◽  
Probability Vector ◽  
Necessary And Sufficient Condition ◽  
Hopf Equation ◽  
Novel Approach ◽  
Matrix Sequence ◽  
Heavy Tailed ◽  
Necessary And Sufficient ◽  
Stationary Probability Vector

In this paper, we provide a novel approach to studying the heavy-tailed asymptotics of the stationary probability vector of a Markov chain of GI/G/1 type, whose transition matrix is constructed from two matrix sequences referred to as a boundary matrix sequence and a repeating matrix sequence, respectively. We first provide a necessary and sufficient condition under which the stationary probability vector is heavy tailed. Then we derive the long-tailed asymptotics of the R-measure in terms of the RG-factorization of the repeating matrix sequence, and a Wiener-Hopf equation for the boundary matrix sequence. Based on this, we are able to provide a detailed analysis of the subexponential asymptotics of the stationary probability vector.

scholarly journals Swarm Stability Analysis of High-Order Linear Time-Invariant Singular Multiagent Systems

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Mingyu Fu ◽  
Shimin Wang ◽  
Yirui Cong
Keyword(s):  
Multiagent Systems ◽  
Stability Problem ◽  
Linear Time ◽  
Sufficient Conditions ◽  
High Order ◽  
Graph Topology ◽  
Order Linear ◽  
Linear Time Invariant ◽  
Necessary And Sufficient ◽  
Time Invariant

The swarm stability problem of high-order linear time-invariant (LTI) singular multiagent systems with directed graph topology is investigated extensively. Consensus of multiagent systems can be regarded as a specific case of swarm stability problem. Necessary and sufficient conditions for both swarm stability and consensus are presented. These conditions depend on the graph topology and generalized inverse theory, the dynamics of agents, and interaction among the neighbours. Several examples to illustrate the effectiveness of theoretical results are given.

scholarly journals Weighted Couple-Group Consensus Analysis of Heterogeneous Multiagent Systems with Cooperative-Competitive Interactions and Time Delays

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Xingcheng Pu ◽  
Chaowen Xiong ◽  
Lianghao Ji ◽  
Longlong Zhao
Keyword(s):  
Time Delay ◽  
Multiagent Systems ◽  
Time Delays ◽  
Multiagent System ◽  
Experimental Simulation ◽  
Group Consensus ◽  
Consensus Protocol ◽  
Consensus Analysis ◽  
Communication Time ◽  
Nyquist Criterion

In this paper, the weighted couple-group consensus of continuous-time heterogeneous multiagent systems with input and communication time delay is investigated. A novel weighted couple-group consensus protocol based on cooperation and competition interaction is designed, which can relax the in-degree balance condition. By using graph theory, general Nyquist criterion and Gerschgorin disc theorem, the time delay upper limit that the system may allow is obtained. The conclusions indicate that there is no relationship between weighted couple-group consensus and communication time delay. When the agents input time delay, the coupling weight between the agents, and the systems control parameters are satisfied, the multiagent system can converge to any given weighted coupling group consistent state. The experimental simulation results verify the correctness of the conclusion.

Sign in / Sign up

Export Citation Format

Share Document