PhD Defense by Oktay Arslan

Event Details
  • Date/Time:
    • Friday September 25, 2015
      2:30 pm - 4:30 pm
  • Location: Montgomery Knight Building: Room 317
  • Phone:
  • URL:
  • Email:
  • Fee(s):
  • Extras:
No contact information submitted.

Summary Sentence: Machine Learning and Dynamic Programming Algorithms for Motion Planning and Control

Full Summary: No summary paragraph submitted.

Ph.D. Thesis Defense




Oktay Arslan

(Advisor: Prof. Panagiotis Tsiotras)

2:30 PM, Friday, September 25, 2015

Montgomery Knight Building

Room 317




Machine Learning and Dynamic Programming Algorithms

for Motion Planning and Control





Robot motion planning is one of the central problems in robotics, and has received considerable amount of attention not only from roboticists but also from the control and artificial intelligence (AI) communities. Despite the different types of applications and physical properties of robotic systems, many high-level tasks in autonomous systems can be decomposed into subtasks which require essentially point-to-point navigation of the robot while avoiding some infeasible regions due to the obstacles in the workspace. This thesis aims at developing a new class of sampling-based motion planning algorithms that are fast, efficient and asymptotically optimal by employing ideas from Machine Learning (ML) and Dynamic Programming (DP).  First, we interpret the robot motion planning problem as a form of machine learning problem since the underlying search space is not known a priori, and utilize random geometric graphs to compute a consistent discretization of the underlying continuous search space. Then, we integrate existing DP algorithms and ML algorithms to the framework of sampling-based algorithms for better exploitation and exploration respectively. We present a novel sampling-based algorithm, called RRT#, that improves upon the well-known RRT* algorithm by leveraging value and policy iteration methods as new information is collected. The proposed algorithms yield provable guarantees on correctness, completeness and asymptotic optimality. We also develop an adaptive sampling strategy by considering exploration as a classification (or regression) problem, and use online machine learning algorithms to learn the relevant region of a query, i.e., the region that contains the optimal solution, without significant computational overhead. We then extend the application of sampling-based algorithms to a class of stochastic optimal control problems and problems with differential constraints. Specifically, we introduce the Path Integral - RRT algorithm, for solving optimal control of stochastic systems and the CL-RRT# algorithm that uses closed-loop prediction for trajectory generation for differential systems. One of the key benefits of CL-RRT# is that for many systems, given a low-level tracking controller, it is easier to handle differential constraints, so complex steering procedures are not needed, unlike most existing kinodynamic sampling-based algorithms. Implementation results of sampling-based planners for route planning of a full-scale autonomous helicopter under the Autonomous Aerial Cargo/Utility System Program (AACUS) program are provided.


Committee Members:

Prof. Panagiotis Tsiotras (Advisor), School of Aerospace Engineering, Georgia Tech

Prof. Eric Feron, School of Aerospace Engineering, Georgia Tech

Prof. Evangelos Theodorou, School of Aerospace Engineering, Georgia Tech

Prof. Frank Dellaert, School of Interactive Computing, Georgia Tech

Prof. Le Song, School of Computational Science & Engineering, Georgia Tech

Prof. Sertac Karaman, Department of Aeronautics and Astronautics, MIT

Additional Information

In Campus Calendar

Graduate Studies

Invited Audience
Phd Defense
  • Created By: Tatianna Richardson
  • Workflow Status: Published
  • Created On: Sep 15, 2015 - 8:23am
  • Last Updated: Oct 7, 2016 - 10:13pm