Motion Planning for Continuous Time Stochastic Processes: A Dynamic Programming Approach
Peyman Mohajerin Esfahani, Debasish Chatterjee, John Lygeros

TL;DR
This paper develops a dynamic programming framework for stochastic motion planning involving controlled processes with possibly discontinuous paths, connecting it to stochastic optimal control and PDEs, with applications to biological switches.
Contribution
It introduces a novel weak dynamic programming principle for stochastic motion planning with discontinuous payoffs, linking it to viscosity solutions of PDEs.
Findings
Characterizes initial states via level sets of viscosity solutions.
Establishes a DPP for processes with discontinuous sample paths.
Demonstrates applicability to biological switch models.
Abstract
We study stochastic motion planning problems which involve a controlled process, with possibly discontinuous sample paths, visiting certain subsets of the state-space while avoiding others in a sequential fashion. For this purpose, we first introduce two basic notions of motion planning, and then establish a connection to a class of stochastic optimal control problems concerned with sequential stopping times. A weak dynamic programming principle (DPP) is then proposed, which characterizes the set of initial states that admit a control enabling the process to execute the desired maneuver with probability no less than some pre-specified value. The proposed DPP comprises auxiliary value functions defined in terms of discontinuous payoff functions. A concrete instance of the use of this novel DPP in the case of diffusion processes is also presented. In this case, we establish that the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
