Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/89488
Title: Underapproximating backward reachable sets by semialgebraic sets
Authors: Xue, Bai
She, Zhikun
Easwaran, Arvind
Keywords: Boundary Analysis
Convex Programming
Issue Date: 2017
Source: Xue, B., She, Z., & Easwaran, A. (2017). Underapproximating backward reachable sets by semialgebraic sets. IEEE Transactions on Automatic Control, 62(10), 5185-5197.
Series/Report no.: IEEE Transactions on Automatic Control
Abstract: Underapproximations (UAs) of backward reachable sets play an important role in controller synthesis and trajectory analysis for constrained nonlinear dynamical systems, but there are few methods available to compute them. Given a nonlinear system, a target region of simply connected compact type and a time duration, we present a method using boundary analysis to compute an UA of the backward reachable set. The UA is represented as a semialgebraic set, formed by what we term polynomial level - set functions. The polynomial level - set function is a semidefinite positive function with one real root, such that the interior and closure of a semialgebraic set formed by it are both simply connected and have the same boundary. The function can be computed by solving a convex program, which is constructed based on sum-of-squares decomposition and linear interval inequalities. We test our method on several examples and compare them with existing methods. The results show that our method can obtain better estimations more efficiently in terms of time for these special examples.
URI: https://hdl.handle.net/10356/89488
http://hdl.handle.net/10220/44941
ISSN: 0018-9286
DOI: 10.1109/TAC.2017.2694351
Rights: © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TAC.2017.2694351].
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Journal Articles

Files in This Item:
File Description SizeFormat 
Underapproximating Backward Reachable Sets by Semialgebraic Set.pdf1.69 MBAdobe PDFThumbnail
View/Open

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.