PyTorchKR Papers

최신 논문

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

카테고리 탐색

로그인 후 이 태그 구독

arXiv:2209.04399

Restoring AC Power Flow Feasibility from Relaxed and Approximated Optimal Power Flow Models

To address computational challenges associated with power flow nonconvexities, significant research efforts over the last decade have developed convex relaxations and approximations of optimal power flow (OPF) problems. However, benefits associated with the convexity of these relaxations and approximations can have tradeoffs in terms of solution accuracy since they may yield voltage phasors that are inconsistent with the power injections and line flows, limiting their usefulness for some applications. Inspired by state estimation (SE) techniques, this paper proposes a new method for obtaining an AC power flow feasible point from the solution to a relaxed or approximated optimal power flow (OPF) problem. By treating the inconsistent voltage phasors, power injections, and line flows analogously to noisy measurements in a state estimation algorithm, the proposed method yields power injections and voltage phasors that are feasible with respect to the AC power flow equations while incorporating information from many quantities in the solution to a relaxed or approximated OPF problem. We improve this method by adjusting weighting terms with an approach inspired by algorithms used to train machine learning models. We demonstrate the proposed method using several relaxations and approximations. The results show up to several orders of magnitude improvement in accuracy over traditional methods.

arXiv:2209.03666공식 코드 · Papers with Code

R$^3$LIVE++: A Robust, Real-time, Radiance reconstruction package with a tightly-coupled LiDAR-Inertial-Visual state Estimator

Simultaneous localization and mapping (SLAM) are crucial for autonomous robots (e.g., self-driving cars, autonomous drones), 3D mapping systems, and AR/VR applications. This work proposed a novel LiDAR-inertial-visual fusion framework termed R$^3$LIVE++ to achieve robust and accurate state estimation while simultaneously reconstructing the radiance map on the fly. R$^3$LIVE++ consists of a LiDAR-inertial odometry (LIO) and a visual-inertial odometry (VIO), both running in real-time. The LIO subsystem utilizes the measurements from a LiDAR for reconstructing the geometric structure (i.e., the positions of 3D points), while the VIO subsystem simultaneously recovers the radiance information of the geometric structure from the input images. R$^3$LIVE++ is developed based on R$^3$LIVE and further improves the accuracy in localization and mapping by accounting for the camera photometric calibration (e.g., non-linear response function and lens vignetting) and the online estimation of camera exposure time. We conduct more extensive experiments on both public and our private datasets to compare our proposed system against other state-of-the-art SLAM systems. Quantitative and qualitative results show that our proposed system has significant improvements over others in both accuracy and robustness. In addition, to demonstrate the extendability of our work, {we developed several applications based on our reconstructed radiance maps, such as high dynamic range (HDR) imaging, virtual environment exploration, and 3D video gaming.} Lastly, to share our findings and make contributions to the community, we make our codes, hardware design, and dataset publicly available on our Github: github.com/hku-mars/r3live

arXiv:2209.02848

Traffic State Estimation for Connected Vehicles using the Second-Order Aw-Rascle-Zhang Traffic Model

This paper addresses the problem of traffic state estimation (TSE) in the presence of heterogeneous sensors which include both fixed and moving sensors. Traditional fixed sensors are expensive and cannot be installed throughout the highway. Moving sensors such as Connected Vehicles (CVs) offer a relatively cheap alternative to measure traffic states across the network. Moving forward it is thus important to develop such models that effectively use the data from CVs. One such model is the nonlinear second-order Aw-Rascle-Zhang (ARZ) model which is a realistic traffic model, reliable for TSE and control. A state-space formulation is presented for the ARZ model considering junctions in the formulation which is important to model real highways with ramps. A Moving Horizon Estimation (MHE) implementation is presented for TSE using a linearized ARZ model. Various state-estimation methods used for TSE in the literature along with the presented approach are compared with regard to accuracy and computational tractability with the help of a numerical study using the VISSIM traffic simulation software. The impact of various strategies for querying CV data on the estimation performance is also considered. Several research questions are posed and addressed with a thorough analysis of the results.

arXiv:2209.01703

Recursive Gaussian Process over graphs for Integrating Multi-timescale Measurements in Low-Observable Distribution Systems

