Designing Multi-Agent Systems from Logic Specifications

2011 ◽  
pp. 1-27
Author(s):  
Hong Lin
Keyword(s):  
Information Management ◽  
Management System ◽  
Predicate Logic ◽  
Information Management System ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
First Order ◽  
Multi Agent ◽  
Program Construction

In this chapter a program construction method based on ?-Calculus is proposed. The problem to be solved is specified by first-order predicate logic and a semantic verification program is constructed directly from the specification. We exploit this method in synthesizing the architectural specifications of multi-agent systems (MAS) in ?-Calculus based on the logic specifications of the MAS. By enabling the transformation from the logic specifications to operational specifications of MAS, this method allows the design of the MAS to be focused on the architectural definition level. It benefits the development of MAS by enabling logic deduction on behaviors of the MAS, and a design methodology in an incremental fashion. We present this method by a case study of designing a course information management system.

scholarly journals A Programming Approach to Collective Autonomy

2021 ◽  
Vol 10 (2) ◽  
pp. 27
Author(s):  
Roberto Casadei ◽  
Gianluca Aguzzi ◽  
Mirko Viroli
Keyword(s):  
Autonomous Vehicles ◽  
Autonomic Computing ◽  
Autonomous Agents ◽  
Programming Approach ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Simulated Case ◽  
Complex Settings

Research and technology developments on autonomous agents and autonomic computing promote a vision of artificial systems that are able to resiliently manage themselves and autonomously deal with issues at runtime in dynamic environments. Indeed, autonomy can be leveraged to unburden humans from mundane tasks (cf. driving and autonomous vehicles), from the risk of operating in unknown or perilous environments (cf. rescue scenarios), or to support timely decision-making in complex settings (cf. data-centre operations). Beyond the results that individual autonomous agents can carry out, a further opportunity lies in the collaboration of multiple agents or robots. Emerging macro-paradigms provide an approach to programming whole collectives towards global goals. Aggregate computing is one such paradigm, formally grounded in a calculus of computational fields enabling functional composition of collective behaviours that could be proved, under certain technical conditions, to be self-stabilising. In this work, we address the concept of collective autonomy, i.e., the form of autonomy that applies at the level of a group of individuals. As a contribution, we define an agent control architecture for aggregate multi-agent systems, discuss how the aggregate computing framework relates to both individual and collective autonomy, and show how it can be used to program collective autonomous behaviour. We exemplify the concepts through a simulated case study, and outline a research roadmap towards reliable aggregate autonomy.

scholarly journals On Consensus Index of Triplex Star-Like Networks: A Graph Spectra Approach

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1248
Author(s):  
Da Huang ◽  
Jian Zhu ◽  
Zhiyong Yu ◽  
Haijun Jiang
Keyword(s):  
Algebraic Connectivity ◽  
Multi Agent Systems ◽  
Graph Spectra ◽  
Asymptotic Behaviors ◽  
Agent Systems ◽  
First Order ◽  
Laplacian Spectra ◽  
Multi Agent ◽  
Consensus Index

In this article, the consensus-related performances of the triplex multi-agent systems with star-related structures, which can be measured by the algebraic connectivity and network coherence, have been studied by the characterization of Laplacian spectra. Some notions of graph operations are introduced to construct several triplex networks with star substructures. The methods of graph spectra are applied to derive the network coherence, and some asymptotic behaviors of the indices have been derived. It is found that the operations of adhering star topologies will make the first-order coherence increase a constant value under the triplex structures as parameters tend to infinity, and the second-order coherence have some equality relations as the node related parameters tend to infinity. Finally, the consensus related indices of the triplex systems with the same number of nodes but non-isomorphic graph structures have been compared and simulated to verify the results.

Fast Finite-Time Consensus Tracking of First-Order Multi-Agent Systems with a Virtual Leader

2014 ◽  
Vol 596 ◽  
pp. 552-559 ◽  
Author(s):  
Qiu Yun Xiao ◽  
Zhi Hai Wu ◽  
Li Peng
Keyword(s):  
Graph Theory ◽  
Finite Time ◽  
Function Method ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
First Order ◽  
Consensus Tracking ◽  
Lyapunov Function Method ◽  
Multi Agent ◽  
Virtual Leader

This paper proposes a novel finite-time consensus tracking protocol for guaranteeing first-order multi-agent systems with a virtual leader to achieve the fast finite-time consensus tracking. The Lyapunov function method, algebra graph theory, homogeneity with dilation and some other techniques are employed to prove that first-order multi-agent systems with a virtual leader applying the proposed protocol can reach the finite-time consensus tracking. Furthermore, theoretical analysis and numerical simulations show that compared with the traditional finite-time consensus tracking protocols, the proposed protocol can accelerate the convergence speed of achieving the finite-time consensus tracking.

Sign in / Sign up

Export Citation Format

Share Document