Content based providers transmits real time complex signal such as video data from one region to another. During this transmission process, the signals usually end up distorted or degraded where the actual information present in the video is lost. This normally happens in the streaming video services applications. Hence there is a need to know the level of degradation that happened in the receiver side. This video degradation can be estimated by network state parameters like data rate and packet loss values. Our proposed solution vQoS GAN (video Quality of Service Generative Adversarial Network) can estimate the network state parameters from the degraded received video data using a deep learning approach of semi supervised generative adversarial network algorithm. A robust and unique design of deep learning network model has been trained with the video data along with data rate and packet loss class labels and achieves over 95 percent of training accuracy. The proposed semi supervised generative adversarial network can additionally reconstruct the degraded video data to its original form for a better end user experience.
In vehicle dynamics control, many variables of interest cannot be directly measured, as sensors might be costly, fragile, or even not available. Therefore, real-time estimation techniques need to be used. The previous approach suffers from two main drawbacks: (i) the approximations due to model mismatch might jeopardize the performance of the final estimation-based control; (ii) each new estimator requires the calibration from scratch of a dedicated model. In this paper, we propose a twin-in-the-loop scheme, where the ad-hoc model is replaced by an accurate multibody simulator of the vehicle, typically available to vehicles manufacturers and suitable for the estimation of any onboard variable, coupled with a compensator within a closed-loop observer scheme. Given the black-box nature of the digital twin, a data-driven methodology for observer tuning is developed, based on Bayesian optimization. The effectiveness of the proposed estimation method for the estimation of vehicle states and forces, as compared to traditional model-based Kalman filtering, is experimentally shown on a dataset collected with a sports car.
This paper studies the optimal state estimation for a dynamic system, whose transfer function can be nonlinear and the input noise can be of arbitrary distribution. Our algorithm differs from the conventional extended Kalman filter (EKF) and the particle filter (PF) in that it estimates not only the state vector but also the Cramer-Rao bound (CRB), which serves as an accuracy indicator. Combining the state estimation, the CRB, and the incoming new measurement, the algorithm updates the state estimation according to the maximum likelihood (ML) criterion. To illustrate the effectiveness of the proposed method for autonomous driving, we apply it to estimate the position and velocity of a vehicle based on the noisy measurements of distance and Doppler offset. Simulation results show that the proposed algorithm can achieve estimation significantly more accurate than the standard EKF and the PF.
The free energy principle (FEP) from neuroscience provides a framework called active inference for the joint estimation and control of state space systems, subjected to colored noise. However, the active inference community has been challenged with the critical task of manually tuning the noise smoothness parameter. To solve this problem, we introduce a novel online noise smoothness estimator based on the idea of free energy principle. We mathematically show that our estimator can converge to the free energy optimum during smoothness estimation. Using this formulation, we introduce a joint state and noise smoothness observer design called DEMs. Through rigorous simulations, we show that DEMs outperforms state-of-the-art state observers with least state estimation error. Finally, we provide a proof of concept for DEMs by applying it on a real life robotics problem - state estimation of a quadrotor hovering in wind, demonstrating its practical use.
In this paper, we present a methodology for actuator and sensor fault estimation in nonlinear systems. The method consists in augmenting the system dynamics with an approximated ultra-local model (a finite chain of integrators) for the fault vector and constructing a Nonlinear Unknown Input Observer (NUIO) for the augmented dynamics. Then, fault reconstruction is reformulated as a robust state estimation problem in the augmented state (true state plus fault-related state). We provide sufficient conditions that guarantee the existence of the observer and stability of the estimation error dynamics (asymptotic stability of the origin in the absence of faults and ISS guarantees in the faulty case). Then, we cast the synthesis of observer gains as a semidefinite program where we minimize the L2-gain from the model mismatch induced by the approximated fault model to the fault estimation error. Finally, simulations are given to illustrate the performance of the proposed methodology.
This paper proposes a novel discrete-time multi-virus SIR (susceptible-infected-recovered) model that captures the spread of competing SIR epidemics over a population network. First, we provide a sufficient condition for the infection level of all the viruses over the networked model to converge to zero in exponential time. Second, we propose an observation model which captures the summation of all the viruses' infection levels in each node, which represents the individuals who are infected by different viruses but share similar symptoms. We present a sufficient condition for the model to be locally observable. We propose a Luenberger observer for the system state estimation and show via simulations that the estimation error of the Luenberger observer converges to zero before the viruses die out.
In this work, we revisit the Linear Quadratic Gaussian (LQG) optimal control problem from a behavioral perspective. Motivated by the suitability of behavioral models for data-driven control, we begin with a reformulation of the LQG problem in the space of input-output behaviors and obtain a complete characterization of the optimal solutions. In particular, we show that the optimal LQG controller can be expressed as a static behavioral-feedback gain, thereby eliminating the need for dynamic state estimation characteristic of state space methods. The static form of the optimal LQG gain also makes it amenable to its computation by gradient descent, which we investigate via numerical experiments. Furthermore, we highlight the advantage of this approach in the data-driven control setting of learning the optimal LQG controller from expert demonstrations.
This work studies remote state estimation of multiple linear time-invariant systems over shared wireless time-varying communication channels. We model the channel states by a semi-Markov process which captures both the random holding period of each channel state and the state transitions. The model is sufficiently general to be used in both fast and slow fading scenarios. We derive necessary and sufficient stability conditions of the multi-sensor-multi-channel system in terms of the system parameters. We further investigate how the delay of the channel state information availability and the holding period of channel states affect the stability. In particular, we show that, from a system stability perspective, fast fading channels may be preferable to slow fading ones.
We focus on Partial Differential Equation (PDE) based Data Assimilatio problems (DA) solved by means of variational approaches and Kalman filter algorithm. Recently, we presented a Domain Decomposition framework (we call it DD-DA, for short) performing a decomposition of the whole physical domain along space and time directions, and joining the idea of Schwarz' methods and parallel in time approaches. For effective parallelization of DD-DA algorithms, the computational load assigned to subdomains must be equally distributed. Usually computational cost is proportional to the amount of data entities assigned to partitions. Good quality partitioning also requires the volume of communication during calculation to be kept at its minimum. In order to deal with DD-DA problems where the observations are nonuniformly distributed and general sparse, in the present work we employ a parallel load balancing algorithm based on adaptive and dynamic defining of boundaries of DD -- which is aimed to balance workload according to data location. We call it DyDD. As the numerical model underlying DA problems arising from the so-called discretize-then-optimize approach is the constrained least square model (CLS), we will use CLS as a reference state estimation problem and we validate DyDD on different scenarios.
Time-scale theory, due to its ability to unify the continuous and discrete cases, allows handling intractable non-uniform measurements, such as intermittent received signals. In this work, we address the state estimation problem of a vibration-induced intermittent optical wireless communication (OWC) system by designing a Kalman filter on time scales. First, the algorithm of the time-scale Kalman filter is introduced and a numerical example is given for illustration. Then the studied intermittent OWC system is presented, and experimental data are collected to determine the time scale's form, which has bounded graininess (a.k.a, bounded time jumps). Finally, we design a Kalman filter on the previously defined time scale for the intermittent OWC system and critically analyzed its estimation performance. Moreover, the obtained conclusions are further validated on a reference system. The simulation results corroborate that the time-scale Kalman filtering technique is considerably promising to solve the state estimation problem with non-uniform measurements. This study reveals for the first time the feasibility of applying the time-scale Kalman filter theory to practical applications.
Understanding of deformable object manipulations such as textiles is a challenge due to the complexity and high dimensionality of the problem. Particularly, the lack of a generic representation of semantic states (e.g., \textit{crumpled}, \textit{diagonally folded}) during a continuous manipulation process introduces an obstacle to identify the manipulation type. In this paper, we aim to solve the problem of semantic state estimation in cloth manipulation tasks. For this purpose, we introduce a new large-scale fully-annotated RGB image dataset showing various human demonstrations of different complicated cloth manipulations. We provide a set of baseline deep networks and benchmark them on the problem of semantic state estimation using our proposed dataset. Furthermore, we investigate the scalability of our semantic state estimation framework in robot monitoring tasks of long and complex cloth manipulations.
State estimation is required whenever we deal with high-dimensional dynamical systems, as the complete measurement is often unavailable. It is key to gaining insight, performing control or optimizing design tasks. Most deep learning-based approaches require high-resolution labels and work with fixed sensor locations, thus being restrictive in their scope. Also, doing Proper orthogonal decomposition (POD) on sparse data is nontrivial. To tackle these problems, we propose a technique with an implicit optimization layer and a physics-based loss function that can learn from sparse labels. It works by minimizing the energy of the neural network prediction, enabling it to work with a varying number of sensors at different locations. Based on this technique we present two models for discrete and continuous prediction in space. We demonstrate the performance using two high-dimensional fluid problems of Burgers' equation and Flow Past Cylinder for discrete model and using Allen Cahn equation and Convection-diffusion equations for continuous model. We show the models are also robust to noise in measurements.
This paper addresses the problem of distributed state estimation via multiple access channels (MACs). We consider a scenario where two encoders are simultaneously communicating their measurements through a noisy channel. Firstly, the zero-error capacity region of the general M-input, single-output MAC is characterized using tools from nonstochastic information theory. Next, we show that a tight condition to be able to achieve uniformly bounded state estimation errors can be given in terms of the channel zero-error capacity region. This criterion relates the channel properties to the plant dynamics. These results pave the way towards understanding information flows in networked control systems with multiple transmitters.
This paper shows that self-supervised visual pre-training from real-world images is effective for learning motor control tasks from pixels. We first train the visual representations by masked modeling of natural images. We then freeze the visual encoder and train neural network controllers on top with reinforcement learning. We do not perform any task-specific fine-tuning of the encoder; the same visual representations are used for all motor control tasks. To the best of our knowledge, this is the first self-supervised model to exploit real-world images at scale for motor control. To accelerate progress in learning from pixels, we contribute a benchmark suite of hand-designed tasks varying in movements, scenes, and robots. Without relying on labels, state-estimation, or expert demonstrations, we consistently outperform supervised encoders by up to 80% absolute success rate, sometimes even matching the oracle state performance. We also find that in-the-wild images, e.g., from YouTube or Egocentric videos, lead to better visual representations for various manipulation tasks than ImageNet images.
Short-term load forecasting is an essential task that supports utilities to schedule generating sufficient power for balancing supply and demand, and can become an attractive target for cyber attacks. It has been shown that the power system state estimation is vulnerable to false data injection attacks. Similarly, false data injection on input variables can result in large forecast errors. The load forecasting system should have a protective mechanism to mitigate such attacks. One approach is to model physical system constraints that would identify anomalies. This study investigates possible constraints associated with a load forecasting application. Looking at regional forecasted loads, we analyze the relation between each zone through similarity measures used in time series in order to identify constraints. Comprehensive results for historical ERCOT load data indicate variation in the measures recognizing the existence of malicious action. Still, these static measures can not be considered an efficient index across different scenarios.
Liquid state estimation is important for robotics tasks such as pouring; however, estimating the state of transparent liquids is a challenging problem. We propose a novel segmentation pipeline that can segment transparent liquids such as water from a static, RGB image without requiring any manual annotations or heating of the liquid for training. Instead, we use a generative model that is capable of translating images of colored liquids into synthetically generated transparent liquid images, trained only on an unpaired dataset of colored and transparent liquid images. Segmentation labels of colored liquids are obtained automatically using background subtraction. Our experiments show that we are able to accurately predict a segmentation mask for transparent liquids without requiring any manual annotations. We demonstrate the utility of transparent liquid segmentation in a robotic pouring task that controls pouring by perceiving the liquid height in a transparent cup. Accompanying video and supplementary materials can be found
Accurate kinodynamic models play a crucial role in many robotics applications such as off-road navigation and high-speed driving. Many state-of-the-art approaches in learning stochastic kinodynamic models, however, require precise measurements of robot states as labeled input/output examples, which can be hard to obtain in outdoor settings due to limited sensor capabilities and the absence of ground truth. In this work, we propose a new technique for learning neural stochastic kinodynamic models from noisy and indirect observations by performing simultaneous state estimation and dynamics learning. The proposed technique iteratively improves the kinodynamic model in an expectation-maximization loop, where the E Step samples posterior state trajectories using particle filtering, and the M Step updates the dynamics to be more consistent with the sampled trajectories via stochastic gradient ascent. We evaluate our approach on both simulation and real-world benchmarks and compare it with several baseline techniques. Our approach not only achieves significantly higher accuracy but is also more robust to observation noise, thereby showing promise for boosting the performance of many other robotics applications.
We consider belief propagation (BP) as an efficient and scalable tool for state estimation and optimization problems in supply networks such as power grids. BP algorithms make use of factor graph representations, whose assignment to the problem of interest is not unique. It depends on the state variables and their mutual interdependencies. Many short loops in factor graphs may impede the accuracy of BP. We propose a systematic way to cluster loops of naively assigned factor graphs such that the resulting transformed factor graphs have no additional loops as compared to the original network. They guarantee an accurate performance of BP with only slightly increased computational effort, as we demonstrate by a concrete and realistic implementation for power grids. The method outperforms existing alternatives to handle the loops. We point to other applications to supply networks such as gas-pipeline or other flow networks that share the structure of constraints in the form of analogues to Kirchhoff's laws. Whenever small and abundant loops in factor graphs are systematically generated by constraints between variables in the original network, our factor-graph assignment in BP complements other approaches. It provides a fast and reliable algorithm to perform marginalization in tasks like state determination, estimation, or optimization issues in supply networks.
This contribution proposes a recursive set-membership method for the ellipsoidal state characterization for discrete-time linear time-varying models with additive unknown disturbances vectors, bounded by possibly degenerate zonotopes and polytopes, impacting respectively, the state evolution equation and the sporadic measurement vectors, which are expressed as linear inequality and equality constraints on the state vector. New algorithms are designed considering the unprecedented fact that, due to equality constraints, the shape matrix of the ellipsoid characterizing all possible values of the state vector is non invertible. The two main size minimizing criteria (volume and sum of squared axes lengths) are examined in the time update step and also in the observation updating, in addition to a third one, minimizing some error norm and ensuring the input-to-state stability of the estimation error. The author's papers [1] and [2] were combined into this longer, more comprehensive version. It includes all the proofs and a few images and is meant to be a support for the reader. There is no introduction, no conclusion, and no application examples.
Laser photocoagulation is a technique applied in the treatment of retinal diseases. While this is often done manually or using simple control schemes, we pursue an optimization-based approach, namely Model Predictive Control (MPC), to enforce bounds on the peak temperature and, thus, safety during the medical treatment procedure - despite the spot-dependent absorption of the tissue. To this end, a repetition rate of 1 kHz is desirable rendering the real-time requirements a major challenge. We present a tailored MPC scheme using parametric model reduction, an extended Kalman filter for the parameter and state estimation, and suitably constructed stage costs and verify its applicability both in simulation and experiments with porcine eyes. Moreover, we give some insight on the implementation specifically tailored for fast numerical computations.