Page 1

Displaying 1 – 9 of 9

Showing per page

A belief revision approach for argumentation-based negotiation agents

Pablo Pilotti, Ana Casali, Carlos Chesñevar (2015)

International Journal of Applied Mathematics and Computer Science

Negotiation is an interaction that happens in multi-agent systems when agents have conflicting objectives and must look for an acceptable agreement. A typical negotiating situation involves two agents that cannot reach their goals by themselves because they do not have some resources they need or they do not know how to use them to reach their goals. Therefore, they must start a negotiation dialogue, taking also into account that they might have incomplete or wrong beliefs about the other agent's...

A generalization of the graph Laplacian with application to a distributed consensus algorithm

Guisheng Zhai (2015)

International Journal of Applied Mathematics and Computer Science

In order to describe the interconnection among agents with multi-dimensional states, we generalize the notion of a graph Laplacian by extending the adjacency weights (or weighted interconnection coefficients) from scalars to matrices. More precisely, we use positive definite matrices to denote full multi-dimensional interconnections, while using nonnegative definite matrices to denote partial multi-dimensional interconnections. We prove that the generalized graph Laplacian inherits the spectral...

A matrix inequality based design method for consensus problems in multi-agent systems

Shohei Okuno, Joe Imae, Tomoaki Kobayashi (2009)

International Journal of Applied Mathematics and Computer Science

In this paper, we study a consensus problem in multi-agent systems, where the entire system is decentralized in the sense that each agent can only obtain information (states or outputs) from its neighbor agents. The existing design methods found in the literature are mostly based on a graph Laplacian of the graph which describes the interconnection structure among the agents, and such methods cannot deal with complicated control specification. For this purpose, we propose to reduce the consensus...

A new Nyquist-based technique for tuning robust decentralized controllers

Alena Kozáková, Vojtech Veselý, Jakub Osuský (2009)

Kybernetika

An original Nyquist-based frequency domain robust decentralized controller (DC) design technique for robust stability and guaranteed nominal performance is proposed, applicable for continuous-time uncertain systems described by a set of transfer function matrices. To provide nominal performance, interactions are included in individual design using one selected characteristic locus of the interaction matrix, used to reshape frequency responses of decoupled subsystems; such modified subsystems are...

A situation-based multi-agent architecture for handling misunderstandings in interactions

Thao Phuong Pham, Mourad Rabah, Pascal Estraillier (2015)

International Journal of Applied Mathematics and Computer Science

During interactions, system actors may face up misunderstandings when their local states contain inconsistent data about the same fact. Misunderstandings in interactions are likely to reduce interactivity performances (deviation or deadlock) or even affect overall system behavior. In this paper, we characterize misunderstandings in interactions between system actors (that may be human users or system agents) in interactive adaptive systems. To deal with such misunderstandings and ensure state consistency,...

A stochastic mirror-descent algorithm for solving A X B = C over an multi-agent system

Yinghui Wang, Songsong Cheng (2021)

Kybernetika

In this paper, we consider a distributed stochastic computation of A X B = C with local set constraints over an multi-agent system, where each agent over the network only knows a few rows or columns of matrixes. Through formulating an equivalent distributed optimization problem for seeking least-squares solutions of A X B = C , we propose a distributed stochastic mirror-descent algorithm for solving the equivalent distributed problem. Then, we provide the sublinear convergence of the proposed algorithm. Moreover,...

A study on decentralized H feedback control systems with local quantizers

Guisheng Zhai, Ning Chen, Weihua Gui (2009)

Kybernetika

In this paper, we study decentralized H feedback control systems with quantized signals in local input-output (control) channels. We first assume that a decentralized output feedback controller has been designed for a multi-channel continuous-time system so that the closed-loop system is Hurwitz stable and a desired H disturbance attenuation level is achieved. However, since the local measurement outputs are quantized by a general quantizer before they are passed to the controller, the system’s...

An autonomous vehicle sequencing problem at intersections: A genetic algorithm approach

Fei Yan, Mahjoub Dridi, Abdellah El Moudni (2013)

International Journal of Applied Mathematics and Computer Science

This paper addresses a vehicle sequencing problem for adjacent intersections under the framework of Autonomous Intersection Management (AIM). In the context of AIM, autonomous vehicles are considered to be independent individuals and the traffic control aims at deciding on an efficient vehicle passing sequence. Since there are considerable vehicle passing combinations, how to find an efficient vehicle passing sequence in a short time becomes a big challenge, especially for more than one intersection....

Currently displaying 1 – 9 of 9

Page 1