Stochastic Online Optimization for Cyber-Physical and Robotic Systems

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Ma, Hao, Zeilinger, Melanie, Muehlebach, Michael
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866911351093329920
author Ma, Hao
Zeilinger, Melanie
Muehlebach, Michael
author_facet Ma, Hao
Zeilinger, Melanie
Muehlebach, Michael
contents We propose a novel gradient-based online optimization framework for solving stochastic programming problems that frequently arise in the context of cyber-physical and robotic systems. Our problem formulation accommodates constraints that model the evolution of a cyber-physical system, which has, in general, a continuous state and action space, is nonlinear, and where the state is only partially observed. We also incorporate an approximate model of the dynamics as prior knowledge into the learning process and show that even rough estimates of the dynamics can significantly improve the convergence of our algorithms. Our online optimization framework encompasses both gradient descent and quasi-Newton methods, and we provide a unified convergence analysis of our algorithms in a non-convex setting. We also characterize the impact of modeling errors in the system dynamics on the convergence rate of the algorithms. Finally, we evaluate our algorithms in simulations of a flexible beam, a four-legged walking robot, and in real-world experiments with a ping-pong playing robot.
format Preprint
id arxiv_https___arxiv_org_abs_2404_05318
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Stochastic Online Optimization for Cyber-Physical and Robotic Systems
Ma, Hao
Zeilinger, Melanie
Muehlebach, Michael
Machine Learning
Robotics
We propose a novel gradient-based online optimization framework for solving stochastic programming problems that frequently arise in the context of cyber-physical and robotic systems. Our problem formulation accommodates constraints that model the evolution of a cyber-physical system, which has, in general, a continuous state and action space, is nonlinear, and where the state is only partially observed. We also incorporate an approximate model of the dynamics as prior knowledge into the learning process and show that even rough estimates of the dynamics can significantly improve the convergence of our algorithms. Our online optimization framework encompasses both gradient descent and quasi-Newton methods, and we provide a unified convergence analysis of our algorithms in a non-convex setting. We also characterize the impact of modeling errors in the system dynamics on the convergence rate of the algorithms. Finally, we evaluate our algorithms in simulations of a flexible beam, a four-legged walking robot, and in real-world experiments with a ping-pong playing robot.
title Stochastic Online Optimization for Cyber-Physical and Robotic Systems
topic Machine Learning
Robotics
url https://arxiv.org/abs/2404.05318