PhD Defense by Julian Brew

Event Details
  • Date/Time:
    • Monday October 28, 2019
      2:00 pm - 4:00 pm
  • Location: Montgomery Knight Building 317
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: Using Sample-based Continuation Techniques to Efficiently Compute Subspace Reachable Sets and Pareto-Surfaces

Full Summary: No summary paragraph submitted.

Julian Brew
(Advisor: Prof. Lightsey, Prof. Holzinger)

will defend  a doctoral thesis entitled,

Using Sample-based Continuation Techniques to Efficiently Compute Subspace Reachable Sets and Pareto-Surfaces

On

Monday, October 28 at 2:00 p.m.
Montgomery Knight Building 317

Abstract

For a given continuous-time dynamical system with control input constraints and prescribed 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 the prescribed state boundary condition using a feasible control policy at the specified time horizon. The computation of reachable sets has been applied to many problems such as vehicle collision avoidance, operational safety planning, system capability demonstration, and even economic modeling and weather forecasting.

However, computing reachable volumes for general nonlinear systems is very difficult to do both accurately and efficiently. The first contribution of this thesis investigates computational techniques for alleviating the curse of dimensionality by computing reachable sets on subspaces of the full state dimension and computing point solutions for the reachable set boundary. To compute these point solutions, optimal control problems are reduced to initial value problems using continuation methods and then solved.

The sample-based continuation techniques are computationally efficient in that they are easily parallelizable. However, the distribution of samples on the reachable set boundary is not directly controlled. The second contribution presents necessary conditions for distributed computation convergence, as well as necessary conditions for curvature- or uniform coverage-based sampling methods.

Solutions to multi-objective optimization problems are generally defined using a set of feasible solutions such that for any one objective to improve it is necessary for other objectives to degrade. This suggests there is a connection between the two fields with the potential of cross-fertilization of computational techniques and theory. The third contribution explores analytical connections between reachability theory and multi-objective optimization with investigation into properties, constraints, and special cases.

 

Committee

  • Prof. Glenn Lightsey– School of Aerospace Engineering, Georgia Institute of Technology (advisor)
  • Prof. Marcus Holzinger – Aerospace Engineering Sciences Dept., University of Colorado Boulder (co-advisor)
  • Stefan Schuet – Research Engineer, NASA Ames Research Center
  • Prof. Panagiotis Tsiotras– School of Aerospace Engineering, Georgia Institute of Technology
  • Prof. Jonathan Rogers – School of Aerospace Engineering, Georgia Institute of Technology

Additional Information

In Campus Calendar
No
Groups

Graduate Studies

Invited Audience
Faculty/Staff, Public, Graduate students, Undergraduate students
Categories
Other/Miscellaneous
Keywords
Phd Defense
Status
  • Created By: Tatianna Richardson
  • Workflow Status: Published
  • Created On: Oct 23, 2019 - 10:26am
  • Last Updated: Oct 23, 2019 - 10:26am