Compressive system identification of LTI and LTV ARX models: The limited data set case

In this paper, we consider identifying Auto Regressive with eXternal input (ARX) models for both Linear Time-Invariant (LTI) and Linear Time-Variant (LTV) systems. We aim at doing the identification from the smallest possible number of observations. This is inspired by the field of Compressive Sensing (CS), and for this reason, we call this problem Compressive System Identification (CSI). In the case of LTI ARX systems, a system with a large number of inputs and unknown input delays on each channel can require a model structure with a large number of parameters, unless input delay estimation is performed. Since the complexity of input delay estimation increases exponentially in the number of inputs, this can be difficult for high dimensional systems. We show that in cases where the LTI system has possibly many inputs with different unknown delays, simultaneous ARX identification and input delay estimation is possible from few observations, even though this leaves an apparently ill-conditioned identification problem. We discuss identification guarantees and support our proposed method with simulations. We also consider identifying LTV ARX models. In particular, we consider systems with parameters that change only at a few time instants in a piecewise-constant manner where neither the change moments nor the number of changes is known a priori. The main technical novelty of our approach is in casting the identification problem as recovery of a block-sparse signal from an underdetermined set of linear equations. We suggest a random sampling approach for LTV identification, address the issue of identifiability and again support our approach with illustrative simulations

Self-triggered rendezvous of gossiping second-order agents

A recent paper by some of the authors introduced several self-triggered coordination algorithms for first-order continuous-time systems. The extension of these algorithms to second-order agents is relevant in many practical applications but presents some challenges that are tackled in this contribution and that require to depart from the analysis that was carried out before. We design a self-triggered gossiping coordination algorithm that induces a time-varying communication graph, which is enough connected to guarantee useful convergence properties, and allows us to achieve the desired coordination task in a formation of double-integrator agents that (i) establish pair-wise communication at suitably designed times and (ii) exchange relative measurements while reducing the sensing and communication effort

On the passivity approach to quantized coordination problems

We investigate a passivity approach to collective coordination problems in the presence of quantized measurements and show that coordination tasks can be achieved in a practical sense for a large class of passive systems. Both static and time-varying graphs are considered. The results are then specialized to some particular coordination problems and compared with existing results.</p