Infinite-Horizon Ergodic Control via Kernel Mean Embeddings

arXiv cs.RO / 4/2/2026

💬 OpinionSignals & Early TrendsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper proposes an infinite-horizon ergodic controller for long-duration coverage on general domains using kernel mean embeddings.
  • It addresses prior kernel-based ergodic control limitations by resolving intractable computational scaling that previously restricted methods to sub-ergodic, finite-time horizons.
  • The key technical contribution is an “extended” kernel mean embedding error visitation state that recursively records state visitation, enabling control synthesis to work in infinite-time settings.
  • It also introduces a receding-horizon variant that still leverages the extended error state, aiming to retain the benefits of the infinite-horizon formulation.
  • The authors provide theoretical asymptotic convergence results and demonstrate that ergodic coverage guarantees are preserved for certain 2D and 3D coverage problems.

Abstract

This paper derives an infinite-horizon ergodic controller based on kernel mean embeddings for long-duration coverage tasks on general domains. While existing kernel-based ergodic control methods provide strong coverage guarantees on general coverage domains, their practical use has been limited to sub-ergodic, finite-time horizons due to intractable computational scaling, prohibiting its use for long-duration coverage. We resolve this scaling by deriving an infinite-horizon ergodic controller equipped with an extended kernel mean embedding error visitation state that recursively records state visitation. This extended state decouples past visitation from future control synthesis and expands ergodic control to infinite-time settings. In addition, we present a variation of the controller that operates on a receding-horizon control formulation with the extended error state. We demonstrate theoretical proof of asymptotic convergence of the derived controller and show preservation of ergodic coverage guarantees for a class of 2D and 3D coverage problems.