scholarly journals Flocking for Multiagent Systems with Partial Information Exchange Based on Inclusion Principle

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Hui Wei ◽  
Xuebo Chen

This paper investigates the flocking problem of multi-agents with partial information exchange, which means that only part, but not all, of the agents are informed of the group objective. A distributed flocking model based on the inclusion principle is provided to simplify the design and analysis of multi-agent systems. Furthermore, to reduce the communication energy consumption, an improved flocking algorithm based on the model is proposed to achieve stable flocking for all the agents. The stability of the multi-agent system is then established, with the help of the Lyapunov stability theorem and LaSalle’s invariance principle. Especially, considering the individual heterogeneity in both nature and engineering applications, we also investigate the flocking problem of multi-agents with different sensing radiuses and equilibrium distances. Finally, two kinds of simulation results are presented to demonstrate the validity of the proposed results. This work provides an insight not only into the properties of the different species of individual flocking, but also into the theoretical framework for the engineering design of multi-agent systems considering individual heterogeneity.

2021 ◽  
Vol 69 (12) ◽  
pp. 1026-1039
Author(s):  
Birgit Vogel-Heuser ◽  
Felix Ocker ◽  
Tobias Scheuer

Abstract To cope with individualization and the high costs of downtimes, modern production systems should be flexible, adaptable, and resilient. Multi-Agent Systems are suitable to address these requirements by decentralizing production systems. However, the agent paradigm is still not widely applied. One of the key reasons is that the agents’ knowledge bases had to be created manually, which is cumbersome, error-prone, and insufficiently standardized. Digital Twins have the potential to solve this issue, as they describe relevant information in a standardized way. This paper presents an approach to leveraging Digital Twins, i. e., the Asset Administration Shell, to realize Multi-Agent Systems in the production context. For this, a parser automatically extracts relevant information from the Digital Twins and initializes the individual agents in a Multi-Agent System, i. e., PADE.


2013 ◽  
Vol 278-280 ◽  
pp. 1687-1691
Author(s):  
Tong Qiang Jiang ◽  
Jia Wei He ◽  
Yan Ping Gao

The consensus problems of two situations for singular multi-agent systems with fixed topology are discussed: directed graph without spanning tree and the disconnected undirected graph. A sufficient and necessary condition is obtained by applying the stability theory and the system is reachable asymptotically. But for normal systems, this can’t occur in upper two situations. Finally a simulation example is provided to verify the effectiveness of our theoretical result.


2015 ◽  
Vol 713-715 ◽  
pp. 2106-2109
Author(s):  
Mauricio Mauledoux ◽  
Edilberto Mejía-Ruda ◽  
Oscar I. Caldas

The work is devoted to solve allocation task problem in multi agents systems using multi-objective genetic algorithms and comparing the technique with methods used in game theories. The paper shows the main advantages of genetic algorithms and the way to apply a parallel approach dividing the population in sub-populations saving time in the search and expanding the coverage of the solution in the Pareto optimal space.


Author(s):  
Robert E. Smith ◽  
Claudio Bonacina

In the multi-agent system (MAS) context, the theories and practices of evolutionary computation (EC) have new implications, particularly with regard to engineering and shaping system behaviors. Thus, it is important that we consider the embodiment of EC in “real” agents, that is, agents that involve the real restrictions of time and space within MASs. In this chapter, we address these issues in three ways. First, we relate the foundations of EC theory to MAS and consider how general interactions among agents fit within this theory. Second, we introduce a platform independent agent system to assure that our EC methods work within the generic, but realistic, constraints of agents. Finally, we introduce an agent-based system of EC objects. Concluding sections discuss implications and future directions.


Author(s):  
Anet Potgieter ◽  
Judith Bishop

