Hamilton-Jacobi Equations on Networks as Limits of Singularly Perturbed Problems in Optimal Control: Dimension Reduction.

Summary We consider a family of open star-shaped domains made of a finite number of non intersecting semi-infinite strips of small thickness and of a central region whose diameter is of the same order of thickness, that may be called the junction. When the thickness tends to 0, the domains tend to a union of half-lines sharing an endpoint. This set is termed "network". We study infinite horizon optimal control problems in which the state is constrained to remain in the star-shaped domains. In the above mentioned strips the running cost may have a fast variation w.r.t. the transverse coordinate. When the thickness tends to 0 we prove that the value function tends to the solution of a Hamilton-Jacobi equation on the network, which may also be related to an optimal control problem. One difficulty is to find the transmission condition at the junction node in the limit problem. For passing to the limit, we use the method of the perturbed test-functions of Evans, which requires constructing suitable correctors. This is another difficulty since the domain is unbounded.