An efficient implementation of graph-based invariant set algorithm for constrained nonlinear dynamical systems
The graph-based invariant set (GIS) algorithm is a promising set-based technique for computing the largest (with respect to inclusion) control invariant set of general discrete-time nonlinear dynamical systems. However, like other invariant set algorithms for nonlinear systems, the GIS algorithm may require a lot of resources when computing the control invariant set. This limits its applicability to higher dimensional systems. In this work, we present an improved and efficient implementation of the GIS algorithm for general discrete-time controlled nonlinear systems. We first identify the bottlenecks through extensive analysis, and then provide remedial procedures to improve the implementation of the GIS algorithm. Specifically, we developed an adaptive subdivision scheme using a supervised machine learning-based algorithm to reduce the cell growth rate and parallelize the graph construction step. We extensively demonstrate the performance of the improved GIS algorithm using a numerical example and compare the result to that of the standard GIS algorithm. The results show that the adaptive subdivision and the parallelization improved the speed of the algorithm by about 8x and 3x respectively, that of the standard GIS algorithm.
Code (0)
등록된 구현이 없습니다.
Tasks
graph constructionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Physics constrained nonlinear regression models for time series
A central issue in contemporary science is the development of data driven statistical nonlinear dynamical models for time series of partial observations of nature or a complex physical model. It has been established rece…
regressionTime SeriesComputing control invariant sets of nonlinear systems: decomposition and distributed computing
In this work, we present a distributed framework based on the graph algorithm for computing control invariant set for nonlinear cascade systems. The proposed algorithm exploits the structure of the interconnections withi…
Distributed ComputingStructure-Preserving Physics-Informed Neural Network for the Korteweg--de Vries (KdV) Equation
Physics-Informed Neural Networks (PINNs) offer a flexible framework for solving nonlinear partial differential equations (PDEs), yet conventional implementations often fail to preserve key physical invariants during long…
Representing and Learning Functions Invariant Under Crystallographic Groups
Crystallographic groups describe the symmetries of crystals and other repetitive structures encountered in nature and the sciences. These groups include the wallpaper and space groups. We derive linear and nonlinear repr…
Gaussian ProcessesAn Execution-time-certified Riccati-based IPM Algorithm for RTI-based Input-constrained NMPC
Establishing an execution time certificate in deploying model predictive control (MPC) is a pressing and challenging requirement. As nonlinear MPC (NMPC) results in nonlinear programs, differing from quadratic programs e…
Model Predictive Control