Search

A resilient state estimation scheme for uniformly observable nonlinear systems, based on a method for local identification of sensor attacks, is presented. The estimation problem is combinatorial in nature, and so many methods require substantial computational and storage resources as the number of sensors increases. To reduce the complexity, the proposed method performs the attack identification with local subsets of the measurements, not with the set of all measurements. A condition for nonlinear attack identification is introduced as a relaxed version of existing redundant observability condition. It is shown that an attack identification can be performed even when the state cannot be recovered from the measurements. As a result, although a portion of measurements are compromised, they can be locally identified and excluded from the state estimation, and thus the true state can be recovered. Simulation results demonstrate the effectiveness of the proposed scheme., Comment: 12 pages, 4 figures, submitted to IEEE Transactions on Automatic Control

We develop a discrete-time version of the blended dynamics theorem for the use of designing distributed computation algorithms. The blended dynamics theorem enables to predict the behavior of heterogeneous multi-agent systems. Therefore, once we get a blended dynamics for a particular computational task, design idea of node dynamics for individual heterogeneous agents can easily occur. In the continuous-time case, prediction by blended dynamics was enabled by high coupling gain among neighboring agents. In the discrete-time case, we propose an equivalent action, which we call multi-step coupling in this paper. Compared to the continuous-time case, the blended dynamics can have more variety depending on the coupling matrix. This benefit is demonstrated with three applications; distributed estimation of network size, distributed computation of the PageRank, and distributed computation of the degree sequence of a graph, which correspond to the coupling by doubly-stochastic, column-stochastic, and row-stochastic matrices, respectively.

Given a non-contracting trajectory of a nonlinear system, we consider the question of designing an input perturbation that makes the perturbed trajectory contracting. This paper stresses the analogy of this question with the classical question of feedback stabilization. In particular, it is shown that the existence of an output variable that ensures contraction of the inverse system facilitates the design of a contracting input perturbation. We illustrate the relevance of this question in parameter estimation., Comment: 7 pages, 6 figures

This paper examines how weak synaptic coupling can achieve rapid synchronization in heterogeneous networks. The assumptions aim at capturing the key mathematical properties that make this possible for biophysical networks. In particular, the combination of nodal excitability and synaptic coupling are shown to be essential to the phenomenon., Comment: 20 pages, 3 figures

We study a node-wise monotone barrier coupling law, motivated by the synaptic coupling of neural central pattern generators. It is illustrated that this coupling imitates the desirable properties of neural central pattern generators. In particular, the coupling law 1) allows us to assign multiple central patterns on the circle and 2) allows for rapid switching between different patterns via simple `kicks'. In the end, we achieve full control by partitioning the state space by utilizing a barrier effect and assigning a unique steady-state behavior to each element of the resulting partition. We analyze the global behavior and study the viability of the design., Comment: 25 pages, 8 figures

When a group of heterogeneous node dynamics are diffusively coupled with a high coupling gain, the group exhibits a collective emergent behavior which is governed by a simple algebraic average of the node dynamics called the blended dynamics. This finding has been utilized for designing heterogeneous multi-agent systems by building the desired blended dynamics first and then splitting it into the node dynamics. However, to compute the magnitude of the coupling gain, each agent needs to know global information such as the number of participating nodes, the graph structure, and so on, which prevents a fully decentralized design of the node dynamics in conjunction with the coupling laws. To resolve this issue, the idea of funnel control, which is a method for adaptive gain selection, can be exploited for a node-wise coupling, but the price to pay is that the collective emergent behavior is no longer governed by a simple average of the node dynamics. Our analysis reveals that this drawback can be avoided by an edge-wise design premise, which is the idea that we present in this paper. After all, we gain benefits such as a fully decentralized design without global information, collective emergent behavior being governed by the blended dynamics, and the plug-and-play operation based on edge-wise handshaking between two nodes., Comment: 14 pages, 3 figures

In the purpose of making the consensus algorithm robust to outliers, consensus on the median value has recently attracted some attention. It has its applicability in for instance constructing a resilient distributed state estimator. Meanwhile, most of the existing works consider continuous-time algorithms and uses high-gain and discontinuous vector fields. This issues a problem of the need for smaller time steps and yielding chattering when discretizing by explicit method for its practical use. Thus, in this paper, we highlight that these issues vanish when we utilize instead Implicit-Explicit Method, for a broader class of networks designed by the blended dynamics approach. In particular, for undirected and connected graphs, we propose a discrete-time distributed median solver that does not suffer from chattering. We also verify by simulation that it has a smaller iteration number required to arrive at a steady-state., Comment: 5 pages, 3 figures

Positivity and Perron-Frobenius theory provide an elegant framework for the convergence analysis of linear consensus algorithms. Here we consider a generalization of these ideas to the analysis of nonlinear consensus algorithms on the circle and establish tools for the design of consensus protocols that monotonically converge to target formations on the circle.

A group behavior of a heterogeneous multi-agent system is studied which obeys an "average of individual vector fields" under strong couplings among the agents. Under stability of the averaged dynamics (not asking stability of individual agents), the behavior of heterogeneous multi-agent system can be estimated by the solution to the averaged dynamics. A following idea is to "design" individual agent's dynamics such that the averaged dynamics performs the desired task. A few applications are discussed including estimation of the number of agents in a network, distributed least-squares or median solver, distributed optimization, distributed state estimation, and robust synchronization of coupled oscillators. Since stability of the averaged dynamics makes the initial conditions forgotten as time goes on, these algorithms are initialization-free and suitable for plug-and-play operation. At last, nonlinear couplings are also considered, which potentially asserts that enforced synchronization gives rise to an emergent behavior of a heterogeneous multi-agent system., Comment: arXiv admin note: text overlap with arXiv:1804.00638

In this paper, we introduce a nonlinear time-varying coupling law, which can be designed in a fully decentralized manner and achieves approximate synchronization with arbitrary precision, under only mild assumptions on the individual vector fields and the underlying (undirected) graph structure. The proposed coupling law is motivated by the so-called funnel control method studied in adaptive control under the observation that arbitrary precision synchronization can be achieved for heterogeneous multi-agent systems by a high-gain coupling; consequently we call our novel synchronization method `(node-wise) funnel coupling.' By adjusting the conventional proof technique in the funnel control study, we are even able to obtain asymptotic synchronization with the same funnel coupling law. Moreover, the emergent collective behavior that arises for a heterogeneous multi-agent system when enforcing arbitrary precision synchronization by the proposed funnel coupling law, is analyzed in this paper. In particular, we introduce a single scalar dynamics called `emergent dynamics' which describes the emergent synchronized behavior of the multi-agent system under funnel coupling. Characterization of the emergent dynamics is important because, for instance, one can design the emergent dynamics first such that the solution trajectory behaves as desired, and then, provide a design guideline to each agent so that the constructed vector fields yield the desired emergent dynamics. We illustrate this idea via the example of a distributed median solver based on funnel coupling.

