Learning Lyapunov (potential) functions from counterexamples and demonstrations

6Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a technique for learning control Lyapunov (potential) functions, which are used in turn to synthesize controllers for nonlinear dynamical systems. The learning framework uses a demonstrator that implements a black-box, untrusted strategy presumed to solve the problem of interest, a learner that poses finitely many queries to the demonstrator to infer a candidate function and a verifier that checks whether the current candidate is a valid control Lyapunov function. The overall learning framework is iterative, eliminating a set of candidates on each iteration using the counterexamples discovered by the verifier and the demonstrations over these counterexamples. We prove its convergence using ellipsoidal approximation techniques from convex optimization. We also implement this scheme using nonlinear MPC controllers to serve as demonstrators for a set of state and trajectory stabilization problems for nonlinear dynamical systems. Our approach is able to synthesize relatively simple polynomial control Lyapunov functions, and in that process replace the MPC using a guaranteed and computationally less expensive controller.

Cite

CITATION STYLE

APA

Ravanbakhsh, H., & Sankaranarayanan, S. (2017). Learning Lyapunov (potential) functions from counterexamples and demonstrations. In Robotics: Science and Systems (Vol. 13). Massachusetts Institute of Technology. https://doi.org/10.15607/rss.2017.xiii.049

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free