Related papers: A Novel Unified Framework for Solving Reachability…
This paper investigates the problem of maintaining the safe operation of Waste-to-Energy (WtE) systems under operational constraints and uncertain waste inflows. We model this as a robust viability problem, formulated as a zero-sum…
The method of separation of variables is significant, it has been applied to physics, engineering , chemistry and other fields. It allows to reduce the diffculity of problems by separating the variables from partial differential equation…
This work proposes a notion of robust reachability of one set from another set under constant control. This notion is used to construct a control strategy, involving sequential set-to-set reachability, which guarantees robust global…
We establish a well-posedness and error-estimation framework that solves Hamilton-Jacobi equations by minimizing the least-squares residual of monotone finite-difference discretizations. This approach also applies naturally to second-order…
Reachable sets of nonlinear control systems can in general only be approximated numerically, and these approximations are typically very expensive to compute. In this paper, we explore a strategy for choosing the temporal and spatial…
This paper offers a new approach to modeling and forecasting of nonstationary time series with applications to volatility modeling for financial data. The approach is based on the assumption of local homogeneity: for every time point, there…
The hybrid optimal control problem with reach time to a target set is addressed and the continuity and uniqueness of the associated value function is proved. Hybrid systems involves interaction of different types of dynamics: continuous and…
Hamilton-Jacobi Reachability (HJR) analysis has been successfully used in many robotics and control tasks, and is especially effective in computing reach-avoid sets and control laws that enable an agent to reach a goal while satisfying…
In this paper, we propose an efficient sieving based secant method to address the computational challenges of solving sparse optimization problems with least-squares constraints. A level-set method has been introduced in [X. Li, D.F. Sun,…
We suggest an adaptive version of a partial linearization method for composite optimization problems. The goal function is the sum of a smooth function and a non necessary smooth convex separable function, whereas the feasible set is the…
In this paper we propose a novel regularization strategy for the local discontinuous Galerkin method to solve the Hamilton-Jacobi equation in the context of level-set reinitialization. The novel regularization idea works in analogy to…
We propose a method to obtain iterative schemes guarantee unique solutions for systems of partial differential equations that are not symmetric with respect to the time by generalizing He variational iteration method and using Banach fixed…
This article studies Gauss-Newton-type methods for over-determined systems to find solutions to bilevel programming problems. To proceed, we use the lower-level value function reformulation of bilevel programs and consider necessary…
We develop a formalism to study the use of Level Set Method (LSM) in the investigation of evolution of observables in terms of parameters of the Hamiltonian, both of the system itself and the control part. A simple example with an analytic…
In the framework of uncertainty quantification, we consider a quantity of interest which depends non-smoothly on the high-dimensional parameter representing the uncertainty. We show that, in this situation, the multilevel Monte Carlo…
We propose an extension of the discretization approaches for multilayer shallow water models, aimed at making them more flexible and efficient for realistic applications to coastal flows. A novel discretization approach is proposed, in…
One often wishes for the ability to formally analyze large-scale systems---typically, however, one can either formally analyze a rather small system or informally analyze a large-scale system. This work tries to further close this…
We consider a convexity constrained Hamilton-Jacobi-Bellman-type obstacle problem for the value function of a zero-sum differential game with asymmetric information. We propose a convexity-preserving probabilistic numerical scheme for the…
In this article, we propose a quasi-Newton method for unconstrained set optimization problems to find its weakly minimal solutions with respect to lower set-less ordering. The set-valued objective mapping under consideration is given by a…
We consider the problem of overbounding and underbounding both the backward and forward reachable set for a given polynomial vector field, nonlinear in both state and input, with a given semialgebriac set of initial conditions and with…