The transition to a smarter grid is empowered by enhanced sensor deployments and smart metering infrastructure in the distribution system. Measurements from these sensors and meters can be used for many applications, including distribution system state estimation (DSSE). However, these measurements are typically sampled at different rates and could be intermittent due to losses during the aggregation process. These multi time-scale measurements should be reconciled in real-time to perform accurate grid monitoring. This paper tackles this problem by formulating a recursive multi-task Gaussian process (RGP-G) approach that sequentially aggregates sensor measurements. Specifically, we formulate a recursive multi-task GP with and without network connectivity information to reconcile the multi time-scale measurements in distribution systems. The proposed framework is capable of aggregating the multi-time scale measurements batch-wise or in real-time. Following the aggregation of the multi time-scale measurements, the spatial states of the consistent time-series are estimated using matrix completion based DSSE approach. Simulation results on IEEE 37 and IEEE 123 bus test systems illustrate the efficiency of the proposed methods from the standpoint of both multi time-scale data aggregation and DSSE.

arXiv:2209.00089

Analytic solution of the exact Daum-Huang flow equation for particle filters

State estimation for nonlinear systems, especially in high dimensions, is a generally intractable problem, despite the ever-increasing computing power. Efficient algorithms usually apply a finite-dimensional model for approximating the probability density of the state vector or treat the estimation problem numerically. In 2007 Daum and Huang introduced a novel particle filter approach that uses a homotopy-induced particle flow for the Bayesian update step. Multiple types of particle flows were derived since with different properties. The exact flow considered in this work is a first-order linear ordinary time-varying inhomogeneous differential equation for the particle motion. An analytic solution in the interval [0,1] is derived for the scalar measurement case, which enables significantly faster computation of the Bayesian update step for particle filters.

arXiv:2208.12288

Neuro-Dynamic State Estimation for Networked Microgrids

We devise neuro-dynamic state estimation (Neuro-DSE), a learning-based dynamic state estimation (DSE) algorithm for networked microgrids (NMs) under unknown subsystems. Our contributions include: 1) a data-driven Neuro-DSE algorithm for NMs DSE with partially unidentified dynamic models, which incorporates the neural-ordinary-differential-equations (ODE-Net) into Kalman filters; 2) a self-refining Neuro-DSE algorithm (Neuro-DSE+) which enables data-driven DSE under limited and noisy measurements by establishing an automatic filtering, augmenting and correcting framework; 3) a Neuro-KalmanNet-DSE algorithm which further integrates KalmanNet with Neuro-DSE to relieve the model mismatch of both neural- and physics-based dynamic models; and 4) an augmented Neuro-DSE for joint estimation of NMs states and unknown parameters (e.g., inertia). Extensive case studies demonstrate the efficacy of Neuro-DSE and its variants under different noise levels, control modes, power sources, observabilities and model knowledge, respectively.

arXiv:2208.10588

Widely-Linear MMSE Estimation of Complex-Valued Graph Signals

In this paper, we consider the problem of recovering random graph signals with complex values. For general Bayesian estimation of complex-valued vectors, it is known that the widely-linear minimum mean-squared-error (WLMMSE) estimator can achieve a lower mean-squared-error (MSE) than that of the linear minimum MSE (LMMSE) estimator. Inspired by the WLMMSE estimator, in this paper we develop the graph signal processing (GSP)-WLMMSE estimator, which minimizes the MSE among estimators that are represented as a two-channel output of a graph filter, i.e. widely-linear GSP estimators. We discuss the properties of the proposed GSP-WLMMSE estimator. In particular, we show that the MSE of the GSP-WLMMSE estimator is always equal to or lower than the MSE of the GSP-LMMSE estimator. The GSP-WLMMSE estimator is based on diagonal covariance matrices in the graph frequency domain, and thus has reduced complexity compared with the WLMMSE estimator. This property is especially important when using the sample-mean versions of these estimators that are based on a training dataset. We then state conditions under which the low-complexity GSP-WLMMSE estimator coincides with the WLMMSE estimator. In the simulations, we investigate two synthetic estimation problems (with linear and nonlinear models) and the problem of state estimation in power systems. For these problems, it is shown that the GSP-WLMMSE estimator outperforms the GSP-LMMSE estimator and achieves similar performance to that of the WLMMSE estimator.

arXiv:2208.10060

Abstraction-Free Control Synthesis to Satisfy Temporal Logic Constraints under Sensor Faults and Attacks