Most agent architectures implement autonomous agents that use extensive interaction protocols and social laws to control interactions in order to ensure that the correct behaviors result during run-time. These agents, organized into multi-agent systems in which all agents adhere to predefined interaction protocols, are well suited to the analysis, design and implementation of complex systems in environments where it is possible to predict interactions during the analysis and design phases. In these multi-agent systems, intelligence resides in individual autonomous agents, rather than in the collective behavior of the individual agents. These agents are commonly referred to as “next-generation” or intelligent components, which are difficult to implement using current component-based architectures. In most distributed environments, such as the Internet, it is not possible to predict interactions during analysis and design. For a complex system to be able to adapt in such an uncertain and non-deterministic environment, we propose the use of agencies, consisting of simple agents, which use probabilistic reasoning to adapt to their environment. Our agents collectively implement distributed Bayesian networks, used by the agencies to control behaviors in response to environmental states. Each agency is responsible for one or more behaviors, and the agencies are structured into heterarchies according to the topology of the underlying Bayesian networks. We refer to our agents and agencies as “Bayesian agents” and “Bayesian agencies.”


2015 ◽  
Vol 237 ◽  
pp. 183-188
Author(s):  
Mirosław Mrozek

Multi-agent systems are used mainly in IT solutions and control groups of robots. From the point of view of classical control architectures, they are a kind of distributed systems in which nodes perform advanced algorithms, usually associated with the technology of artificial intelligence, and they can be considered as agents. The article describes the multi-agents control system of objects of uniaxial movements. An example of such a system to control a repository with movable racks with electric motors is presented. Each rack acts as an agent through the implemented control of the resources of embedded microcontrollers. Such a system provides high quality control, guaranteeing long-lasting, trouble-free operation while maintaining the safety of both service and stored items.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-6 ◽  
Author(s):  
Zhengquan Yang ◽  
Qing Zhang ◽  
Zengqiang Chen

In this paper, the formation problem for multi-agent systems with region constraint is studied while few researchers consider this problem. The goal is to control all multi-agents to enter the constraint area while reaching formation. Each agent is constrained by a common convex set. A formation control law is presented based on local information of the neighborhood. It is proved that the positions of all the agents would converge to the set constraint while reaching formation. Finally, two numerical examples are presented to illustrate the validity of the theoretical results.


Sensors ◽  
2020 ◽  
Vol 20 (14) ◽  
pp. 3940
Author(s):  
Vankamamidi S. Naresh ◽  
Moustafa M. Nasralla ◽  
Sivaranjani Reddi ◽  
Iván García-Magariño

Multi-Agent Systems can support e-Healthcare applications for improving quality of life of citizens. In this direction, we propose a healthcare system architecture named smart healthcare city. First, we divide a given city into various zones and then we propose a zonal level three-layered system architecture. Further, for effectiveness we introduce a Multi-Agent System (MAS) in this three-layered architecture. Protecting sensitive health information of citizens is a major security concern. Group key agreement (GKA) is the corner stone for securely sharing the healthcare data among the healthcare stakeholders of the city. For establishing GKA, many efficient cryptosystems are available in the classical field. However, they are yet dependent on the supposition that some computational problems are infeasible. In light of quantum mechanics, a new field emerges to share a secret key among two or more members. The unbreakable and highly secure features of key agreement based on fundamental laws of physics allow us to propose a Quantum GKA (QGKA) technique based on renowned Quantum Diffie–Hellman (QDH). In this, a node acts as a Group Controller (GC) and forms 2-party groups with remaining nodes, establishing a QDH-style shared key per each two-party. It then joins these keys into a single group key by means of a XOR-operation, acting as a usual group node. Furthermore, we extend the QGKA to Dynamic QGKA (DQGKA) by adding join and leave protocol. Our protocol performance was compared with existing QGKA protocols in terms of Qubit efficiency (QE), unitary operation (UO), unitary operation efficiency (UOE), key consistency check (KCC), security against participants attack (SAP) and satisfactory results were obtained. The security analysis of the proposed technique is based on unconditional security of QDH. Moreover, it is secured against internal and external attack. In this way, e-healthcare Multi-Agent System can be robust against future quantum-based attacks.


Sign in / Sign up

Export Citation Format

Share Document