PyTorchKR Papers

최신 논문

총 1,159편
태그·기간 등 상세 필터

카테고리 탐색

로그인 후 이 태그 구독

arXiv:1907.06930

Performance Assessment of Kron Reduction in the Numerical Analysis of Polyphase Power Systems

This paper investigates the impact of Kron reduction on the performance of numerical methods applied to the analysis of unbalanced polyphase power systems. Specifically, this paper focuses on power-flow study, state estimation, and voltage stability assessment. For these applications, the standard Newton-Raphson method, linear weighted-least-squares regression, and homotopy continuation method are used, respectively. The performance of the said numerical methods is assessed in a series of simulations, in which the zero-injection nodes of a test system are successively eliminated through Kron reduction.

arXiv:1907.06846

Coherency and Online Signal Selection Based Wide Area Control of Wind Integrated Power Grid

This paper introduces a novel method of designing wide area control (WAC) based on a discrete linear quadratic regulator and Kalman filtering based state-estimation that can be applied for real-time damping of interarea oscillations of wind integrated power grid. The main advantages of the proposed method are that the architecture provides online coherency grouping that properly characterizes real-time changes in the power grid and online wide-area signal selection based on residue method for proper selection of the WAC signals. The proposed architecture can, thus, accurately monitors changes in the power grid and select the appropriate control signal for more effectively damping the interarea oscillation when compared to the conventional local signal based power system stabilizers or offline based WAC designs. The architecture is tested on a wind integrated two-area system and the IEEE 39 bus system in order to show the capability of the proposed method.

arXiv:1906.07970

Fast Nonconvex SDP Solvers for Large-scale Power System State Estimation

Fast power system state estimation (SE) solution is of paramount importance for achieving real-time decision making in power grid operations. Semidefinite programming (SDP) reformulation has been shown effective to obtain the global optimum for the nonlinear SE problem, while suffering from high computational complexity. Thus, we leverage the recent advances in nonconvex SDP approach that allows for the simple first-order gradient-descent (GD) updates. Using the power system model, we can verify that the SE objective function enjoys nice properties (strongly convex, smoothness) which in turn guarantee a linear convergence rate of the proposed GD-based SE method. To further accelerate the convergence speed, we consider the accelerated gradient descent (AGD) extension, as well as their robust versions under outlier data and a hybrid GD-based SE approach with additional synchrophasor measurements. Numerical tests on the IEEE 118-bus, 300-bus and the synthetic ACTIVSg2000-bus systems have demonstrated that FGD-SE and AGD-SE, can approach the near-optimal performance of the SDP-SE solution at significantly improved computational efficiency, especially so for AGD-SE.

arXiv:1906.06695

Ensemble Consider Kalman Filtering

In this paper, the ensemble consider Kalman filter is proposed to mitigate the negative effects of uncertain parameters in nonlinear dynamic and measurement models. The ensemble Kalman filter can avoid using the Jacobian matrices and reduce the computational complexity, the unknown parameters of the models still are not considered. By incorporating the statistics of the uncertain parameters into the state estimation formulations and using an augmented-state approach, the ensemble integration is reset by resampling the ensemble members in the new step, and the EnCKF algorithm is derived. Two numerical simulations show that the presented EnCKF can mitigate the negative effects of the uncertain parameters.

arXiv:1902.05828

Comprehensive review of models and methods for inferences in bio-chemical reaction networks

Key processes in biological and chemical systems are described by networks of chemical reactions. From molecular biology to biotechnology applications, computational models of reaction networks are used extensively to elucidate their non-linear dynamics. Model dynamics are crucially dependent on parameter values which are often estimated from observations. Over past decade, the interest in parameter and state estimation in models of (bio-)chemical reaction networks (BRNs) grew considerably. Statistical inference problems are also encountered in many other tasks including model calibration, discrimination, identifiability and checking as well as optimum experiment design, sensitivity analysis, bifurcation analysis and other. The aim of this review paper is to explore developments of past decade to understand what BRN models are commonly used in literature, and for what inference tasks and inference methods. Initial collection of about 700 publications excluding books in computational biology and chemistry were screened to select over 260 research papers and 20 graduate theses concerning estimation problems in BRNs. The paper selection was performed as text mining using scripts to automate search for relevant keywords and terms. The outcome are tables revealing the level of interest in different inference tasks and methods for given models in literature as well as recent trends. In addition, a brief survey of general estimation strategies is provided to facilitate understanding of estimation methods which are used for BRNs. Our findings indicate that many combinations of models, tasks and methods are still relatively sparse representing new research opportunities to explore those that have not been considered - perhaps for a good reason. The paper concludes by discussing future research directions including research problems which cannot be directly deduced from presented tables.

arXiv:1901.04094