We study the problem of synthesizing a controller to satisfy a complex task in the presence of sensor faults and attacks. We model the task using Gaussian distribution temporal logic (GDTL), and propose a solution approach that does not rely on computing any finite abstraction to model the system. We decompose the GDTL specification into a sequence of reach-avoid sub-tasks. We develop a class of fault-tolerant finite time convergence control barrier functions (CBFs) to guarantee that a dynamical system reaches a set within finite time almost surely in the presence of malicious attacks. We use the fault-tolerant finite time convergence CBFs to guarantee the satisfaction of `reach' property. We ensure `avoid' part in each sub-task using fault-tolerant zeroing CBFs. These fault-tolerant CBFs formulate a set of linear constraints on the control input for each sub-task. We prove that if the error incurred by system state estimation is bounded by a certain threshold, then our synthesized controller fulfills each reach-avoid sub-task almost surely for any possible sensor fault and attack, and thus the GDTL specification is satisfied with probability one. We demonstrate our proposed approach using a numerical study on the coordination of two wheeled mobile robots.

arXiv:2208.08825

Dynamic State Estimation-Based Protection for Induction Motor Loads

Ensuring protective device coordination is critical to maintain the resilience and improve the reliability of large microgrids. Inverter-interfaced generation, however, poses significant challenges when designing protection systems. Traditional time-overcurrent protective devices are unsuitable on account of the lack of fault current. Present industry practice is to force all inverters to shut down during faults, which prevents large microgrids from operating in a resilient and reliable manner. Dynamic state estimation (DSE) has been proposed for line protection, and more recently for the protection of load buses or downstream radial portions of microgrids. However, only passive loads with series resistive-inductive loads have been tested with DSE, even though the behavior of dynamic loads -- such as induction motors or power electronics -- may differ significantly during faults. This paper considers the case of applying DSE to protecting a load bus serving a three-phase induction motor.

arXiv:2208.07469

Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing

Many fundamental low-rank optimization problems, such as matrix completion, phase synchronization/retrieval, power system state estimation, and robust PCA, can be formulated as the matrix sensing problem. Two main approaches for solving matrix sensing are based on semidefinite programming (SDP) and Burer-Monteiro (B-M) factorization. The SDP method suffers from high computational and space complexities, whereas the B-M method may return a spurious solution due to the non-convexity of the problem. The existing theoretical guarantees for the success of these methods have led to similar conservative conditions, which may wrongly imply that these methods have comparable performances. In this paper, we shed light on some major differences between these two methods. First, we present a class of structured matrix completion problems for which the B-M methods fail with an overwhelming probability, while the SDP method works correctly. Second, we identify a class of highly sparse matrix completion problems for which the B-M method works and the SDP method fails. Third, we prove that although the B-M method exhibits the same performance independent of the rank of the unknown solution, the success of the SDP method is correlated to the rank of the solution and improves as the rank increases. Unlike the existing literature that has mainly focused on those instances of matrix sensing for which both SDP and B-M work, this paper offers the first result on the unique merit of each method over the alternative approach.

arXiv:2208.06683

Inverse Extended Kalman Filter -- Part II: Highly Non-Linear and Uncertain Systems

Counter-adversarial system design problems have lately motivated the development of inverse Bayesian filters. For example, inverse Kalman filter (I-KF) has been recently formulated to estimate the adversary's Kalman-filter-tracked estimates and hence, predict the adversary's future steps. The purpose of this paper and the companion paper (Part I) is to address the inverse filtering problem in non-linear systems by proposing an inverse extended Kalman filter (I-EKF). The companion paper proposed the theory of I-EKF (with and without unknown inputs) and I-KF (with unknown inputs). In this paper, we develop this theory for highly non-linear models, which employ second-order, Gaussian sum, and dithered forward EKFs. In particular, we derive theoretical stability guarantees for the inverse second-order EKF using the bounded non-linearity approach. To address the limitation of the standard I-EKFs that the system model and forward filter are perfectly known to the defender, we propose reproducing kernel Hilbert space-based EKF to learn the unknown system dynamics based on its observations, which can be employed as an inverse filter to infer the adversary's estimate. Numerical experiments demonstrate the state estimation performance of the proposed filters using recursive Cram\'{e}r-Rao lower bound as a benchmark.

arXiv:2208.06395

OUTformation: Distributed Data-Gathering with Feedback under Unknown Environment and Communication Delay Constraints

