Search

This paper is concerned with the network-theoretic properties of so-called k-nearest neighbor intelligent vehicular platoons, where each vehicle communicates with k vehicles, both in front and behind. The network-theoretic properties analyzed in this paper play major roles in quantifying the resilience and robustness of three generic distributed estimation and control algorithms against communication failures and disturbances, namely resilient distributed estimation, resilient distributed consensus, and robust network formation. Based on the results for the connectivity measures of the k-nearest neighbor platoon, we show that extending the traditional platooning topologies (which were only based on interacting with nearest neighbors) to k-nearest neighbor platoons increases the resilience of distributed estimation and control algorithms to both communication failures and disturbances., QC 20190514

In this paper, a subspace identification method is proposed for Hammerstein systems under periodic disturbance. By using the linear superposition principle to decompose the periodic disturbance response from the deterministic system response, an orthogonal projection is established to eliminate the disturbance effect. The unknown disturbance period can be estimated by defining an objective function of output prediction error for minimization. Correspondingly, a singular value decomposition (SVD) based algorithm is given to estimate the observability matrix and the lower triangular block-Toeplitz matrix. The state matrices A and C are subsequently retrieved from the estimated observability matrix via a shift-invariant algorithm, while the input matrix B and the nonlinear input function parameters are retrieved from the estimated lower triangular block-Toeplitz matrix by an SVD approach. Consistent estimation of the observability matrix and the lower triangular block-Toeplitz matrix is analyzed. An illustrative example is shown to demonstrate the effectiveness of the proposed identification method., QC 20190403

In this paper, a subspace identification method is proposed for Hammerstein systems under periodic disturbance. By using the linear superposition principle to decompose the periodic disturbance response from the deterministic system response, an orthogonal projection is established to eliminate the disturbance effect. The unknown disturbance period can be estimated by defining an objective function of output prediction error for minimization. Correspondingly, a singular value decomposition (SVD) based algorithm is given to estimate the observability matrix and the lower triangular block-Toeplitz matrix. The state matrices A and C are subsequently retrieved from the estimated observability matrix via a shift-invariant algorithm, while the input matrix B and the nonlinear input function parameters are retrieved from the estimated lower triangular block-Toeplitz matrix by an SVD approach. Consistent estimation of the observability matrix and the lower triangular block-Toeplitz matrix is analyzed. An illustrative example is shown to demonstrate the effectiveness of the proposed identification method., QC 20190403

In this paper, a subspace identification method is proposed for Hammerstein systems under periodic disturbance. By using the linear superposition principle to decompose the periodic disturbance response from the deterministic system response, an orthogonal projection is established to eliminate the disturbance effect. The unknown disturbance period can be estimated by defining an objective function of output prediction error for minimization. Correspondingly, a singular value decomposition (SVD) based algorithm is given to estimate the observability matrix and the lower triangular block-Toeplitz matrix. The state matrices A and C are subsequently retrieved from the estimated observability matrix via a shift-invariant algorithm, while the input matrix B and the nonlinear input function parameters are retrieved from the estimated lower triangular block-Toeplitz matrix by an SVD approach. Consistent estimation of the observability matrix and the lower triangular block-Toeplitz matrix is analyzed. An illustrative example is shown to demonstrate the effectiveness of the proposed identification method., QC 20190403

