Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 7
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Capítulo o parte de un libro (BookPart)

Automatic deployment of a consensus networks MAS

  • Gómez ., Yolanda
  • Palomares Chust, Alberto|||0000-0002-4583-467X
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
The main goal of the work here presented is the easy deployment in real multi-agent systems of consensus processes. MAGENTIX2 agent platform has been used to implement real agents that follow the consensus algorithm to reach agreements., This work is supported by TIN2012-36586-C03-01 and PROMETEO/2008/051 projects of the Spanish government, CONSOLIDER-INGENIO 2010 under grant CSD2007-00022, and PAID-06-11-2084
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On some properties of the Laplacian matrix revealed by the RCM algorithm

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Palomares Chust, Alberto|||0000-0002-4583-467X
In this paper we present some theoretical results about the irreducibility of the Laplacian matrix ordered by the Reverse Cuthill-McKee (RCM) algorithm. We consider undirected graphs with no loops consisting of some connected components. RCM is a well-known scheme for numbering the nodes of a network in such a way that the corresponding adjacency matrix has a narrow bandwidth. Inspired by some properties of the eigenvectors of a Laplacian matrix, we derive some properties based on row sums of a Laplacian matrix that was reordered by the RCM algorithm. One of the theoretical results serves as a basis for writing an easy MATLAB code to detect connected components, by using the function “symrcm” of MATLAB. Some examples illustrate the theoretical results., The research has been supported by Spanish DGI grant MTM2010-18674, Consolider Ingenio CSD2007-00022, PROMETEO 2008/051, OVAMAH TIN2009-13839-C03-01, and PAID-06-11-2084.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Some examples of detection of connected components in undirected graphs by using the Laplacian matrix and the RCM algorithm

  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Palomares Chust, Alberto|||0000-0002-4583-467X
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
[EN] In this paper we use the recent method L-RCM, developed by the authors, to detect connected components in undirected graphs. The method uses the ordering RCM as a rst step and the computation of the row sums of the Laplacian matrix as a second step. We make the computations in MATLAB. We show the use of the method in three examples., This work is supported by Spanish DGI grant MTM2010-18674, Consolider Ingenio CSD2007-00022, PROMETEO 2008/051, OVAMAH TIN2009-13839-C03-01, and PAID-06-11-2084.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Convergence of Weighted-average consensus for undirected graphs

  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Palomares Chust, Alberto|||0000-0002-4583-467X
[EN] In this note we address the problem of reaching a consensus in an undirected network where the nodes interchange information with their neighbors. Each node is provided with a value X_i and a weight w_i. The specific goal of the consensus is that each node will be aware of the weighted-average consensus value, in a distributed way, that is to say without a central control. We show the applicability of a theoretical result about reaching a consensus following an iterative algorithm., This work is supported by Spanish DGI grant MTM2010-18674, Consolider Ingenio CSD2007-00022, PROMETEO 2008/051, OVAMAH TIN2009-13839-C03-01, and PAID-06-11-2084.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Towards building Agreement Spaces using consensus networks

  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Palomares Chust, Alberto|||0000-0002-4583-467X
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
[EN] If a set of agents tries to reach an agreement, there will be an Agreement Space that models the maximum valid space based on the individual constraints of each agent regarding the terms of the agreement. This paper presents a possible distributed solution using a consensus algorithm. This algorithm is applied to the MAS acquaintances network to build an Agreement Space, which allows us to determine whether or not an agreement can be achieved., This work is supported by CONSOLIDER-INGENIO 2010 under Grant CSD2007-00022 and TIN2012-36586-C03-01, PROMETEOII/2013/019 and PAID-06-11-2084 projects.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Implementing MAS agreement processes based on consensus networks

  • Palomares Chust, Alberto|||0000-0002-4583-467X
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Gómez, Yolanda
[EN] Consensus is a negotiation process where agents need to agree upon certain quantities of interest. The theoretical framework for solving consensus problems in dynamic networks of agents was formally introduced by Olfati-Saber and Murray, and is based on algebraic graph theory, matrix theory and control theory. Consensus problems are usually simulated using mathematical frameworks. However, implementation using multi-agent system platforms is a very difficult task due to problems such as synchronization, distributed finalization, and monitorization among others. The aim of this paper is to propose a protocol for the consensus agreement process in MAS in order to check the correctness of the algorithm and validate the protocol. © Springer International Publishing Switzerland 2013., This work is supported by ww and PROMETEO/2008/051 projects of the Spanish government, CONSOLIDER-INGENIO 2010 under grant CSD2007-00022, TIN2012-36586-C03-01 and PAID-06-11-2084.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Consensus over Multiplex Network To Calculate User Influence in Social Networks

  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
  • Del Val Noguera, Elena|||0000-0002-1279-3429
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Palomares Chust, Alberto|||0000-0002-4583-467X
  • Pedroche Sánchez, Francisco|||0000-0001-6521-4331
[EN] User influence determines how the information is transmitted. Most of the current methods need to consider the complete network and, if it changes, the calculations have to be repeated from the scratch. This work proposes the use of a consensus algorithm to calculate the influence of the participants in a social event through their interactions in Twitter. Retweets, mentions and replies and considered and represented in a multiplex network. The algorithm determines the influence of the users using only local knowledge, This work is supported by Spanish DGI grant MTM2010-18674, Consolider Ingenio CSD2007-00022, PROMETEO 2008/051, MINECO/FEDER grant TIN2012-36586-C03-01, and PAID-06-11-2084.