Optimal decoding of dynamic stimuli encoded by heterogeneous populations of spiking neurons - a closed form approximation

Neural decoding may be formulated as dynamic state estimation (filtering) based on point process observations, a generally intractable problem. Numerical sampling techniques are often practically useful for the decoding of real neural data. However, they are less useful as theoretical tools for modeling and understanding sensory neural systems, since they lead to limited conceptual insight about optimal encoding and decoding strategies. We consider sensory neural populations characterized by a distribution over neuron parameters. We develop an analytically tractable Bayesian approximation to optimal filtering based on the observation of spiking activity, that greatly facilitates the analysis of optimal encoding in situations deviating from common assumptions of uniform coding. Continuous distributions are used to approximate large populations with few parameters, resulting in a filter whose complexity does not grow with the population size, and allowing optimization of population parameters rather than individual tuning functions. Numerical comparison with particle filtering demonstrates the quality of the approximation. The analytic framework leads to insights which are difficult to obtain from numerical algorithms, and is consistent with biological observations about the distribution of sensory cells' preferred stimuli.

arXiv:1812.11062

MAP moving horizon estimation for threshold measurements with application to field monitoring

The paper deals with state estimation of a spatially distributed system given noisy measurements from pointwise-in-time-and-space threshold sensors spread over the spatial domain of interest. A Maximum A posteriori Probability (MAP) approach is undertaken and a Moving Horizon (MH) approximation of the MAP cost-function is adopted. It is proved that, under system linearity and log-concavity of the noise probability density functions, the proposed MH-MAP state estimator amounts to the solution, at each sampling interval, of a convex optimization problem. Moreover, a suitable centralized solution for large-scale systems is proposed with a substantial decrease of the computational complexity. The latter algorithm is shown to be feasible for the state estimation of spatially-dependent dynamic fields described by Partial Differential Equations (PDE) via the use of the Finite Element (FE) spatial discretization method. A simulation case-study concerning estimation of a diffusion field is presented in order to demonstrate the effectiveness of the proposed approach. Quite remarkably, the numerical tests exhibit a noise-assisted behavior of the proposed approach in that the estimation accuracy results optimal in the presence of measurement noise with non-null variance.

arXiv:1812.06723

An Equivalent Circuit Formulation for Power System State Estimation including PMUs

In this paper, a novel formulation for the power system state estimation is proposed, based on the recently introduced equivalent split-circuit formulation of the power flow problem. The formulation models the conventional and time synchronized measurements simultaneously and contains a significantly lower level of nonlinearity compared to the available hybrid state estimators. The appropriate circuit models are derived for different types of measurements and integrated into the existing circuit framework for the power flow problem. A constrained optimization problem is then formulated to estimate the states of the system in rectangular coordinates, while satisfying the circuit equations and bounds on the measurement data. To further prove the concept and validate the accuracy of the proposed formulation, several test cases are solved and the results are presented and discussed.

arXiv:1812.00070

A Linear Formulation for Power System State Estimation including RTU and PMU Measurements

In this paper, a novel linear formulation for power system state estimation that simultaneously treats conventional and synchrophasor measurements is proposed. A linear circuit model for conventional measurements is introduced to enable a fully linear equivalent circuit representation of the power system. The estimated system state is then obtained by formulating the optimization problem to minimize the measurement errors and solving the resulting linear set of optimality conditions. To evaluate the accuracy of the proposed method, simulations are performed on several test cases of various sizes and the results are presented and discussed.

arXiv:1811.07281

Convolutional-Sparse-Coded Dynamic Mode Decomposition and Its Application to River State Estimation

This work proposes convolutional-sparse-coded dynamic mode decomposition (CSC-DMD) by unifying extended dynamic mode decomposition (EDMD) and convolutional sparse coding. EDMD is a data driven analysis method for describing a nonlinear dynamical system with a linear time-evolution equation. Compared with existing EDMD methods, CSC-DMD has an advantage of reflecting spatial structure of the target. As an example, the proposed method is applied to river bed shape estimation from the water surface observation. The estimation problem is reduced to sparsity-aware restoration with a hard constraint, which is given by the CSC-DMD prediction, where the algorithm is derived by the primal-dual splitting method. A time series set of water surface and bed shape measured through an experimental river setup is used to train and test the system. From the result, the significance of the proposed method is verified.

arXiv:1809.10237

Generic Vehicle Tracking Framework Capable of Handling Occlusions Based on Modified Mixture Particle Filter