This article has been retracted: please see Elsevier Policy on Article Withdrawal (https://www.elsevier.com/about/our-business/policies/article-withdrawal). The authors of the paper wish to retract the paper due to the discovery of a calculation error in the processing of the raw data. The discovered error concerns the calculation of the specific uptake/secretion rates for several metabolites in one of the experimental conditions, i.e. glutamine omission (called Q0). In other words, in Figure 2, the variations of the metabolic fluxes for the condition Q0 are not correct. When this error is corrected, the resulting mathematical model changes (in particular for the results associated with Q0 conditions), several figures and tables are modified, and the interpretation of the fluxes in Q0 has to be slightly modified. Therefore the authors wish to retract the article. However, the error does not affect the modelling approach or the methodology presented in the article. Therefore, a revised version with the correct data has since been published: http://www.sciencedirect.com/science/article/pii/S0168165617302663. We apologize to the scientific community for the need to retract the article and the inconvenience caused., Export Date: 13 February 2018; Erratum; CODEN: JBITD. QC 20180228

In this paper, a subspace identification method is proposed for Hammerstein systems under periodic disturbance. By using the linear superposition principle to decompose the periodic disturbance response from the deterministic system response, an orthogonal projection is established to eliminate the disturbance effect. The unknown disturbance period can be estimated by defining an objective function of output prediction error for minimization. Correspondingly, a singular value decomposition (SVD) based algorithm is given to estimate the observability matrix and the lower triangular block-Toeplitz matrix. The state matrices A and C are subsequently retrieved from the estimated observability matrix via a shift-invariant algorithm, while the input matrix B and the nonlinear input function parameters are retrieved from the estimated lower triangular block-Toeplitz matrix by an SVD approach. Consistent estimation of the observability matrix and the lower triangular block-Toeplitz matrix is analyzed. An illustrative example is shown to demonstrate the effectiveness of the proposed identification method., QC 20190403

In this paper, a subspace identification method is proposed for Hammerstein systems under periodic disturbance. By using the linear superposition principle to decompose the periodic disturbance response from the deterministic system response, an orthogonal projection is established to eliminate the disturbance effect. The unknown disturbance period can be estimated by defining an objective function of output prediction error for minimization. Correspondingly, a singular value decomposition (SVD) based algorithm is given to estimate the observability matrix and the lower triangular block-Toeplitz matrix. The state matrices A and C are subsequently retrieved from the estimated observability matrix via a shift-invariant algorithm, while the input matrix B and the nonlinear input function parameters are retrieved from the estimated lower triangular block-Toeplitz matrix by an SVD approach. Consistent estimation of the observability matrix and the lower triangular block-Toeplitz matrix is analyzed. An illustrative example is shown to demonstrate the effectiveness of the proposed identification method., QC 20190403

For identification of systems embedded in dynamic networks, the prediction error method (PEM) with a correct parametrization of the complete network provides asymptotically efficient estimates. However, the network complexity often hinders a successful application of PEM, which requires minimizing a non-convex cost function that can become more intricate for more complex networks. For this reason, identification in dynamic networks often focuses in obtaining consistent estimates of modules of interest. A downside of these approaches is that splitting the network in several modules for identification often costs asymptotic efficiency. In this paper, we consider dynamic networks with the modules connected in serial cascade, with measurements affected by sensor noise. We propose an algorithm that estimates all the modules in the network simultaneously without requiring the minimization of a non-convex cost function. This algorithm is an extension of Weighted Null-Space Fitting (WNSF), a weighted least-squares method that provides asymptotically efficient estimates for single-input single-output systems. We illustrate the performance of the algorithm with simulation studies, which suggest that a network WNSF method may also be asymptotically efficient when applied to cascade structures. Finally, we discuss the possibility of extension to more general networks affected by sensor noise., QC20190403

We address the problem of attack detection and attack correction for multi-input multi-output discrete-time linear time-invariant systems under sensor attacks. More specifically, we consider the situation that a system with known input is corrupted by additive adversarial attack signals on some of the system's outputs. In this paper, we use system representation in a behavioural approach, which allows for natural and compact statements regarding linear system security. We extend our earlier results for systems with zero inputs to systems with non-zero inputs. We assume that these non-zero inputs are known., QC20190418

Kernel-based regularization has recently been shown to be a successful method for impulse response estimation. This technique usually requires choosing a vector of hyper-parameters in order to form an appropriate regularization matrix. In this paper, we develop an alternative way to obtain kernel-based regularization estimates by Bayesian model mixing. This new approach is tested against state-of-the-art methods for hyperparameter tuning in regularized FIR estimation, with favorable results in many cases.

In system identification, many structures and approaches have been proposed to deal with systems with non-linear behavior. When applicable, the prediction error method, analogously to the linear case, requires minimizing a cost function that is non-convex in general. The issue with non-convexity is more problematic for non-linear models, not only due to the increased complexity of the model, but also because methods to provide consistent initialization points may not be available for many model structures. In this paper, we consider a non-linear rational finite impulse response model. We observe how the prediction error method requires minimizing a non-convex cost function, and propose a three-step least-squares algorithm as an alternative procedure. This procedure is an extension of the Model Order Reduction Steiglitz-McBride method, which is asymptotically efficient in open loop for linear models. We perform a simulation study to illustrate the applicability and performance of the method, which suggests that it is asymptotically efficient., QC 20190403

This paper studies static state estimation based on measurements from a set of sensors, a subset of which can be compromised by an attacker. The measurements from a compromised sensor can be manipulated arbitrarily by the adversary. A new notion is adopted to indicate the performance of an estimator, that is, the asymptotic exponential rate, with which the worst-case probability of estimate lying outside certain ball centered at the true underlying state goes to zero. An optimal estimator, which computes Chebyshev centers and only utilizes the information contained in the averaged measurements, is proposed. Numerical examples are given to elaborate the results., QC 20190418

Contemporary Content Delivery Networks (CDN) handle a vast number of content items. At such a scale, the replication schemes require a significant amount of time to calculate and realize cache updates, and hence they are impractical in highly-dynamic environments. This paper introduces cluster-based replication, whereby content items are organized in clusters according to a set of features, given by the cache/network management entity. Each cluster is treated as a single item with certain attributes, e.g., size, popularity, etc. and it is then altogether replicated in network caches so as to minimize overall network traffic. Clustering items reduces replication complexity; hence it enables faster and more frequent caches updates, and it facilitates more accurate tracking of content popularity. However, clustering introduces some performance loss because replication of clusters is more coarse-grained compared to replication of individual items. This tradeoff can be addressed through proper selection of the number and composition of clusters. Due to the fact that the exact optimal number of clusters cannot be derived analytically, an efficient approximation method is proposed. Extensive numerical evaluations of time-varying content popularity scenarios allow to argue that the proposed approach reduces core network traffic, while being robust to errors in popularity estimation., QC 20171211

In this work the problem of computing the maximum gain of non-linear systems, also known as its ℓ2-gain, from input-output data is studied. From an input design perspective, this problem reduces to find an optimal input sequence, of bounded norm, maximizing the norm gain of the output, where our target estimation corresponds to the ratio of these quantities. The novelty of this approach lies on the fact that the input signal is a realization of a stationary process with finite memory whose range is a finite set of values. Based on recent developents on input design for nonlinear systems, our approach leads to a linear program whose optimal cost gives an approximation of the ℓ2-gain of the system. An illustrative example shows how well the algorithm performs compared to other methods approximating this quantity., QC 20190418