PhD Proposal by Geordan Gutow

Event Details
  • Date/Time:
    • Wednesday June 16, 2021
      12:30 pm - 2:30 pm
  • Location: Atlanta, GA; REMOTE
  • Phone:
  • URL: Bluejeans
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: Motion Primitive Path Planning with Chance Constraints for Parametrically Uncertain Systems via the Koopman Operator

Full Summary: No summary paragraph submitted.

Title: Motion Primitive Path Planning with Chance Constraints for Parametrically Uncertain Systems via the Koopman Operator

 

Date: Wednesday, June 16th 2021

Time: 12:30-2:00 pm EDT

Location: https://bluejeans.com/9995365476

 

 

Geordan Gutow

Robotics PhD Student

George W. Woodruff School of Mechanical Engineering
Georgia Institute of Technology

 

Committee

  1. Dr. Jonathan Rogers (Primary Advisor) – School of Aerospace Engineering, Georgia Institute of Technology
  2. Dr. Seth Hutchinson – School of Interactive Computing, Georgia Institute of Technology
  3. Dr. Anirban Mazumdar – School of Mechanical Engineering, Georgia Institute of Technology
  4. Dr. Charles Pippen – Georgia Tech Research Institute
  5. Dr. Panagiotis Tsiotras – School of Aerospace Engineering, Georgia Institute of Technology

 

Abstract

Kinodynamic motion planning addresses the problem of finding the control inputs to a dynamical system such that that system's trajectory satisfies constraints such as obstacle avoidance or entering a goal set. Motion primitives are a popular tool for kinodynamic motion planning as they allow constructing trajectories that are guaranteed to satisfy the system dynamics without requiring on-demand simulation. This work provides a generalization of motion primitives to systems subject to parametric uncertainty. Quantities of interest in optimal motion planning, including integrated cost terms and constraint indicator functions, are cast as expectations of functions of the terminal state of a motion primitive. Explicit uncertainty quantification via the Koopman operator is used to obtain sample-efficient schemes for evaluating these expectations. The sampling scheme permits casting the planning problem as a Chance-Constrained Markov Decision Process with a finite set of actions, for which a policy can be obtained by forward search on an And/Or graph. Techniques for efficient solution of this search problem are presented. Future work is focused on improvements to the And/Or graph search and on further generalization of the uncertain motion primitive framework.

Additional Information

In Campus Calendar
No
Groups

Graduate Studies

Invited Audience
Faculty/Staff, Public, Graduate students, Undergraduate students
Categories
Other/Miscellaneous
Keywords
Phd proposal
Status
  • Created By: Tatianna Richardson
  • Workflow Status: Published
  • Created On: May 25, 2021 - 11:50am
  • Last Updated: May 25, 2021 - 11:50am