scholarly journals Modeling and Simulation of Complex Network Attributes on Coordinating Large Multiagent System

2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Yang Xu ◽  
Xiang Li ◽  
Ming Liu
Keyword(s):  
Complex Network ◽  
Multiagent Systems ◽  
Decision Problem ◽  
Multiagent System ◽  
Algorithm Design ◽  
Distributed Agents ◽  
Coordination Strategies ◽  
Coordination Strategy ◽  
Significant Difference ◽  
Present Simulation

With the expansion of distributed multiagent systems, traditional coordination strategy becomes a severe bottleneck when the system scales up to hundreds of agents. The key challenge is that in typical large multiagent systems, sparsely distributed agents can only communicate directly with very few others and the network is typically modeled as an adaptive complex network. In this paper, we present simulation testbedCoordSimbuilt to model the coordination of network centric multiagent systems. Based on the token-based strategy, the coordination can be built as a communication decision problem that agents make decisions to target communications and pass them over to the capable agents who will potentially benefit the team most. We have theoretically analyzed that the characters of complex network make a significant difference with both random and intelligent coordination strategies, which may contribute to future multiagent algorithm design.

scholarly journals Discovering the Influences of Complex Network Effects on Recovering Large Scale Multiagent Systems

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Yang Xu ◽  
Pengfei Liu ◽  
Xiang Li ◽  
Wei Ren
Keyword(s):  
Complex Network ◽  
Multiagent Systems ◽  
Network Topology ◽  
System Performance ◽  
Large Scale ◽  
Network Effects ◽  
Multiagent System ◽  
Distributed Coordination ◽  
Key Factor ◽  
Network Topologies

Building efficient distributed coordination algorithms is critical for the large scale multiagent system design, and the communication network has been shown as a key factor to influence system performance even under the same coordination protocol. Although many distributed algorithm designs have been proved to be feasible to build their functions in the large scale multiagent systems as claimed, the performances may not be stable if the multiagent networks were organized with different complex network topologies. For example, if the network was recovered from the broken links or disfunction nodes, the network topology might have been shifted. Therefore, their influences on the overall multiagent system performance are unknown. In this paper, we have made an initial effort to find how a standard network recovery policy, MPLS algorithm, may change the network topology of the multiagent system in terms of network congestion. We have established that when the multiagent system is organized as different network topologies according to different complex network attributes, the network shifts in different ways. Those interesting discoveries are helpful to predict how complex network attributes influence on system performance and in turn are useful for new algorithm designs that make a good use of those attributes.

scholarly journals Eigenvalue Based Approach for Global Consensus in Multiagent Systems with Nonlinear Dynamics

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Wei Qian ◽  
Lei Wang
Keyword(s):  
Nonlinear Dynamics ◽  
Multiagent Systems ◽  
Multiagent System ◽  
Symmetric Matrix ◽  
Algebraic Connectivity ◽  
Communication Graph ◽  
Consensus Protocol ◽  
Global Consensus ◽  
The Common ◽  
Analytical Result

This paper addresses the global consensus of nonlinear multiagent systems with asymmetrically coupled identical agents. By employing a Lyapunov function and graph theory, a sufficient condition is presented for the global exponential consensus of the multiagent system. The analytical result shows that, for a weakly connected communication graph, the algebraic connectivity of a redefined symmetric matrix associated with the directed graph is used to evaluate the global consensus of the multiagent system with nonlinear dynamics under the common linear consensus protocol. The presented condition is quite simple and easily verified, which can be effectively used to design consensus protocols of various weighted and directed communications. A numerical simulation is also given to show the effectiveness of the analytical result.

scholarly journals MULTIAGENT SYSTEM OF FORECASTING OF CHAOTIC PROCESSES ON THE BASIS OF STATISTICAL EXTRAPOLATORS

2021 ◽  
Vol 56 ◽  
pp. 65-71
Author(s):  
Alexander A. Musaev ◽  
◽  
Andrey V. Gaikov ◽  
Keyword(s):  
Multiagent Systems ◽  
Chaotic System ◽  
Multiagent System ◽  
Intelligent Agent ◽  
System Component ◽  
Stationary Processes ◽  
Retrospective Data ◽  
System State ◽  
Generation Algorithm

The problem of the of a non-stationary system state predicting is considered. The decision based on the joint processing of the results obtained by a group of independent statistical extrapolators. In the terminology of multiagent systems, each extrapolator is an intelligent agent. The quality of the agent solutions is evaluated on retrospective data and is used as weight characteristic in the problem of a terminal solution estimation. The specificity of non-stationary processes with a chaotic system component leads to the empiricca version of the forecast generation algorithm

On Using Multiagent Systems for Spectrum Sharing in Cognitive Radios Networks

2011 ◽  
pp. 377-415 ◽  
Author(s):  
Usama Mir ◽  
Leila Merghem-Boulahia ◽  
Dominique Gaïti
Keyword(s):  
Multiagent Systems ◽  
Spectrum Sharing ◽  
Multiagent System ◽  
Cognitive Radios ◽  
Dynamic Spectrum ◽  
Spectrum Allocation ◽  
Wireless Devices ◽  
Spectrum Utilization ◽  
Dynamic Spectrum Sharing ◽  
Theoretical Approaches