Towards the informed design of large-scale distributed data-gathering architectures under real-world assumptions such as nonzero communication delays and unknown environment dynamics, this paper considers the effects of allowing feedback communication from the central processor to external sensors. Using simple but representative state-estimation examples, we investigate fundamental tradeoffs between the mean-squared error (MSE) of the central processor's estimate of the environment state, and the total power expenditure per sensor under more conventional architectures without feedback (INformation) versus those with broadcast feedback (OUTformation). The primary advantage of enabling feedback is that each sensor's understanding of the central processor's estimate improves, which enables each sensor to determine when and what parts of its current observations to transmit. We use theory to demonstrate conditions in which OUTformation maintains the same MSE as INformation with less power expended on average, and conditions in which OUTformation obtains less MSE than INformation at additional power cost. These performance tradeoffs are also considered under settings where environments undergo less variation, and sensors implement random backoff times to prevent transmission collisions. Our results are supported via numerical studies, which show that the properties derived in theory still hold even when some of the simplifying assumptions are removed.

논문 ID: document/9582618

Traffic state data imputation: An efficient generating method based on the graph aggregator

Road traffic state estimation is an essential component of intelligent transportation systems (ITSs). However, road traffic state data collected by traffic detectors are often incomplete, which can cause problems across a variety of transportation applications, such as traffic state prediction and pattern recognition. We present GA-GAN (Graph Aggregate Generative Adversarial Network), consisting of graph sample and aggregate (GraphSAGE) and a generative adversarial network (GAN), to impute missing road traffic state data. Instead of using the original road network structure, which presents the spatial information to process a graph operation, we reconstruct the road network according to the correlation coefficients of road historical data. We utilize GraphSAGE to aggregate the temporal-spatial information from the neighbors of each road in the reconstructed road network. GAN is used to generate complete traffic state data from the extracted temporal-spatial information to achieve traffic state data imputation. To illustrate the efficient performance of the model, experiments are conducted on traffic data collected from California and Seattle, Washington, showing that the proposed model outperforms stateof-the-art methods.

arXiv:2208.05944

Barrier Certificate based Safe Control for LiDAR-based Systems under Sensor Faults and Attacks

Autonomous Cyber-Physical Systems (CPS) fuse proprioceptive sensors such as GPS and exteroceptive sensors including Light Detection and Ranging (LiDAR) and cameras for state estimation and environmental observation. It has been shown that both types of sensors can be compromised by malicious attacks, leading to unacceptable safety violations. We study the problem of safety-critical control of a LiDAR-based system under sensor faults and attacks. We propose a framework consisting of fault tolerant estimation and fault tolerant control. The former reconstructs a LiDAR scan with state estimations, and excludes the possible faulty estimations that are not aligned with LiDAR measurements. We also verify the correctness of LiDAR scans by comparing them with the reconstructed ones and removing the possibly compromised sector in the scan. Fault tolerant control computes a control signal with the remaining estimations at each time step. We prove that the synthesized control input guarantees system safety using control barrier certificates. We validate our proposed framework using a UAV delivery system in an urban environment. We show that our proposed approach guarantees safety for the UAV whereas a baseline fails.

arXiv:2208.04883

Neural-Rendezvous: Provably Robust Guidance and Control to Encounter Interstellar Objects

Interstellar objects (ISOs) are likely representatives of primitive materials invaluable in understanding exoplanetary star systems. Due to their poorly constrained orbits with generally high inclinations and relative velocities, however, exploring ISOs with conventional human-in-the-loop approaches is significantly challenging. This paper presents Neural-Rendezvous -- a deep learning-based guidance and control framework for encountering fast-moving objects, including ISOs, robustly, accurately, and autonomously in real time. It uses pointwise minimum norm tracking control on top of a guidance policy modeled by a spectrally-normalized deep neural network, where its hyperparameters are tuned with a loss function directly penalizing the MPC state trajectory tracking error. We show that Neural-Rendezvous provides a high probability exponential bound on the expected spacecraft delivery error, the proof of which leverages stochastic incremental stability analysis. In particular, it is used to construct a non-negative function with a supermartingale property, explicitly accounting for the ISO state uncertainty and the local nature of nonlinear state estimation guarantees. In numerical simulations, Neural-Rendezvous is demonstrated to satisfy the expected error bound for 100 ISO candidates. This performance is also empirically validated using our spacecraft simulator and in high-conflict and distributed UAV swarm reconfiguration with up to 20 UAVs.

arXiv:2208.00584

A sensitivity-based approach to optimal sensor selection for process networks

