TY - JOUR
T1 - Incremental Affine Abstraction of Nonlinear Systems
AU - Hassaan, Syed M.
AU - Khajenejad, Mohammad
AU - Jensen, Spencer
AU - Shen, Qiang
AU - Yong, Sze Zheng
N1 - Funding Information:
Manuscript received March 18, 2020; revised May 21, 2020; accepted June 7, 2020. Date of publication June 23, 2020; date of current version July 9, 2020. This work was supported in part by Defense Advanced Research Projects Agency under Grant D18AP00073. Recommended by Senior Editor M. Arcak. (Corresponding author: Sze Zheng Yong.) Syed M. Hassaan, Mohammad Khajenejad, Spencer Jensen, and Sze Zheng Yong are with the School for Engineering of Matter, Transport and Energy, Arizona State University, Tempe, AZ 85281 USA (e-mail: shassaan@asu.edu; mkhajene@asu.edu; sjensen8@asu.edu; szyong@asu.edu).
Publisher Copyright:
© 2017 IEEE.
PY - 2021/4
Y1 - 2021/4
N2 - In this letter, we propose an incremental abstraction method for dynamically over-approximating nonlinear systems in a bounded domain by solving a sequence of linear programs, resulting in a sequence of affine upper and lower hyperplanes with expanding operating regions. Although the affine abstraction problem can be solved using a single linear program, existing approaches suffer from a computation space complexity that grows exponentially with the state dimension. Thus, the motivation for incremental abstraction is to reduce the space complexity of abstraction algorithms for high-dimensional systems or systems with limited on-board resources. Specifically, we start with an operating region that is a subregion of the state space and compute a pair of affine hyperplanes that bracket the nonlinear function locally. Then, by incrementally expanding the operating region, we dynamically update the two affine hyperplanes such that we eventually yield hyperplanes that are guaranteed to over-approximate the nonlinear system over the entire domain. Finally, the effectiveness of the proposed approach is demonstrated using several numerical examples.
AB - In this letter, we propose an incremental abstraction method for dynamically over-approximating nonlinear systems in a bounded domain by solving a sequence of linear programs, resulting in a sequence of affine upper and lower hyperplanes with expanding operating regions. Although the affine abstraction problem can be solved using a single linear program, existing approaches suffer from a computation space complexity that grows exponentially with the state dimension. Thus, the motivation for incremental abstraction is to reduce the space complexity of abstraction algorithms for high-dimensional systems or systems with limited on-board resources. Specifically, we start with an operating region that is a subregion of the state space and compute a pair of affine hyperplanes that bracket the nonlinear function locally. Then, by incrementally expanding the operating region, we dynamically update the two affine hyperplanes such that we eventually yield hyperplanes that are guaranteed to over-approximate the nonlinear system over the entire domain. Finally, the effectiveness of the proposed approach is demonstrated using several numerical examples.
KW - Computational methods
KW - large-scale systems
KW - model/controller reduction
KW - optimization algorithms
UR - http://www.scopus.com/inward/record.url?scp=85089196922&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85089196922&partnerID=8YFLogxK
U2 - 10.1109/LCSYS.2020.3004503
DO - 10.1109/LCSYS.2020.3004503
M3 - Article
AN - SCOPUS:85089196922
SN - 2475-1456
VL - 5
SP - 653
EP - 658
JO - IEEE Control Systems Letters
JF - IEEE Control Systems Letters
IS - 2
M1 - 9123441
ER -