Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Optimal Design of Observable Multi-Agent Networks: A Structural System Approach
Publication

Publications

Optimal Design of Observable Multi-Agent Networks: A Structural System Approach

Title
Optimal Design of Observable Multi-Agent Networks: A Structural System Approach
Type
Article in International Conference Proceedings Book
Year
2014
Authors
Sergio Pequito
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Francisco Rego
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Soummya Kar
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Antonio Pascoal
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Colin Jones
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Conference proceedings International
Pages: 1536-1541
13th European Control Conference (ECC)
Strasbourg, FRANCE, JUN 24-27, 2014
Other information
Authenticus ID: P-009-YY8
Abstract (EN): This paper introduces a method to design observable directed multi-agent networks, that are: 1) either minimal with respect to a communications-related cost function, or 2) idem, under possible failure of direct communication between two agents. An observable multi-agent network is characterized by agents that update their states using a neighboring rule based on directed communication graph topology in order to share information about their states; furthermore, each agent can infer the initial information shared by all the agents. Sufficient conditions to ensure that 1) is satisfied are obtained by reducing the original problem to the travelling salesman problem (TSP). For the case described in 2), sufficient conditions for the existence of a minimal network are shown to be equivalent to the existence of two disjoint solutions to the TSP. The results obtained are illustrated with an example from the area of cooperative path following of multiple networked vehicles by resorting to an approximate solution to the TSP.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 6
Documents
We could not find any documents associated to the publication.
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-19 at 21:16:11 | Privacy Policy | Personal Data Protection Policy | Whistleblowing