اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMin-Plus approaches and Cluster Based Pruning for Filtering in Nonlinear Systems
95
0
0.0
(
0
)
تأليف
Srinivas Sridharan
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The design of deterministic filters can be cast as a problem of minimizing an associated cost function for an optimal control problem. Employing the min-plus linearity property of the dynamic programming operator (associated with the control problem) results in a computationally feasible approach (while avoiding linearization of the system dynamics/output). This article describes the salient features of this approach and a specific form of pruning/projection, based on clustering, which serves to facilitate the numerical efficiency of these methods.
قيم البحث
اقرأ أيضاً
This article approaches deterministic filtering via an application of the min-plus linearity of the corresponding dynamic programming operator. This filter design method yields a set-valued state estimator for discrete-time nonlinear systems (nonline
ar dynamics and output functions). The energy bounds in the process and the measurement disturbances are modeled using a sum quadratic constraint. The filtering problem is recast into an optimal control problem in the form of a Hamilton-Jacobi-Bellman (HJB) equation, the solution to which is obtained by employing the min-plus linearity property of the dynamic programming operator. This approach enables the solution to the HJB equation and the design of the filter without recourse to linearization of the system dynamics/ output equation.
The control of bilinear systems has attracted considerable attention in the field of systems and control for decades, owing to their prevalence in diverse applications across science and engineering disciplines. Although much work has been conducted
on analyzing controllability properties, the mostly used tool remains the Lie algebra rank condition. In this paper, we develop alternative approaches based on theory and techniques in combinatorics to study controllability of bilinear systems. The core idea of our methodology is to represent vector fields of a bilinear system by permutations or graphs, so that Lie brackets are represented by permutation multiplications or graph operations, respectively. Following these representations, we derive combinatorial characterization of controllability for bilinear systems, which consequently provides novel applications of symmetric group and graph theory to control theory. Moreover, the developed combinatorial approaches are compatible with Lie algebra decompositions, including the Cartan and non-intertwining decomposition. This compatibility enables the exploitation of representation theory for analyzing controllability, which allows us to characterize controllability properties of bilinear systems governed by semisimple and reductive Lie algebras.
A robust (deterministic) filtering approach to the problem of optimal sensor selection is considered herein. For a given system with several sensors, at each time step the output of one of the sensors must be chosen in order to obtain the best state
estimate. We reformulate this problem in an optimal control framework which can then be solved using dynamic programming. In order to tackle the numerical computation of the solution in an efficient manner, we exploit the preservation of the min-plus structure of the optimal cost function when acted upon by the dynamic programming operator. This technique yields a grid free numerical approach to the problem. Simulations on an example problem serve to highlight the efficacy of this generalizable approach to robust multi-sensor state estimation.
Various particle filters have been proposed over the last couple of decades with the common feature that the update step is governed by a type of control law. This feature makes them an attractive alternative to traditional sequential Monte Carlo whi
ch scales poorly with the state dimension due to weight degeneracy. This article proposes a unifying framework that allows to systematically derive the McKean-Vlasov representations of these filters for the discrete time and continuous time observation case, taking inspiration from the smooth approximation of the data considered in Crisan & Xiong (2010) and Clark & Crisan (2005). We consider three filters that have been proposed in the literature and use this framework to derive It^{o} representations of their limiting forms as the approximation parameter $delta rightarrow 0$. All filters require the solution of a Poisson equation defined on $mathbb{R}^{d}$, for which existence and uniqueness of solutions can be a non-trivial issue. We additionally establish conditions on the signal-observation system that ensures well-posedness of the weighted Poisson equation arising in one of the filters.
Mixed-numerology transmission is proposed to support a variety of communication scenarios with diverse requirements. However, as the orthogonal frequency division multiplexing (OFDM) remains as the basic waveform, the peak-to average power ratio (PAP
R) problem is still cumbersome. In this paper, based on the iterative clipping and filtering (ICF) and optimization methods, we investigate the PAPR reduction in the mixed-numerology systems. We first illustrate that the direct extension of classical ICF brings about the accumulation of inter-numerology interference (INI) due to the repeated execution. By exploiting the clipping noise rather than the clipped signal, the noise-shaped ICF (NS-ICF) method is then proposed without increasing the INI. Next, we address the in-band distortion minimization problem subject to the PAPR constraint. By reformulation, the resulting model is separable in both the objective function and the constraints, and well suited for the alternating direction method of multipliers (ADMM) approach. The ADMM-based algorithms are then developed to split the original problem into several subproblems which can be easily solved with closed-form solutions. Furthermore, the applications of the proposed PAPR reduction methods combined with filtering and windowing techniques are also shown to be effective.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
