arXiv subjects

Eloy Garcia

Publications and source records attributed to Eloy Garcia.

21 records · Page 2Linked to original sources

arXiv2015

Decentralized Event-Triggered Consensus of Linear Multi-agent Systems under Directed Graphs

An event-triggered control technique for consensus of multi-agent systems with general linear dynamics is presented. This paper extends previous work to consider agents that are connected using directed graphs. Additionally, the approach shown here provides asymptotic consensus with guaranteed positive inter-event time intervals. This event-triggered control method is also used in the case where communication delays are present. For the communication delay case we also show that the agents achieve consensus asymptotically and that, for every agent, the time intervals between consecutive transmissions is lower-bounded by a positive constant.

math.OC↗

arXiv2015

Active Target Defense Differential Game with a Fast Defender

This paper addresses the active target defense differential game where an Attacker missile pursues a Target aircraft. A Defender missile is fired by the Target's wingman in order to intercept the Attacker before it reaches the aircraft. Thus, a team is formed by the Target and the Defender which cooperate to maximize the distance between the Target aircraft and the point where the Attacker missile is intercepted by the Defender missile, while the Attacker tries to minimize said distance. The results shown here extend previous work. We consider here the case where the Defender is faster than the Attacker. The solution to this differential game provides optimal heading angles for the Target and the Defender team to maximize the terminal separation between Target and Attacker and it also provides the optimal heading angle for the Attacker to minimize the said distance.

math.OC↗

arXiv2015

Bridge Consensus: Ignoring Initial Inessentials

In this paper, the problem of bridge consensus is presented and solved. Bridge consensus consists of a network of nodes, some of whom are participating and others are non-participating. The objective is for all the agents to reach average consensus of the participating nodes initial values in a distributed and scalable manner. To do this, the nodes must use the network connections of the non-participating nodes, which act as bridges for information and ignore the initial values of the non-participating nodes. The solution to this problem is made by merging the ideas from estimation theory and consensus theory. By considering the participating nodes has having equal information and the non-participating nodes as having no information, the nodes initial values are transformed into information space. Two consensus filters are run in parallel on the information state and information matrix. Conditions ensuring that the product of the inverse information matrix and the information state of each agent reaches average consensus of the participating agents' initial values is given.

eess.SY↗