In this paper, we present a scheme of fully distributed resilient state estimation for linear dynamical systems under sensor attacks. The proposed state observer consists of a network of local observers, where each of them utilizes local measurements and information transmitted from the neighbors. As a fully distributed scheme, it does not necessarily collect a majority of sensing data for the sake of attack identification, while the compromised sensors are eventually identified by the distributed network and excluded from the observers. For this, the overall network (not the individual local observer) is assumed to have redundant sensors and assumed to be connected. The proposed scheme is based on a novel design of a distributed median solver, which approximately recovers the median value of local estimates.

The behavior of heterogeneous multi-agent systems is studied when the coupling matrices are possibly all different and/or singular, that is, its rank is less than the system dimension. Rank-deficient coupling allows exchange of limited state information, which is suitable for the study of multi-agent systems under output coupling. We present a coordinate change that transforms the heterogeneous multi-agent system into a singularly perturbed form. The slow dynamics is still a reduced-order multi-agent system consisting of a weighted average of the vector fields of all agents, and some sub-dynamics of agents. The weighted average is an emergent dynamics, which we call a blended dynamics. By analyzing or synthesizing the blended dynamics, one can predict or design the behavior of a heterogeneous multi-agent system when the coupling gain is sufficiently large. For this result, stability of the blended dynamics is required. Since stability of the individual agent is not asked, the stability of the blended dynamics is the outcome of trading off the stability among the agents. It can be seen that, under the stability of the blended dynamics, the initial conditions of the individual agents are forgotten as time goes on, and thus, the behavior of the synthesized multi-agent system is initialization-free and is suitable for plug-and-play operation. As a showcase, we apply the proposed tool to four application problems; distributed state estimation for linear systems, practical synchronization of heterogeneous Van der Pol oscillators, estimation of the number of nodes in a network, and a problem of distributed optimization.

The Riemann Hypothesis is not proved yet and this article gives a possible proof for the hypothesis which confirms that the only possible nontrivial zeros of the Riemann zeta-function has its real value equal to 1/2. From the result, the application of the Riemann Hypothesis will be certified, e.g. research on prime numbers., Comment: Not mathematically correct

In this paper, we present a proof of the Riemann hypothesis. We show that zeros of the Riemann zeta function should be on the line with the real value 1/2, in the region where the real part of complex variable is between 0 and 1., Comment: Not mathematically correct