Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Polynomial Trajectory Planning for Aggressive Quadrotor Flight in Dense Indoor Environments

Polynomial Trajectory Planning for Aggressive Quadrotor Flight in Dense Indoor Environments

Thumbnail Image
Download
Name

Roy_Polynomial trajectory.pdf

Size

4.47 MB

Format

Adobe PDF

Checksum (MD5)

263440c3d73c0363ff214dec11be119f

Author(s)
Richter, Charles Andrew
•
Bry, Adam P.
•
Roy, Nicholas
Date Issued
April 2016
Journal
Proceedings of the International Symposium of Robotics Research, 2013
Publisher
Sage Publications
Citation
Richter, Charles, Adam Bry, and Nicholas Roy. “Polynomial Trajectory Planning for Aggressive Quadrotor Flight in Dense Indoor Environments.” Robotics Research. Ed. Masayuki Inaba and Peter Corke. Vol. 114. Cham: Springer International Publishing, 2016. 649–666.
Version
Author's final manuscript
Abstract
We explore the challenges of planning trajectories for quadrotors through cluttered indoor environments. We extend the existing work on polynomial trajectory generation by presenting a method of jointly optimizing polynomial path segments in an unconstrained quadratic program that is numerically stable for high-order polynomials and large numbers of segments, and is easily formulated for efficient sparse computation. We also present a technique for automatically selecting the amount of time allocated to each segment, and hence the quadrotor speeds along the path, as a function of a single parameter determining aggressiveness, subject to actuator constraints. The use of polynomial trajectories, coupled with the differentially flat representation of the quadrotor, eliminates the need for computationally intensive sampling and simulation in the high dimensional state space of the vehicle during motion planning. Our approach generates high-quality trajecrtories much faster than purely sampling-based optimal kinodynamic planning methods, but sacrifices the guarantee of asymptotic convergence to the global optimum that those methods provide. We demonstrate the performance of our algorithm by efficiently generating trajectories through challenging indoor spaces and successfully traversing them at speeds up to 8 m/s. A demonstration of our algorithm and flight performance is available at: http://​groups.​csail.​mit.​edu/​rrg/​quad_​polynomial_​trajectory_​planning.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/106840
DOI of Published Version
https://doi.org/10.1007/978-3-319-28872-7_37
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.