Sensor selection is critical for state estimation, control and monitoring of nonlinear processes. However, evaluating the performance of each possible combination of $m$ out of $n$ sensors is impractical unless $m$ and $n$ are small. In this paper, we propose a sensitivity-based approach to determine the minimum number of sensors and their optimal locations for state estimation. The local sensitivity matrix of the measured outputs to initial states is used as a measure of the observability. The minimum number of sensors is determined in a way such that the local sensitivity matrix is full column rank. The subset of sensors that satisfies the full-rank condition and provides the maximum degree of observability is considered as the optimal sensor placement. Successive orthogonalization of the sensitivity matrix is conducted in the proposed approach to significantly reduce the computational complexity in selecting the sensors. To validate the effectiveness of the proposed method, it is applied to two processes including a chemical process consisting of four continuous stirred-tank reactors and a wastewater treatment plant. In both cases, the proposed approach can obtain the optimal sensor subsets.

arXiv:2208.00278공식 코드 · Papers with Code

Robust Contact State Estimation in Humanoid Walking Gaits

In this article, we propose a deep learning framework that provides a unified approach to the problem of leg contact detection in humanoid robot walking gaits. Our formulation accomplishes to accurately and robustly estimate the contact state probability for each leg (i.e., stable or slip/no contact). The proposed framework employs solely proprioceptive sensing and although it relies on simulated ground-truth contact data for the classification process, we demonstrate that it generalizes across varying friction surfaces and different legged robotic platforms and, at the same time, is readily transferred from simulation to practice. The framework is quantitatively and qualitatively assessed in simulation via the use of ground-truth contact data and is contrasted against state of-the-art methods with an ATLAS, a NAO, and a TALOS humanoid robot. Furthermore, its efficacy is demonstrated in base estimation with a real TALOS humanoid. To reinforce further research endeavors, our implementation is offered as an open-source ROS/Python package, coined Legged Contact Detection (LCD).

arXiv:2207.14674

Enhanced Laser-Scan Matching with Online Error Estimation for Highway and Tunnel Driving

Lidar data can be used to generate point clouds for the navigation of autonomous vehicles or mobile robotics platforms. Scan matching, the process of estimating the rigid transformation that best aligns two point clouds, is the basis for lidar odometry, a form of dead reckoning. Lidar odometry is particularly useful when absolute sensors, like GPS, are not available. Here we propose the Iterative Closest Ellipsoidal Transform (ICET), a scan matching algorithm which provides two novel improvements over the current state-of-the-art Normal Distributions Transform (NDT). Like NDT, ICET decomposes lidar data into voxels and fits a Gaussian distribution to the points within each voxel. The first innovation of ICET reduces geometric ambiguity along large flat surfaces by suppressing the solution along those directions. The second innovation of ICET is to infer the output error covariance associated with the position and orientation transformation between successive point clouds; the error covariance is particularly useful when ICET is incorporated into a state-estimation routine such as an extended Kalman filter. We constructed a simulation to compare the performance of ICET and NDT in 2D space both with and without geometric ambiguity and found that ICET produces superior estimates while accurately predicting solution accuracy.

arXiv:2207.12150

Moving-Horizon State Estimation for Power Networks and Synchronous Generators

Power network and generators state estimation are usually tackled as separate problems. We propose a dynamic scheme for the simultaneous estimation of the network and the generator states. The estimation is formulated as an optimization problem on a moving-horizon of past observations. The framework is a generalization of static state estimation; it can handle incomplete model knowledge and does not require static network observability by PMUs. The numerical results show an improved estimation accuracy compared to static state estimation. Moreover, accurate estimation of the internal states of generators without PMUs on their terminals can be achieved. Finally, we highlight the capability of the proposed estimator to detect and identify bad data.

arXiv:2207.11356

Split Happens! Imprecise and Negative Information in Gaussian Mixture Random Finite Set Filtering

In object tracking and state estimation problems, ambiguous evidence such as imprecise measurements and the absence of detections can contain valuable information and thus be leveraged to further refine the probabilistic belief state. In particular, knowledge of a sensor's bounded field-of-view can be exploited to incorporate evidence of where an object was not observed. This paper presents a systematic approach for incorporating knowledge of the field-of-view geometry and position and object inclusion/exclusion evidence into object state densities and random finite set multi-object cardinality distributions. The resulting state estimation problem is nonlinear and solved using a new Gaussian mixture approximation based on recursive component splitting. Based on this approximation, a novel Gaussian mixture Bernoulli filter for imprecise measurements is derived and demonstrated in a tracking problem using only natural language statements as inputs. This paper also considers the relationship between bounded fields-of-view and cardinality distributions for a representative selection of multi-object distributions, which can be used for sensor planning, as is demonstrated through a problem involving a multi-Bernoulli process with up to one-hundred potential objects.