Search results for "Computer Science::Multiagent Systems"
showing 10 items of 32 documents
Non-linear protocols for optimal distributed consensus in networks of dynamic agents
2006
We consider stationary consensus protocols for networks of dynamic agents with fixed topologies. At each time instant, each agent knows only its and its neighbors'' state, but must reach consensus on a group decision value that is function of all the agents'' initial state. We show that the agents can reach consensus if the value of such a function is time-invariant when computed over the agents'' state trajectories. We use this basic result to introduce a non-linear protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents'' initial states. As a second contribution we show that our protocol design is t…
Trajectory Decentralized Fuzzy Control of Multiple UAVs.
2008
This paper considers a complete position and heading rate control system for multiple unmanned aerial vehicles (UAVs) with constant altitude. A decentralized trajectory planning algorithm is proposed, where the UAVs will avoid collisions while moving. In order to stabilize the UAVs in the reference planned trajectories and ensure the boundedness of the control velocities, a fuzzy control law is proposed with Lyapunov's stability proof. Simulation experiments developed in Matlab environment confirm the effectiveness and the robustness of the proposed control algorithm with respect to possible turbulence disturbances perturbing the nominal motion of the UAVs.
MRF Model-Based Approach for Image Segmentation Using a Chaotic MultiAgent System
2006
In this paper, we propose a new Chaotic MultiAgent System (CMAS) for image segmentation. This CMAS is a distributed system composed of a set of segmentation agents connected to a coordinator agent. Each segmentation agent performs Iterated Conditional Modes (ICM) starting from its own initial image created initially from the observed one by using a chaotic mapping. However, the coordinator agent receives and diversifies these images using a crossover and a chaotic mutation. A chaotic system is successfully used in order to benefit from the special chaotic characteristic features such as ergodic property, stochastic aspect and dependence on initialization. The efficiency of our approach is s…
MECHANISM DESIGN FOR OPTIMAL CONSENSUS PROBLEMS
2006
We consider stationary consensus protocols for networks of dynamic agents with fixed and switching topologies. At each time instant, each agent knows only its and its neighbors’ state, but must reach consensus on a group decision value that is function of all the agents’ initial state.We show that our protocol design is the solution of individual optimizations performed by the agents. This notion suggests a game theoretic interpretation of consensus problems as mechanism design problems. Under this perspective a supervisor entails the agents to reach a consensus by imposing individual objectives. We prove that such objectives can be chosen so that rational agents have a unique optimal proto…
Deciding properties of integral relational automata
1994
This paper investigates automated model checking possibilities for CTL* formulae over infinite transition systems represented by relational automata (RA). The general model checking problem for CTL* formulae over RA is shown undecidable, the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formulae.
Stock markets and quantum dynamics: A second quantized description
2009
In this paper we continue our description of stock markets in terms of some non-abelian operators which are used to describe the portfolio of the various traders and other observable quantities. After a first prototype model with only two traders, we discuss a more realistic model of market involving an arbitrary number of traders. For both models we find approximated solutions for the time evolution of the portfolio of each trader. In particular, for the more realistic model, we use the stochastic limit approach and a fixed point like approximation. © 2007 Elsevier B.V. All rights reserved
Chaotic multiagent system approach for MRF-based image segmentation
2005
In this paper, we propose a new chaotic approach for image segmentation based on multiagent system (MAS). We consider a set of segmentation agents organized around a coordinator agent. Each segmentation agent performs iterated conditional modes (ICM) starting from its own initial image created using a chaotic mapping. The coordinator agent diversifies the initial images using a crossover and a chaotic mutation operators. The efficiency of our chaotic MAS approach is shown through some experimental results.
Robust dynamic cooperative games
2009
Classical cooperative game theory is no longer a suitable tool for those situations where the values of coalitions are not known with certainty. Recent works address situations where the values of coalitions are modelled by random variables. In this work we still consider the values of coalitions as uncertain, but model them as unknown but bounded disturbances. We do not focus on solving a specific game, but rather consider a family of games described by a polyhedron: each point in the polyhedron is a vector of coalitions’ values and corresponds to a specific game. We consider a dynamic context where while we know with certainty the average value of each coalition on the long run, at each t…
Distributed Consensus for Discrete-Time Directed Networks of Multiagents with Time-Delays and Random Communication Links
2013
Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2013/158731 Open Access This paper is concerned with the leader-following consensus problem in mean-square for a class of discrete-time multiagent systems. The multiagent systems under consideration are the directed and contain arbitrary discrete time-delays. The communication links are assumed to be time-varying and stochastic. It is also assumed that some agents in the network are well informed and act as leaders, and the others are followers. By introducing novel Lyapunov functionals and employing some new analytical techniques, sufficient conditi…
Energy Efficient Optimization for Solar-Powered UAV Communications System
2021
In this work, we explore the energy efficiency optimization for a solar-powered unmanned aerial vehicle (UAV) communications system. We consider a scenario where a number of ground users (GUs) connect with a solar-powered multi-antenna UAV over a wireless link. First, we are able to derive the relations between the uplink data rate and heading angle of UAV and transmission power of GUs. In addition, the harvested energy from solar light is also affected by UAV’s angle. Accordingly, with the objective to maximize the energy efficiency that is related to uplink data rate and energy consumption, we propose to dynamically adjust the UAV trajectory and gesture, by optimizing its velocity, accele…