In modern day wireless networks, spectrum utilization and allocation are static. Generally, static spectrum allocation is not a feasible solution considering the distributed nature of wireless devices, thus some alternatives must be ensured in order to allocate spectrum dynamically and to mitigate the current spectrum scarcity. An effective solution to this problem is cognitive radio (CR), which seeks the empty spectrum portions and shares them with the neighboring devices. The CR devices can utilize the available spectrum more efficiently if they try to work together. Therefore, in this work, we review a number of dynamic spectrum allocation techniques, especially those using multiagent systems and game-theoretical approaches, and investigate their applicability to CR networks. The distributed nature of these two domains makes them suitable for CR networks. In fact, the idea of dynamic spectrum sharing using these techniques is not entirely new and several interesting approaches already exist in literature. Thus, in our study we try to focus on existing spectrum sharing literature and cooperative multiagent system for CR networks. We are particularly interested in showing how the distributed nature of multiagent system can be combined with cognitive radios in order to alleviate the current static spectrum usage as well as maintaining cooperation amongst the CR nodes. Moreover, our work includes the description of various scenarios in which spectrum sharing is an essential factor and hence must be performed in a dynamic and opportunistic manner. We also explain the working of our proposed spectrum allocation approach using multiagent system cooperation in one of these scenarios and verify its formal behavior using Petri net modeling.

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 Consensus Analysis of High-Order Multiagent Systems with General Topology and Asymmetric Time-Delays

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Fangcui Jiang
Keyword(s):  
Multiagent Systems ◽  
Network Topology ◽  
Time Delays ◽  
Multiagent System ◽  
High Order ◽  
Directed Network ◽  
Time Varying ◽  
Consensus Analysis ◽  
Robust Consensus ◽  
Selection Of

This paper focuses on the consensus problem for high-order multiagent systems (MAS) with directed network and asymmetric time-varying time-delays. It is proved that the high-order multiagent system can reach consensus when the network topology contains a spanning tree and time-delay is bounded. The main contribution of this paper is that a Lyapunov-like design framework for the explicit selection of protocol parameters is provided. The Lyapunov-like design guarantees the robust consensus of the high-order multiagent system with respect to asymmetric time-delays and is independent of the exact knowledge of the topology when the communication linkages among agents are undirected and connected.

scholarly journals Second-Order Consensus in Multiagent Systems via Nonlinear Protocol

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Huan Pan ◽  
Xiaohong Nian ◽  
Ling Guo
Keyword(s):  
Theoretical Analysis ◽  
Multiagent Systems ◽  
Invariance Principle ◽  
Lyapunov Functions ◽  
Multiagent System ◽  
Second Order ◽  
General Linear ◽  
Reference Velocity ◽  
Communication Topology ◽  
Lasalle's Invariance Principle

This paper focuses on theoretical analysis of second-order consensus in multiagent system. As an extension of the general linear protocol, a nonlinear protocol is designed for multiagent system with undirected communication topology. The nonlinear protocol is also applied to achieve reference velocity consensus. Through choosing the appropriate Lyapunov functions and using LaSalle’s invariance principle, some consensus conditions are derived. Simulation examples are provided to demonstrate the effectiveness of the proposed results.

scholarly journals Consensus Congestion Control in Multirouter Networks Based on Multiagent System

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Xinhao Yang ◽  
Sheng Xu ◽  
Ze Li
Keyword(s):  
Congestion Control ◽  
Multiagent Systems ◽  
Traffic Congestion ◽  
Multiagent System ◽  
The Internet ◽  
Network Congestion ◽  
Network Resources ◽  
Simulation Results ◽  
Systems Simulation

Due to the unbalance distribution of network resources and network traffic, congestion is an inherent property of the Internet. The consensus congestion controller based on the multiagent system theory is designed for the multirouter topology, which improves the performance of the whole networks. Based on the analysis of the causes of congestion, the topology of multirouter networks is modeled based on the graph theory and the network congestion control problem is described as a consensus problem in multiagent systems. Simulation results by MATLAB and Ns2 indicate that the proposed algorithm maintains a high throughput and a low packet drip ratio and improves the quality of the service in the complex network environment.

scholarly journals On Computational Tractability for Rational Verification

2019 ◽  
Author(s):  
Julian Gutierrez ◽  
Muhammad Najib ◽  
Giuseppe Perelli ◽  
Michael Wooldridge
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Multiagent Systems ◽  
Polynomial Time ◽  
Multiagent System ◽  
Reactive Systems ◽  
State System ◽  
Polynomial Space ◽  
Game Theoretic ◽  
Mean Payoff

Rational verification involves checking which temporal logic properties hold of a concurrent and multiagent system, under the assumption that agents in the system choose strategies in game theoretic equilibrium. Rational verification can be understood as a counterpart of model checking for multiagent systems, but while model checking can be done in polynomial time for some temporal logic specification languages such as CTL, and polynomial space with LTL specifications, rational verification is much more intractable: it is 2EXPTIME-complete with LTL specifications, even when using explicit-state system representations.  In this paper we show that the complexity of rational verification can be greatly reduced by restricting specifications to GR(1), a fragment of LTL that can represent most response properties of reactive systems. We also provide improved complexity results for rational verification when considering players' goals given by mean-payoff utility functions -- arguably the most widely used quantitative objective for agents in concurrent and multiagent systems. In particular, we show that for a number of relevant settings, rational verification can be done in polynomial space or even in polynomial time.

Sign in / Sign up

Export Citation Format

Share Document