pith. sign in

arxiv: 1801.09627 · v3 · pith:ZO57IZNZnew · submitted 2018-01-29 · 💻 cs.LG · cs.RO· cs.SY· eess.SY

Barrier-Certified Adaptive Reinforcement Learning with Applications to Brushbot Navigation

classification 💻 cs.LG cs.ROcs.SYeess.SY
keywords learningadaptiveframeworkmodelsafetyunderbarrierbarrier-certified
0
0 comments X
read the original abstract

This paper presents a safe learning framework that employs an adaptive model learning algorithm together with barrier certificates for systems with possibly nonstationary agent dynamics. To extract the dynamic structure of the model, we use a sparse optimization technique. We use the learned model in combination with control barrier certificates which constrain policies (feedback controllers) in order to maintain safety, which refers to avoiding particular undesirable regions of the state space. Under certain conditions, recovery of safety in the sense of Lyapunov stability after violations of safety due to the nonstationarity is guaranteed. In addition, we reformulate an action-value function approximation to make any kernel-based nonlinear function estimation method applicable to our adaptive learning framework. Lastly, solutions to the barrier-certified policy optimization are guaranteed to be globally optimal, ensuring the greedy policy improvement under mild conditions. The resulting framework is validated via simulations of a quadrotor, which has previously been used under stationarity assumptions in the safe learnings literature, and is then tested on a real robot, the brushbot, whose dynamics is unknown, highly complex and nonstationary.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Safety Certification is Classification

    cs.AI 2026-05 unverdicted novelty 6.0

    Safety certification of dynamical systems is reformulated as direct classification via kernel embeddings on trajectories, bypassing recursive DP to avoid error compounding and support non-Markovian dynamics.