The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1 Next

Displaying 1 – 20 of 69

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....

Complementary matrices in the inclusion principle for dynamic controllers

Lubomír Bakule, José Rodellar, Josep M. Rossell (2003)

Kybernetika

A generalized structure of complementary matrices involved in the input-state- output Inclusion Principle for linear time-invariant systems (LTI) including contractibility conditions for static state feedback controllers is well known. In this paper, it is shown how to further extend this structure in a systematic way when considering contractibility of dynamic controllers. Necessary and sufficient conditions for contractibility are proved in terms of both unstructured and block structured complementary...

Consensus and trajectory tracking of SISO linear multi-agent systems under switching communication topologies and formation changes

Carlos López-Limón, Javier Ruiz, Alejandro Cervantes-Herrera, Antonio Ramírez-Treviño (2013)

Kybernetika

The simultaneous problem of consensus and trajectory tracking of linear multi-agent systems is considered in this paper, where the dynamics of each agent is represented by a single-input single-output linear system. In order to solve this problem, a distributed control strategy is proposed in this work, where the trajectory and the formation of the agents are achieved asymptotically even in the presence of switching communication topologies and smooth formation changes, and ensuring the closed-loop...

Consensus of a multi-agent systems with heterogeneous delays

Branislav Rehák, Volodymyr Lynnyk (2020)

Kybernetika

The paper presents an algorithm for the solution of the consensus problem of a linear multi-agent system composed of identical agents. The control of the agents is delayed, however, these delays are, in general, not equal in all agents. The control algorithm design is based on the H -control, the results are formulated by means of linear matrix inequalities. The dimension of the resulting convex optimization problem is proportional to the dimension of one agent only but does not depend on the number...

Consensus seeking in multi-agent systems with an active leader and communication delays

Lixin Gao, Yutao Tang, Wenhai Chen, Hui Zhang (2011)

Kybernetika

In this paper, we consider a multi-agent consensus problem with an active leader and variable interconnection topology. The dynamics of the active leader is given in a general form of linear system. The switching interconnection topology with communication delay among the agents is taken into consideration. A neighbor-based estimator is designed for each agent to obtain the unmeasurable state variables of the dynamic leader, and then a distributed feedback control law is developed to achieve consensus....

Consensus seeking of delayed high-order multi-agent systems with predictor-based algorithm

Cheng-Lin Liu, Fei Liu (2018)

Kybernetika

This paper investigates the high-order consensus problem for the multi-agent systems with agent's dynamics described by high-order integrator, and adopts a general consensus algorithm composed of the states' coordination control. Under communication delay, consensus algorithm in usual asynchronously-coupled form just can make the agents achieve a stationary consensus, and sufficient consensus condition is obtained based on frequency-domain analysis. Besides, a predictor-based consensus algorithm...

Cooperative driving at isolated intersections based on the optimal minimization of the maximum exit time

Jia Wu, Abdeljalil Abbas-Turki, Florent Perronnet (2013)

International Journal of Applied Mathematics and Computer Science

Traditional traffic control systems based on traffic light have achieved a great success in reducing the average delay of vehicles or in improving the traffic capacity. The main idea of these systems is based on the optimization of the cycle time, the phase sequence, and the phase duration. The right-of-ways are assigned to vehicles of one or several movements for a specific time. With the emergence of cooperative driving, an innovative traffic control concept, Autonomous Intersection Management...

Customized crossover in evolutionary sets of safe ship trajectories

Rafał Szłapczyński, Joanna Szłapczyńska (2012)

International Journal of Applied Mathematics and Computer Science

The paper presents selected aspects of evolutionary sets of safe ship trajectories-a method which applies evolutionary algorithms and some of the assumptions of game theory to solving ship encounter situations. For given positions and motion parameters of the ships, the method finds a near optimal set of safe trajectories of all ships involved in an encounter. The method works in real time and the solutions must be returned within one minute, which enforces speeding up the optimisation process....

Decentralized control and synchronization of time-varying complex dynamical network

Wei-Song Zhong, Jovan D. Stefanovski, Georgi M. Dimirovski, Jun Zhao (2009)

Kybernetika

A new class of controlled time-varying complex dynamical networks with similarity is investigated and a decentralized holographic-structure controller is designed to stabilize the network asymptotically at its equilibrium states. The control design is based on the similarity assumption for isolated node dynamics and the topological structure of the overall network. Network synchronization problems, both locally and globally, are considered on the ground of decentralized control approach. Each sub-controller...

Decentralized control for large-scale systems with time-varying delay and unmatched uncertainties

Wen-Jeng Liu (2011)

Kybernetika

Many real-world systems contain uncertainties and with time-varying delays, also, they have become larger and more complicated. Hence, a new decentralized variable structure control law is proposed for a class of uncertain large-scale system with time varying delay in the interconnection and time varying unmatched uncertainties in the state matrix. The proposed decentralized control law for the large-scale time-varying delay system is realized independently through the delayed terms and it can drive...

Currently displaying 1 – 20 of 69

Page 1 Next