Abstract Different from the Apollo flight mode, a safer trans-lunar mode for crews is preferred. The previous-arrived lunar module rendezvouses with crew exploration vehicle at low destination orbit, and then ride to descend surface sampling destination. module, which includes descent ascent stages, flies Earth orbit two tangential impulses. orbital reachable set of practical limits feasible re...

The computation of reachable sets of nonlinear dynamic and control systems is an important problem of systems theory. In this paper we consider the computability of reachable sets using Turing machines to perform approximate computations. We use Weihrauch's type-two theory of effectivity for computable analysis and topology, which provides a natural setting for performing computations on sets a...

This thesis is about the safety verification of dynamical systems using reachability analysis. Novel solutions have been developed for three major problem classes: Classical reachability analysis, stochastic reachability analysis, and their application to the safety assessment of autonomous cars. Classical reachability analysis aims to compute the exact or over-approximative set of states that ...

Computing the set of reachablestates of a finite state machine, is an important component of many problems in the synthesis, and formal verification of digital systems. The process of design is usually iterative, and the designer may modify and recompute information many times, and reachability is called each time the designer modifies the system, because current methods for reachability analys...

The development of any fault-tolerant control solution is based on the strong assumption that fault situations can be accommodated. This paper provides a survey four reachable set techniques to assess recoverability property for constrained linear time invariant (LTI) systems by means ellipsoid, zonotope, polytope and support function representations. These are next applied an angular velocity ...

This paper addresses the exact computation of the set of reachable states of a strongly linear hybrid system. It proposes an approach that is an extension of classical state-space exploration. This approach uses a new operation, based on a cycle analysis in the control graph of the system, for generating sets of reachable states, as well as a powerful representation system for sets of values. T...

We show that the graph of the reachable set of a control system given by a differential inclusion is uniquely characterized by a Hamilton-Jacobi equation involving proximal normals. Résumé On démontre que le graphe de l’ensemble des points accessibles d’un système de contrôle décrit par une inclusion différentielle est caractérisé par une équation Hamilton-Jacobi impliquant les normales proxima...