AI & ML
A Measure-Theoretic Formulation of Behavioral Systems
arXiv eess.SY0 views
arXiv:2605.01558v3 Announce Type: replace-cross Abstract: Ensemble control specifies probability laws on admissible trajectories, including their temporal dependence. Starting from an arbitrary closed behavior, we organize its laws into a framework that connects standard probability-measure geometry, occupation-measure control, and data-driven trajectory parametrization. Classical convexity and extreme-point properties describe the feasible laws, while classical Bellman duality governs additive control objectives. On compact state and input spaces, full-path constrained duality for continuous trajectory functions gives primal attainment and zero gap whenever feasible. For controllable linear time-invariant systems, the noise-free Fundamental Lemma yields an equivalent law-level Hankel factorization, with a canonical pseudoinverse lift. The factorization transfers trajectory-law constraints exactly to coefficient space and connects them to covariance control. Explicit noisy-Hankel bounds quantify subspace approximation for second-moment-bounded laws under known rank and Gaussian output measurement noise. Numerical studies include a nonlinear reset problem whose nonadjacent correlation constraint requires temporal memory, covariance-constrained optimization, and noisy-data policy evaluation. Known transition kernels provide a further structural perspective through history-conditional consistency.
Source:https://arxiv.org/abs/2605.01558PreviousData-Driven Continuous-Time LQR: Linking Reinforcement Learning and Behavioral System TheoryNextBeyond Benchmarks: Continuous Edge Inference for Traffic Sign Recognition on Embedded Vehicular Hardware
Related posts
A Straight Line Is Not a Camera Pose: Auditing Short-Clip Pose Benchmarks
0arXiv cs.RO
Mechanisms of Misgeneralization in Physical Sequence Modeling
0arXiv cs.RO
Behavior Graphs: Unsupervised Graph Structures for Interpreting Robot Deployment Data
0arXiv cs.RO
RoboFQE: Rollout-Free Evaluation of Visual Robot Policies from Offline Trajectories
0arXiv cs.RO
Improving Imitation Learning Efficiency for Manipulation through Geometric Prior Pretraining
0arXiv cs.RO
MATE: Asynchronous Multi-Rate Diffusion Policy Composition
0arXiv cs.RO