Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 43 for “"Reachable sets"”.

  1. Solving reachable sets on a manifold

    … Second, it explores a method for computing reachable sets on a manifold; in other words, the dynamics governing these reachable sets can be described by a Differential Algebraic Equation. It uses level set methods to solve the underlying Hamilton Jacobi equation of the reachable set and it …

    ubc Repository record for Solving reachable sets on a manifold (opens in a new tab) Download PDF for Solving reachable sets on a manifold (opens in a new tab)

  2. Bounding Reachable Sets for Global Dynamic Optimization

    Many chemical engineering applications, such as safety verification and parameter estimation, require global optimization of dynamic models. Global optimization algorithms typically require obtaining global bounding information of the dynamic system, to aid in locating and verifying the global …

    mcmaster Repository record for Bounding Reachable Sets for Global Dynamic Optimization (opens in a new tab)

  3. Reachable sets for multiple asteroid sample return missions

    … reduce the number of feasible asteroid targets. Reachable sets are defined in a reduced classical orbital element space. The boundary of this reduced space is obtained by extremizing a family of convex combinations of orbital elements. The resulting group of optimization problems is solved using …

    nps Repository record for Reachable sets for multiple asteroid sample return missions (opens in a new tab)

  4. Reachable sets of numerical iteration schemes : a system semigroup approach

    … Our approach is based on the interpretation of reachable sets as orbits of the system semigroup. In the first part we develop tools for the systematic analysis of the structure of reachable sets of general invertible discrete-time control systems. Therefore we merge classical concepts, such as …

    wurz-thes Repository record for Reachable sets of numerical iteration schemes : a system semigroup approach (opens in a new tab)

  5. Reachable sets analysis in the cooperative control of pursuer vehicles

    … game. The approach is the employment of Forward Reachable Set (FRS) analysis in the pursuers’ control. The analysis considers the coverage of the evader’s FRS, which is the set of reachable states at a future time, with the pursuer’s FRS and assumes that the chance of capturing the evader is …

    unsw Repository record for Reachable sets analysis in the cooperative control of pursuer vehicles (opens in a new tab)

  6. APPROXIMATING REACHABLE SETS FOR A CLASS OF LINEAR SYSTEMS SUBJECT TO BOUNDED CONTROL.

    A method is proposed for approximating the reachable set from the origin for a class of n first order linear ordinary differential equations subject to bounded control. The technique involves decoupling the system equations into 1- and 2-dimensional linear subsystems, and then finding the reachable …

    arizona-thes Repository record for APPROXIMATING REACHABLE SETS FOR A CLASS OF LINEAR SYSTEMS SUBJECT TO BOUNDED CONTROL. (opens in a new tab)

  7. Using sample-based continuation techniques to efficiently compute subspace reachable sets and Pareto surfaces

    … state boundary conditions, one can compute the reachable set at a specified time horizon. Forward reachable sets contain all states that can be reached using a feasible control policy at the specified time horizon. Alternatively, backwards reachable sets contain all initial states that can reach …

    gatech Repository record for Using sample-based continuation techniques to efficiently compute subspace reachable sets and Pareto surfaces (opens in a new tab)

  8. Scalable techniques for the computation of viable and reachable sets : safety guarantees for high-dimensional linear time-invariant systems

    … for constrained dynamical systems. The minimal reachable tube and (by duality) the viability kernel are the only constructs that can be used for this purpose. Unfortunately, current numerical schemes that compute these constructs suffer from a complexity that is exponential in the dimension of …

    ubc Repository record for Scalable techniques for the computation of viable and reachable sets : safety guarantees for high-dimensional linear time-invariant systems (opens in a new tab) Download PDF for Scalable techniques for the computation of viable and reachable sets : safety guarantees for high-dimensional linear time-invariant systems (opens in a new tab)

  9. Safe open-loop strategies for handling intermittent communications in multi-robot systems

    … horizon, the first step involves constructing reachable sets around the robots to determine the set of all positions that can be reached by the robot in a given amount of time. In order to avoid complications arising from the non-convexity of these reachable sets, analytical expressions for …

    gatech Repository record for Safe open-loop strategies for handling intermittent communications in multi-robot systems (opens in a new tab)

  10. Mixed Monotonicity for Efficient Reachability with Applications to Robust Safe Autonomy

    … efficient technique for over-approximating reachable sets using hyperrectangles. Specifically, the mixed monotonicity of a dynamical system is tied to the existence of a related decomposition function that separates the system's vector field into cooperative and competitive state …

    gatech Repository record for Mixed Monotonicity for Efficient Reachability with Applications to Robust Safe Autonomy (opens in a new tab)

  11. A Feasibility Problem Approach For Reachable Set Approximation

    … control strategy validation. The computation of reachable sets (and controllability sets) is a central part of this analysis. In this work we advance an algorithm for approximating reachable sets which is originally based on optimally controlled problems with distance functions as objectives. It …

    bayreuth Repository record for A Feasibility Problem Approach For Reachable Set Approximation (opens in a new tab)

  12. Tighter peak-to-peak performance bounds for piecewise linear systems with application to a class of semi-active control problems.

    … of a special method for determining the reachable sets for unit peak inputs associated with the six control cases of the 3-D semi-active control system. The tight bounds are found to have values that range from 0.38 to 0.41.

    oklahoma-thes Repository record for Tighter peak-to-peak performance bounds for piecewise linear systems with application to a class of semi-active control problems. (opens in a new tab)

  13. Safe Control of Partially Unknown Systems Leveraging Efficient Reachability

    … We present a method for efficiently computing reachable sets for continuous-time systems with partially unknown dynamics. Our main assumption is that, given any hyperrectangle of states, lower and upper bounds for the unknown components are available. With this assumption, the theory of mixed …

    gatech Repository record for Safe Control of Partially Unknown Systems Leveraging Efficient Reachability (opens in a new tab)

  14. Computational Techniques for Stochastic Reachability

    … a desired level of probability, known as the reachable (or safe) set, depending on the objective. However, the applicability of reachability analysis is limited in the scope and size of system it can address. First, generating stochastic reachable or viable sets is computationally intensive, …

    unm Repository record for Computational Techniques for Stochastic Reachability (opens in a new tab)

  15. Data-driven Koopman Theory for Transient Stability and Safety Analysis of Power Systems with Renewable Penetration

    … data, the approach computes forward and backward reachable sets efficiently, even in high-dimensional nonlinear systems, without requiring dense state-space sampling. This method is validated through numerical examples, demonstrating its ability to recover nonconvex reachable sets in both stable …

    clemson Repository record for Data-driven Koopman Theory for Transient Stability and Safety Analysis of Power Systems with Renewable Penetration (opens in a new tab)

  16. Methods of Analysis and Design of Dynamical Systems Using Homogeneous Polynomial Lyapunov Functions

    … of QLFs to generate better approximations of reachable sets and domains of attraction (DoA) of dynamical systems. Central to HLF construction is lifting the state vector x via a recursive Kronecker product to a higher degree, homogeneous form resident in a higher-dimensional space. This …

    gatech Repository record for Methods of Analysis and Design of Dynamical Systems Using Homogeneous Polynomial Lyapunov Functions (opens in a new tab)

  17. Metric Properties of Attractors for Vector Fields via Bounded, Nonautonomous Control

    … attraction, and can be computed by tracking the sets reachable from the attractor under bounded, nonautonomous control. We connect bounded control systems to multiflows, a nascent framework of multivalued dynamics. A connection between reachable sets and isolating blocks implies that an …

    umn Repository record for Metric Properties of Attractors for Vector Fields via Bounded, Nonautonomous Control (opens in a new tab)

Page 1 of 3