Convergence Analysis for A Stochastic Maximum Principle Based Data Driven Feedback Control Algorithm
Siming Liang, Hui Sun, Richard Archibald, Feng Bao
TL;DR
This work analyzes the convergence of a data-driven online feedback control algorithm that couples particle-filter state estimation from partial, noisy observations with a stochastic maximum principle–based SGD solver. By integrating established particle-filter weak convergence results with stochastic-gradient convergence analyses for SMP solvers, it derives a weak convergence result for the data-driven optimization procedure and provides a rigorously justified framework for online control in high-dimensional, partially observed settings. Two numerical experiments—the 4-D linear-quadratic problem with nonlinear observations and a 2D Dubins vehicle maneuvering problem—validate the theory, showing that the state distribution and the computed control converge as the particle count and iteration depth increase. The methodology offers a practical, scalable path to reliable online data-driven feedback control where exact state information is unavailable.
Abstract
This paper presents convergence analysis of a novel data-driven feedback control algorithm designed for generating online controls based on partial noisy observational data. The algorithm comprises a particle filter-enabled state estimation component, estimating the controlled system's state via indirect observations, alongside an efficient stochastic maximum principle type optimal control solver. By integrating weak convergence techniques for the particle filter with convergence analysis for the stochastic maximum principle control solver, we derive a weak convergence result for the optimization procedure in search of optimal data-driven feedback control. Numerical experiments are performed to validate the theoretical findings.
