相关论文: Finite time max-consensus for simultaneous target …

Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…

The maximum surveillance of a target which is holding course is considered, wherein an observer vehicle aims to maximize the time that a faster target remains within a fixed-range of the observer. This entails two coupled phases: an…

In realistic pursuit-evasion scenarios, abrupt target maneuvers generate unavoidable periods of elevated uncertainty that result in estimation delays. Such delays can degrade interception performance to the point of causing a miss. Existing…

Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded…

We propose a distributed (single) target tracking scheme based on networked estimation and consensus algorithms over static sensor networks. The tracking part is based on linear time-difference-of-arrival (TDOA) measurement proposed in our…

This paper addresses the distributed consensus problem for a linear multi-agent system with switching directed communication topologies. By appropriately introducing a linear transformation, the consensus problem is equivalently converted…

A gambler moves between the vertices $1, \ldots, n$ of a graph using the probability distribution $p_{1}, \ldots, p_{n}$. Multiple cops pursue the gambler on the graph, only being able to move between adjacent vertices. We investigate the…

This paper proposes two algorithms, namely "back-tracking" and "history following", to reach consensus in case of communication loss for a network of distributed agents with switching topologies. To reach consensus in distributed control,…

A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…

This paper considers a leader-following problem for a group of heterogeneous linear time invariant (LTI) followers that are interacting over a directed acyclic graph. Only a subset of the followers has access to the state of the leader in…

We study the problem of collaboratively estimating the state of a discrete-time LTI process by a network of sensor nodes interacting over a time-varying directed communication graph. Existing approaches to this problem either (i) make…

In this paper, for any homogeneous system of agents with linear continuous time dynamics, we formulate an optimal control problem. In this problem a convex cost functional of the control signals of the agents shall be minimized, while the…

We study synchronization and consensus in a group of dynamical systems coupled via multiple directed networks. We show that even though the coupling in a single network may not be sufficient to synchronize the systems, combination of…

This paper addresses the distributed consensus design problem for linear multi-agent systems with directed communication graphs and external disturbances. Both the cases with strongly connected communication graphs and leader-follower…

A novel quickest detection setting is proposed which is a generalization of the well-known Bayesian change-point detection model. Suppose \{(X_i,Y_i)\}_{i\geq 1} is a sequence of pairs of random variables, and that S is a stopping time with…

This paper studies the consensus problem of multi-agent systems with asymmetric and reducible topologies. Centralized event-triggered rules are provided so as to reduce the frequency of system's updating. The diffusion coupling feedbacks of…

We come up with a class of distributed quantized averaging algorithms on asynchronous communication networks with fixed, switching and random topologies. The implementation of these algorithms is subject to the realistic constraint that the…

This paper explores the structural controllability of switched linear continuous-time systems. It first identifies a gap in the proof for a pivotal criterion for the structural controllability of switched linear systems in the literature.…

This work considers the problem of detecting signals from multiple sequentially observed data streams, where only one stream can be observed at every time instant. The goal is to detect signals as quickly as possible while controlling the…

In this paper, we consider the coordination control of a group of autonomous mobile agents with multiple leaders. Different interconnection topologies are investigated. At first, a necessary and sufficient condition is proved in the case of…