Related papers: Construction of the Minimum Time Function Via Reac…
Recently, significant connections between compressed sensing problems and optimization of a particular class of functions relating to solutions of Hamilton-Jacobi equation was discovered. In this paper we introduce a fast approximate…
This paper describes the reachable set and resolves an optimal control problem for the scalar conservation laws with discontinuous flux. We give a necessary and sufficient criteria for the reachable set. A new backward resolution has been…
In this paper, approximate Linear Minimum Variance (LMV) filters for continuous-discrete state space models are introduced. The filters are obtained by means of a recursive approximation to the predictions for the first two moments of the…
This paper considers scheduling on identical machines. The scheduling objective considered in this paper generalizes most scheduling minimization problems. In the problem, there are $n$ jobs and each job $j$ is associated with a…
When designing optimal controllers for any system, it is often the case that the true state of the system is unknown to the controller, for example due to noisy measurements or partially observable states. Incomplete state information must…
We present effective numerical algorithms for locally recovering unknown governing differential equations from measurement data. We employ a set of standard basis functions, e.g., polynomials, to approximate the governing equation with high…
In this paper, we address two minimal controllability problems, where the goal is to determine a minimal subset of state variables in a linear time-invariant system to be actuated to ensure controllability under additional constraints.…
A new notion of metric differentiability of set-valued functions at a point is introduced in terms of right and left limits of special set-valued metric divided differences of first order. A local metric linear approximant of a metrically…
In this paper we consider the coupled task scheduling problem with exact delay times on a single machine with the objective of minimizing the total completion time of the jobs. We provide constant-factor approximation algorithms for several…
Fixpoints are ubiquitous in computer science and when dealing with quantitative semantics and verification one often considers least fixpoints of (higher-dimensional) functions over the non-negative reals. We show how to approximate the…
Moment optimization techniques have been recently proposed to solve globally various classes of optimal control problems. As those methods return truncated moment sequences of occupation measures, this paper explores a numeric method for…
One of the most important problems in hybrid systems is the {\em reachability problem}. The reachability problem has been shown to be undecidable even for a subclass of {\em linear} hybrid systems. In view of this, the main focus in the…
We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of…
The minimization of energy-like cost functionals is addressed in the context of optimal control problems. For a general class of dynamical systems, with possibly unstable and nonlinear free dynamics, it is shown that a sequence of solutions…
In this paper, numerical analysis is carried out for a class of history-dependent variational-hemivariational inequalities arising in contact problems. Three different numerical treatments for temporal discretization are proposed to…
We consider a control-constrained optimal control problem subject to time-harmonic Maxwell's equations; the control variable belongs to a finite-dimensional set and enters the state equation as a coefficient. We derive existence of optimal…
Numerical methods for developing port-Hamiltonian representations of general linear time-invariant systems are studied. The approach extends previous port-Hamiltonian characterizations to include the general non-minimal case and the case…
Boolean programs with multiple recursive threads can be captured as pushdown automata with multiple stacks. This model is Turing complete, and hence, one is often interested in analyzing a restricted class that still captures useful…
This work is focused on the application of functional-type a posteriori error estimates and corresponding indicators to a class of time-dependent problems. We consider the algorithmic part of their derivation and implementation and also…
Reachability analysis is a formal method to guarantee safety of dynamical systems under the influence of uncertainties. A substantial bottleneck of all reachability algorithms is the necessity to adequately tune specific algorithm…