Information broadcasting algorithm for Finite-Time Reaching-at-Risk Consensus with application to weapon-target assignment

Léchevin, N.; Rabbath, C.A.; Zhang, Youmin

doi:10.1109/acc.2009.5159831

Cited by 4 publications

(6 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A detailed presentation of the high-level DM is available in reference [1], where it is shown that a parallel version of the cross-entropy method can solve moderately complex multirouting-type, multiformation-target assignment problems with relatively short processing times. To compute new lists of targets whenever the evolution of the operation theatre is deemed significant enough, the algorithm is distributed among the formations, which share information through a communication network [2]. From Fig.…”

Section: Hierarchical Decision Makingmentioning

confidence: 99%

See 1 more Smart Citation

A hierarchical decision and information system for multi-aircraft combat missions

Léchevin

Rabbath

2010

Proceedings of the Institution of Mechanical Engineers, Part G:

View full text Add to dashboard Cite

Designing decision, control and information systems is motivated, in part, by the need to support the deployment of multiple aircraft, such as combat vehicles, unmanned combat air vehicles, unmanned aerial vehicles, and weapons, in missions taking place in a dynamic, although uncertain, environment. Such systems aim at ensuring mission success without overloading the operating crew, the pilots, and the commanders. One of the main design challenges lies in obtaining some sort of coherent behaviour of the fleet, by means of solutions to potentially NPhard problems, given incomplete and imperfect information, and despite limited computational and communication capabilities. In this context, this article proposes a hierarchical decision and information system aiming at providing, in real-time, coordinated aircraft path planning and deceptive engagement assignments. The blue-red engagement policy is obtained by minimizing, and balancing, the energy expenditure among the vehicles while constraining information exchanges to a minimum defined by a risk of inconsistency. The proposed system relies on dynamic programming, online heuristic techniques and stochastic, consistency-checking methods. Numerical simulations show that the proposed approach compares advantageously to a random process and to a law that seeks to minimize the cost of the confrontation at a given time regardless of past moves. However, there is a trade-off between increasing the level of deception and the level of energy consumption.Results from stochastic approximation algorithms are used in the sequel [16]. As previously discussed, J o depends onÛ j,o , which is a known matrix, whereas recursions J 1,o andJ 1,o depend on the nominal matrix U * f ,o , where f ∈ {i, j, k} indicates the vehicle that will become the leader for the next 3 × 3 engagement, i.e.

show abstract

Section: Hierarchical Decision Makingmentioning

confidence: 99%

“…There are exactly n 2 q distinct utility matrices U r that are in the set S 2 3 . It comes from the fact that entries of U r ∈ L u over [τ o , τ o+1 ) must satisfy a i,ko = a i,lo and a j,lo = a j,ko .…”

Section: Proofmentioning

confidence: 99%

A hierarchical decision and information system for multi-aircraft combat missions

Léchevin

Rabbath

2010

Proceedings of the Institution of Mechanical Engineers, Part G:

View full text Add to dashboard Cite

show abstract

“…However, the described method requires the graph to be fully connected for at least one time-step. A data aggregation based algorithm was proposed in [8]. Such an approach requires additional memory compared to linear iterations strategies.…”

Section: Introductionmentioning

confidence: 99%

Graph Laplacian based matrix design for finite-time distributed average consensus

Kibangou

2012

2012 American Control Conference (ACC)

View full text Add to dashboard Cite

Abstract-In this paper, we consider the problem of finding a linear iteration scheme that yields distributed average consensus in a finite number of steps D. By modeling interactions between the nodes in the network by means of a time-invariant undirected graph, the problem is solved by deriving a set of D Laplacian based consensus matrices. We show that the number of steps is given by the number of nonzero distinct eigenvalues of the graph Laplacian matrix. Moreover the inverse of these eigenvalues constitute the step-sizes of the involved Laplacian based consensus matrices. When communications are made through an additive white Gaussian noise channel, based on an ensemble averaging method, we show how average consensus can be asymptotically reached. Performance analysis of the suggested protocol is given along with comparisons with other methods in the literature.

show abstract

“…However, the described method requires the graph to be fully connected for at least one time-step. A data aggregation based algorithm was proposed in [3]. Such an approach requires additional memory compared to linear iterations strategies.…”

Section: Introductionmentioning

confidence: 99%

“…Algorithms that enable such consensus reaching belong typically to two classes: Distributed averaging based algorithms and probabilistic counting approaches, such as randomized gossip schemes [3].…”

Section: Introductionmentioning

confidence: 99%

Finite-time average consensus based protocol for distributed estimation over AWGN channels

Kibangou

2011

IEEE Conference on Decision and Control and European Control Conference

View full text Add to dashboard Cite

To cite this version:Alain Y. Kibangou. Abstract-This paper studies the problem of distributed estimation of a static parameter with sensors communicating through an additive white Gaussian noise (AWGN) channel. In the noiseless case, we first introduce the concept of finite-time average consensus, in which nodes can compute exactly the average in a finite number of steps for an arbitrary graph, provided the topology is time-invariant. In fact, finite-time consensus is achieved owing to joint diagonalizable matrices. By considering a linear iterations scheme, we derive closed form expressions for such matrices. Then, based on an ensemble averaging method we show how average consensus can be asymptotically reached over AWGN channels. Performance analysis of the suggested protocol is given along with comparisons with other methods in the literature.

show abstract

Information broadcasting algorithm for Finite-Time Reaching-at-Risk Consensus with application to weapon-target assignment

Cited by 4 publications

References 12 publications

A hierarchical decision and information system for multi-aircraft combat missions

A hierarchical decision and information system for multi-aircraft combat missions

Graph Laplacian based matrix design for finite-time distributed average consensus

Finite-time average consensus based protocol for distributed estimation over AWGN channels

Contact Info

Product

Resources

About