Accurate and robust tracking of surrounding road participants plays an important role in autonomous driving. However, there is usually no prior knowledge of the number of tracking targets due to object emergence, object disappearance and false alarms. To overcome this challenge, we propose a generic vehicle tracking framework based on modified mixture particle filter, which can make the number of tracking targets adaptive to real-time observations and track all the vehicles within sensor range simultaneously in a uniform architecture without explicit data association. Each object corresponds to a mixture component whose distribution is non-parametric and approximated by particle hypotheses. Most tracking approaches employ vehicle kinematic models as the prediction model. However, it is hard for these models to make proper predictions when sensor measurements are lost or become low quality due to partial or complete occlusions. Moreover, these models are incapable of forecasting sudden maneuvers. To address these problems, we propose to incorporate learning-based behavioral models instead of pure vehicle kinematic models to realize prediction in the prior update of recursive Bayesian state estimation. Two typical driving scenarios including lane keeping and lane change are demonstrated to verify the effectiveness and accuracy of the proposed framework as well as the advantages of employing learning-based models.

arXiv:1807.07650

Near-Optimal Distributed Estimation for a Network of Sensing Units Operating Under Communication Constraints

We study the problem of distributed state estimation in a network of sensing units that can exchange their measurements but the rate of communication between the units is constrained. The units collect noisy, possibly only partial observations of the unknown state; they are assisted by a relay center which can communicate at a higher rate and schedules the exchange of measurements between the units. We consider the task of minimizing the total mean-square estimation error of the network while promoting balance between the individual units' performances. This problem is formulated as the maximization of a monotone objective function subject to a cardinality constraint. By leveraging the notion of weak submodularity, we develop an efficient greedy algorithm for the proposed formulation and show that the greedy algorithm achieves a constant factor approximation of the optimal objective. Our extensive simulation studies illustrate the efficacy of the proposed formulation and the greedy algorithm.

arXiv:1807.04387

Exactly Decoupled Kalman Filtering for Multitarget State Estimation with Sensor Bias

The problem of multisensor multitarget state estimation in the presence of constant but unknown sensor biases is investigated. The classical approach to this problem is to augment the state vector to include the states of all the targets and the sensor biases, and then implement an augmented state Kalman filter (ASKF). In this paper, we propose a novel decoupled Kalman filtering algorithm. The decoupled Kalman filtering first processes each target in a separate branch, namely the single-target Kalman filtering branch, where the single-target states and the sensor biases are estimated. Then the bias estimate is refined by fusing the former bias estimates across all the single-target Kalman filtering branches. Finally, the refined bias estimate is fed back to each single-target Kalman filtering branch to improve the target state estimation. We prove that the proposed decoupled Kalman filtering is exactly equivalent to the ASKF in terms of the estimation results under a usual initial condition. The equivalence is also confirmed via the numerical example. Moreover, we further validate the proposed algorithm using the field experimental data of a multistatic passive radar.

arXiv:1807.03463

Constrained State Estimation -- A Review

The real-world applications in signal processing generally involve estimating the system state or parameters in nonlinear, non-Gaussian dynamic systems. The estimation problem may get even more challenging when there are physical constraints on the system state. This tutorial-style paper reviews the Bayesian state estimation for (non)linear state-space systems and introduces the formulation of constrained state estimation in such scenarios. Specifically, we start by providing a review of unconstrained state estimation using Kalman filters (KF) for the linear systems and their extensions for nonlinear state-space systems, including extended Kalman filters (EKF), unscented Kalman filters (UKF), and ensemble Kalman filters (EnKF). Next, we present particle filters (PFs) for nonlinear state-space systems. Finally, we review constrained state estimation using various filtering techniques and highlight the advantages and disadvantages of the different constrained state estimation approaches.

arXiv:1807.01671

Data-Driven Learning-Based Optimization for Distribution System State Estimation

