Loading [MathJax]/extensions/MathZoom.js
This article is the starting point of a series of works whose aim is the study of deterministic control problems where the dynamic and the running cost can be completely different in two (or more) complementary domains of the space ℝN. As a consequence, the dynamic and running cost present discontinuities at the boundary of these domains and this is the main difficulty of this type of problems. We address these questions by using a Bellman approach: our aim is to investigate how to define properly...
A deterministic affine-quadratic optimal control problem is considered. Due to the nature of the problem, optimal controls exist under some very mild conditions. Further, it is shown that under some assumptions, the optimal control is unique which leads to the differentiability of the value function. Therefore, the value function satisfies the corresponding Hamilton–Jacobi–Bellman equation in the classical sense, and the optimal control admits a state feedback representation. Under some additional...
We provide a deterministic-control-based interpretation for a broad class of fully nonlinear parabolic and elliptic PDEs with continuous Neumann boundary conditions in a smooth domain. We construct families of two-person games depending on a small parameter ε which extend those proposed by Kohn and Serfaty [21]. These new games treat a Neumann boundary condition by introducing some specific rules near the boundary. We show that the value function converges, in the viscosity sense, to the solution...
An approach for solving inverse problems involving obstacles is proposed.
The approach uses a level-set method which has been shown to be effective
in treating problems of moving boundaries, particularly those that involve
topological changes in the geometry.
We develop two computational methods based on this idea.
One method results in a nonlinear time-dependant partial differential
equation for the level-set function whose evolution minimizes the
residual in the data fit. The second method...
We deal with the optimal portfolio problem in discrete-time setting. Employing the discrete Itô formula, which is developed by Fujita, we establish the discrete Hamilton–Jacobi–Bellman (d-HJB) equation for the value function. Simple examples of the d-HJB equation are also discussed.
The optimal experiment for estimating the parameters of a nonlinear regression model usually depends on the value of these parameters, hence the problem of designing experiments that are robust with respect to parameter uncertainty. Sequential designpermits to adapt the experiment to the value of the parameters, and can thus be considered as a robust design procedure. By designing theexperiments sequentially, one introduces a feedback of information, and thus dynamics, into the design procedure....
The problem considered is that of approximate numerical minimisation of the non-linear control problem of Bolza. Starting from the classical dynamic programming method of Bellman, an ε-value function is defined as an approximation for the value function being a solution to the Hamilton-Jacobi equation. The paper shows how an ε-value function which maintains suitable properties analogous to the original Hamilton-Jacobi value function can be constructed using a stable numerical algorithm. The paper...
This paper addresses a vehicle sequencing problem for adjacent intersections under the framework of Autonomous Intersection Management (AIM). In the context of AIM, autonomous vehicles are considered to be independent individuals and the traffic control aims at deciding on an efficient vehicle passing sequence. Since there are considerable vehicle passing combinations, how to find an efficient vehicle passing sequence in a short time becomes a big challenge, especially for more than one intersection....
A game is considered where the communication network of the first player is explicitly modelled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modelled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along the communication network. This induces a game where the state space consists of the network delays. Even...
We study the partial differential equation max{Lu − f, H(Du)} = 0 where u is the unknown function, L is a second-order elliptic operator, f is a given smooth function and H is a convex function. This is a model equation for Hamilton-Jacobi-Bellman equations arising in stochastic singular control. We establish the existence of a unique viscosity solution of the Dirichlet problem that has a Hölder continuous gradient. We also show that if H is uniformly convex, the gradient of this solution...
Currently displaying 1 –
20 of
143