Finite Time Lyapunov Exponent Analysis of Model Predictive Control and Reinforcement Learning

被引:0
|
作者
Krishna, Kartik [1 ]
Brunton, Steven L. [1 ]
Song, Zhuoyuan [2 ]
机构
[1] Univ Washington, Dept Mech Engn, Seattle, WA 98195 USA
[2] Univ Hawaii Manoa, Dept Mech Engn, Honolulu, HI 96822 USA
基金
美国国家科学基金会;
关键词
Optimal control; finite-time Lyapunov exponents; path planning; mobile sensors; dynamical systems; unsteady fluid dynamics; model predictive control; reinforcement learning; LAGRANGIAN COHERENT STRUCTURES; OPTIMAL TRAJECTORY GENERATION; WIND-DRIVEN; TRANSPORT; DEFINITION; VEHICLES; WAKE;
D O I
10.1109/ACCESS.2023.3326424
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Finite-time Lyapunov exponents (FTLEs) provide a powerful approach to compute time-varying analogs of invariant manifolds in unsteady fluid flow fields. These manifolds are useful to visualize the transport mechanisms of passive tracers advecting with the flow. However, many vehicles and mobile sensors are not passive, but are instead actuated according to some intelligent trajectory planning or control law; for example, model predictive control and reinforcement learning are often used to design energy-efficient trajectories in a dynamically changing background flow. In this work, we investigate the use of FTLE on such controlled agents to gain insight into optimal transport routes for navigation in known unsteady flows. We find that these controlled FTLE (cFTLE) coherent structures separate the flow field into different regions with similar costs of transport to the goal location. These separatrices are functions of the planning algorithm's hyper-parameters, such as the optimization time horizon and the cost of actuation. Computing the invariant sets and manifolds of active agent dynamics in dynamic flow fields is useful in the context of robust motion control, hyperparameter tuning, and determining safe and collision-free trajectories for autonomous systems. Moreover, these cFTLE structures provide insight into effective deployment locations for mobile agents with actuation and energy constraints to traverse the ocean or atmosphere.
引用
收藏
页码:118916 / 118930
页数:15
相关论文
共 50 条
  • [41] Practical concerns of implementing a finite-time Lyapunov exponent analysis with under-resolved data
    Rockwood, Matthew P.
    Loiselle, Thomas
    Green, Melissa A.
    EXPERIMENTS IN FLUIDS, 2019, 60 (04)
  • [42] Practical concerns of implementing a finite-time Lyapunov exponent analysis with under-resolved data
    Matthew P. Rockwood
    Thomas Loiselle
    Melissa A. Green
    Experiments in Fluids, 2019, 60
  • [43] Linguistic Lyapunov reinforcement learning control for robotic manipulators
    Kumar, Abhishek
    Sharma, Rajneesh
    NEUROCOMPUTING, 2018, 272 : 84 - 95
  • [44] Distributed model predictive control for reconfigurable systems based on Lyapunov analysis
    Zheng, Yi
    Li, Shaoyuan
    Wan, Ruoxiao
    Wu, Zhe
    Zhang, Yueyan
    JOURNAL OF PROCESS CONTROL, 2023, 123 : 1 - 11
  • [45] UVaFTLE: Lagrangian finite time Lyapunov exponent extraction for fluid dynamic applications
    Rocío Carratalá-Sáez
    Yuri Torres
    José Sierra-Pallares
    Sergio López-Huguet
    Diego R. Llanos
    The Journal of Supercomputing, 2023, 79 : 9635 - 9665
  • [46] Neural Monte Carlo rendering of finite-time Lyapunov exponent fields
    Yang Xi
    Wanna Luan
    Jun Tao
    Visual Intelligence, 1 (1):
  • [47] Fast computation of finite-time Lyapunov exponent fields for unsteady flows
    Brunton, Steven L.
    Rowley, Clarence W.
    CHAOS, 2010, 20 (01)
  • [48] Refining finite-time Lyapunov exponent ridges and the challenges of classifying them
    Allshouse, Michael R.
    Peacock, Thomas
    CHAOS, 2015, 25 (08)
  • [49] Model Predictive Control with Control Lyapunov Function Support
    Kang, Keunmo
    Bitmead, Robert R.
    NONLINEAR MODEL PREDICTIVE CONTROL: TOWARDS NEW CHALLENGING APPLICATIONS, 2009, 384 : 79 - +
  • [50] MCFTLE: Monte Carlo Rendering of Finite-Time Lyapunov Exponent Fields
    Guenther, Tobias
    Kuhn, Alexander
    Theisel, Holger
    COMPUTER GRAPHICS FORUM, 2016, 35 (03) : 381 - 390