LQR-trees: Feedback motion planning on sparse randomized trees
Abstract
Recent advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of stability for smooth nonlinear systems. Here we present a feedback motion planning algorithm which uses these results to efficiently combine locally-valid linear quadratic regulator (LQR) controllers into a nonlinear feedback policy which probabilistically covers the reachable area of a (bounded) state space with a region of stability, certifying that all initial conditions that are capable of reaching the goal will stabilize to the goal. We demonstrate the performance of this systematic nonlinear feedback control design algorithm on the model underactuated systems and discuss the potential for the control of more complicated control problems like bipedal walking. Download: Bibtex: @INPROCEEDINGS{ Tedrake-RSS-09, AUTHOR = {R. Tedrake}, TITLE = {{LQR}-trees: Feedback motion planning on sparse randomized trees}, BOOKTITLE = {Proceedings of Robotics: Science and Systems}, YEAR = {2009}, ADDRESS = {Seattle, USA}, MONTH = {June}, DOI = {10.15607/RSS.2009.V.003} }