Distribution system state estimation (DSSE) is a core task for monitoring and control of distribution networks. Widely used algorithms such as Gauss-Netwon perform poorly with the limited number of measurements typically available for DSSE, often require many iterations to obtain reasonable results, and sometimes fail to converge. DSSE is a non-convex problem, and working with a limited number of measurements further aggravate the situation, as indeterminacy induces multiple global (in addition to local) minima. Gauss-Newton is also known to be sensitive to initialization. Hence, the situation is far from ideal. It is therefore natural to ask if there is a smart way of initializing Gauss-Newton that will avoid these DSSE-specific pitfalls. This paper proposes using historical or simulation-derived data to train a shallow neural network to `learn to initialize' -- that is, map the available measurements to a point in the neighborhood of the true latent states (network voltages), which is used to initialize Gauss-Newton. It is shown that this hybrid machine learning / optimization approach yields superior performance in terms of stability, accuracy, and runtime efficiency, compared to conventional optimization-only approaches. It is also shown that judicious design of the neural network training cost function helps to improve the overall DSSE performance.

arXiv:1805.04922

An Enhanced MPPT Method based on ANN-assisted Sequential Monte Carlo and Quickest Change Detection

The performance of a photovoltaic system is subject to varying environmental conditions, and it becomes more challenging to track the maximum power point (MPP) and maintain the optimal performance when partial shading occurs. In this paper, we propose an enhanced maximum power point tracking (MPPT) method utilizing the state estimation by the sequential Monte Carlo (SMC) filtering which is assisted by the prediction of MPP via an artificial neural network (ANN). A state-space model for the sequential estimation of MPP is proposed in the framework of incremental conductance (I-C) MPPT approach, and the ANN model based on the observed voltage and current or irradiance data predicts the global MPP (GMPP) to refine the estimation by SMC. Moreover, a quick irrandiance change detection method is applied, such that the SMC-based MPPT method resorts to the assistance from ANN only when partial shading is detected. Simulation results show that the proposed enhanced MPPT method achieves high efficiency and is robust to rapid irradiance change under different noise levels.

arXiv:1805.04242

A Robust Circle-criterion Observer-based Estimator for Discrete-time Nonlinear Systems in the Presence of Sensor Attacks and Measurement Noise

We address the problem of robust state estimation of a class of discrete-time nonlinear systems with positive-slope nonlinearities when the sensors are corrupted by (potentially unbounded) attack signals and bounded measurement noise. We propose an observer-based estimator, using a bank of circle-criterion observers, which provides a robust estimate of the system state in spite of sensor attacks and measurement noise. We first consider the attack-free case where there is measurement noise and we provide a design method for a robust circle-criterion observer. Then, we consider the case when a sufficiently small subset of sensors are subject to attacks and all sensors are affected by measurement noise. We use our robust circle-criterion observer as the main ingredient in building an estimator that provides robust state estimation in this case. Finally, we propose an algorithm for isolating attacked sensors in the case of bounded measurement noise. We test this algorithm through simulations.

arXiv:1712.08659

Quickest Attack Detection in Smart Grid Based on Sequential Monte Carlo Filtering

Quick and accurate detection of cyber attack is key to the normal operation of the smart grid system. In this paper, a joint state estimation and sequential attack detection method for a given bus with grid frequency drift is proposed that utilizes the commonly monitored output voltage. In particular, based on a non-linear state-space model derived from the three-phase sinusoidal voltage equations, we employ the sequential Monte Carlo (SMC) filtering to estimate the system state. The output of the SMC filter is fed into a CUSUM test to detect the attack in a fastest way. Moreover, an adaptive sampling strategy is proposed to reduce the rate of taking measurements and communicating with the controller. Extensive simulation results demonstrate that the proposed method achieves high adaptivity and efficient detection of various types of attacks in power systems.

arXiv:1601.04458

Reducing local minima in fitness landscapes of parameter estimation by using piecewise evaluation and state estimation

Ordinary differential equations (ODE) are widely used for modeling in Systems Biology. As most commonly only some of the kinetic parameters are measurable or precisely known, parameter estimation techniques are applied to parametrize the model to experimental data. A main challenge for the parameter estimation is the complexity of the parameter space, especially its high dimensionality and local minima. Parameter estimation techniques consist of an objective function, measuring how well a certain parameter set describes the experimental data, and an optimization algorithm that optimizes this objective function. A lot of effort has been spent on developing highly sophisticated optimization algorithms to cope with the complexity in the parameter space, but surprisingly few articles address the influence of the objective function on the computational complexity in finding global optima. We extend a recently developed multiple shooting for stochastic systems (MSS) objective function for parameter estimation of stochastic models and apply it to parameter estimation of ODE models. This MSS objective function treats the intervals between measurement points separately. This separate treatment allows the ODE trajectory to stay closer to the data and we show that it reduces the complexity of the parameter space. We use examples from Systems Biology, namely a Lotka-Volterra model, a FitzHugh-Nagumo oscillator and a Calcium oscillation model, to demonstrate the power of the MSS approach for reducing the complexity and the number of local minima in the parameter space. The approach is fully implemented in the COPASI software package and, therefore, easily accessible for a wide community of researchers.

arXiv:1512.03077

On Computational Complexity Reduction Methods for Kalman Filter Extensions

The Kalman filter and its extensions are used in a vast number of aerospace and navigation applications for nonlinear state estimation of time series. In the literature, different approaches have been proposed to exploit the structure of the state and measurement models to reduce the computational demand of the algorithms. In this tutorial, we survey existing code optimization methods and present them using unified notation that allows them to be used with various Kalman filter extensions. We develop the optimization methods to cover a wider range of models, show how different structural optimizations can be combined, and present new applications for the existing optimizations. Furthermore, we present an example that shows that the exploitation of the structure of the problem can lead to improved estimation accuracy while reducing the computational load. This tutorial is intended for persons who are familiar with Kalman filtering and want to get insights for reducing the computational demand of different Kalman filter extensions.