The minimum time function for the controlled Moreau's Sweeping Process

Abstract

Let C(t), t≥0 be a Lipschitz set-valued map with closed and (mildly non-)convex values and f(t, x,u) be a map, Lipschitz continuous w.r.t. x. We consider the problem of reaching a target S within the graph of C subject to the differential inclusion \[ () x ∈ -NC(t)(x) + G(t,x) \] starting from x0∈ C(t0) in the minimum time T(t0,x0). The dynamics () is called a perturbed sweeping (or Moreau) process. We give sufficient conditions for T to be finite and continuous and characterize T through Hamilton-Jacobi inequalities. Crucial tools for our approach are characterizations of weak and strong flow invariance of a set S subject to (). Due to the presence of the normal cone NC(t)(x), the right hand side of () contains implicitly the state constraint x(t)∈ C(t) and is not Lipschitz continuous with respect to x.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…