Adaptive Reachability Analysis to Achieve Mission Objectives in Strongly Non-Keplerian Systems

2015 ◽  
Vol 38 (3) ◽  
pp. 468-477 ◽  
Author(s):  
David A. Surovik ◽  
Daniel J. Scheeres
Keyword(s):  
Reachability Analysis ◽  
Keplerian Systems

Symbolic Reachability Analysis of Hybrid Systems

2009 ◽  
Vol 19 (12) ◽  
pp. 3111-3121 ◽  
Author(s):  
Hai-Bin ZHANG ◽  
Zhen-Hua DUAN
Keyword(s):  
Hybrid Systems ◽  
Reachability Analysis

Reachability analysis of nonlinear hybrid systems based on polyhedron inclusion

2013 ◽  
Vol 33 (5) ◽  
pp. 1289-1293
Author(s):  
Jin ZOU ◽  
Wang LIN ◽  
Yong LUO ◽  
Zhenbing ZENG
Keyword(s):  
Hybrid Systems ◽  
Reachability Analysis ◽  
Nonlinear Hybrid

scholarly journals Chain of Set Inversion Problems Application to reachability analysis

2017 ◽  
Vol 50 (1) ◽  
pp. 9266-9271
Author(s):  
Benoit Desrochers ◽  
Luc Jaulin
Keyword(s):  
Reachability Analysis

scholarly journals Transformation of Uncertain Linear Systems with Real Eigenvalues into Cooperative Form: The Case of Constant and Time-Varying Bounded Parameters

Algorithms ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 85
Author(s):  
Andreas Rauh ◽  
Julia Kersten
Keyword(s):  
Linear Systems ◽  
Initial Conditions ◽  
A Priori ◽  
Real Life ◽  
Reachability Analysis ◽  
Interval Methods ◽  
Space Representation ◽  
Uncertain Parameters ◽  
Time Varying ◽  
Similarity Transformations

Continuous-time linear systems with uncertain parameters are widely used for modeling real-life processes. The uncertain parameters, contained in the system and input matrices, can be constant or time-varying. In the latter case, they may represent state dependencies of these matrices. Assuming bounded uncertainties, interval methods become applicable for a verified reachability analysis, for feasibility analysis of feedback controllers, or for the design of robust set-valued state estimators. The evaluation of these system models becomes computationally efficient after a transformation into a cooperative state-space representation, where the dynamics satisfy certain monotonicity properties with respect to the initial conditions. To obtain such representations, similarity transformations are required which are not trivial to find for sufficiently wide a-priori bounds of the uncertain parameters. This paper deals with the derivation and algorithmic comparison of two different transformation techniques for which their applicability to processes with constant and time-varying parameters has to be distinguished. An interval-based reachability analysis of the states of a simple electric step-down converter concludes this paper.

Sign in / Sign up

Export Citation Format

Share Document