System identification is a mature research area with well established paradigms, mostly based on classical statistical methods. Recently, there has been considerable interest in so called kernel-based regularization methods applied to system identification problem. The recent literature on this is extensive and at times difficult to digest. The purpose of this contribution is to provide an accessible account of the main ideas and results of kernel based regularization methods for system identification. The focus is to assess the impact of these new techniques on the field and traditional paradigms.

A novel, fully decentralized strategy to coordinate charge operation of electric vehicles is proposed in this paper. Based on stochastic switching control of on-board chargers, this strategy ensures high-efficiency charging, reduces load variations to the grid during charging periods, achieves charge completion with high probability, and accomplishes approximate “valley-filling”. Further improvements on the core strategy, including individualized power management, adaptive strategies, and battery support systems, are introduced to further reduce power fluctuation variances and to guarantee charge completion. Stochastic analysis is performed to establish the main properties of the strategies and to quantitatively show the performance improvements. Compared with the existing decentralized charging strategies, the strategies proposed in this paper can be implemented without any information exchange between grid operators and electric vehicles (EVs), resulting in a communications cost reduction. Additionally, it is shown that by using stochastic charging rules, a grid-supporting battery system with a very small energy capacity can achieve substantial reduction of EV load fluctuations with high confidence. An extensive set of simulations and case studies with real-world data are used to demonstrate the benefits of the proposed strategies.

We consider the range-based localization problem, which involves estimating an object's position by using $m$ sensors, hoping that as the number $m$ of sensors increases, the estimate converges to the true position with the minimum variance. We show that under some conditions on the sensor deployment and measurement noises, the LS estimator is strongly consistent and asymptotically normal. However, the LS problem is nonsmooth and nonconvex, and therefore hard to solve. We then devise realizable estimators that possess the same asymptotic properties as the LS one. These estimators are based on a two-step estimation architecture, which says that any $\sqrt{m}$-consistent estimate followed by a one-step Gauss-Newton iteration can yield a solution that possesses the same asymptotic property as the LS one. The keypoint of the two-step scheme is to construct a $\sqrt{m}$-consistent estimate in the first step. In terms of whether the variance of measurement noises is known or not, we propose the Bias-Eli estimator (which involves solving a generalized trust region subproblem) and the Noise-Est estimator (which is obtained by solving a convex problem), respectively. Both of them are proved to be $\sqrt{m}$-consistent. Moreover, we show that by discarding the constraints in the above two optimization problems, the resulting closed-form estimators (called Bias-Eli-Lin and Noise-Est-Lin) are also $\sqrt{m}$-consistent. Plenty of simulations verify the correctness of our theoretical claims, showing that the proposed two-step estimators can asymptotically achieve the Cramer-Rao lower bound.

As a critical subsystem in electric vehicles and smart grids, a battery energy storage system plays an essential role in enhancement of reliable operation and system performance. In such applications, a battery energy storage system is required to provide high energy utilization efficiency, as well as reliability. However, capacity inconsistency of batteries affects energy utilization efficiency dramatically; and the situation becomes more severe after hundreds of cycles because battery capacities change randomly due to non-uniform aging. Capacity mismatch can be solved by decomposing a cluster of batteries in series into several low voltage battery packs. This paper introduces a new analysis method to optimize energy utilization efficiency by finding the best number of batteries in a pack, based on capacity distribution, order statistics, central limit theorem, and converter efficiency. Considering both battery energy utilization and power electronics efficiency, it establishes that there is a maximum energy utilization efficiency under a given capacity distribution among a certain number of batteries, which provides a basic analysis for system-level optimization of a battery system throughout its life cycle. Quantitative analysis results based on aging data are illustrated, and a prototype of flexible energy storage systems is built to verify this analysis.

We consider signal source localization from range-difference measurements. First, we give some readily-checked conditions on measurement noises and sensor deployment to guarantee the asymptotic identifiability of the model and show the consistency and asymptotic normality of the maximum likelihood (ML) estimator. Then, we devise an estimator that owns the same asymptotic property as the ML one. Specifically, we prove that the negative log-likelihood function converges to a function, which has a unique minimum and positive definite Hessian at the true source’s position. Hence, it is promising to execute local iterations, e.g., the Gauss-Newton (GN) algorithm, following a consistent estimate. The main issue involved is obtaining a preliminary consistent estimate. To this aim, we construct a linear least-squares problem via algebraic operation and constraint relaxation and obtain a closed-form solution. We then focus on deriving and eliminating the bias of the linear least-squares estimator, which yields an asymptotically unbiased and further consistent estimate. Noting that the bias is a function of the noise variance, we further devise a consistent noise variance estimator that involves a 3-order polynomial rooting. Based on the preliminary consistent location estimate, a one-step GN iteration suffices to achieve the same asymptotic property as the ML estimator. Simulation results demonstrate the superiority of our proposed algorithm in the large sample case.

This paper studies the localization problem using noisy range-difference measurements, or equivalently time difference of arrival (TDOA) measurements. There is a reference sensor, and for each other sensor, the TDOA measurement is obtained with respect to the reference one. By minimizing the sum of squared errors, a nonconvex constrained least squares (CLS) problem is formulated. In this work, we focus on devising an algorithm to seek the global minimizer of the CLS problem, hoping that the numerical solution meets some precision requirement in terms of relative error. Based on the Lagrange multiplier method, we first branch the feasible Lagrange multiplier set into several subsets and develop a workflow in terms of if-then-else control structure to seek the global minimizer by searching for the optimal Lagrange multiplier. The execution order is carefully organized so that it is in line with the general principle of putting the flow that one normally understands to be executed first. We then dive into detailed searching methods in different cases and conduct computational error analysis, giving the error bound on the Lagrange multiplier, when we search for it, to meet the precision requirement on an approximate solution. Based on the above achievements, a programmable global minimizer seeking algorithm is proposed for the CLS problem. Simulations and experimental tests on a public dataset demonstrate the effectiveness of the proposed algorithm.