Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Efficient mixed-integer planning for UAVs in cluttered environments

Efficient mixed-integer planning for UAVs in cluttered environments

Thumbnail Image
Download
Name

Tedrake_Efficient mixed.pdf

Size

785.29 KB

Format

Adobe PDF

Checksum (MD5)

3e22856629d73a56adbe44beb9284e4c

Author(s)
Deits, Robin Lloyd Henderson
•
Tedrake, Russell Louis
Date Issued
May 2015
Journal
Proceedings of the 2015 IEEE International Conference on Robotics and Automation (ICRA)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Deits, Robin, and Russ Tedrake. “Efficient Mixed-Integer Planning for UAVs in Cluttered Environments.” 2015 IEEE International Conference on Robotics and Automation (ICRA) (May 2015).
Version
Author's final manuscript
Abstract
We present a new approach to the design of smooth trajectories for quadrotor unmanned aerial vehicles (UAVs), which are free of collisions with obstacles along their entire length. To avoid the non-convex constraints normally required for obstacle-avoidance, we perform a mixed-integer optimization in which polynomial trajectories are assigned to convex regions which are known to be obstacle-free. Prior approaches have used the faces of the obstacles themselves to define these convex regions. We instead use IRIS, a recently developed technique for greedy convex segmentation [1], to pre-compute convex regions of safe space. This results in a substantially reduced number of integer variables, which improves the speed with which the optimization can be solved to its global optimum, even for tens or hundreds of obstacle faces. In addition, prior approaches have typically enforced obstacle avoidance at a finite set of sample or knot points. We introduce a technique based on sums-of-squares (SOS) programming that allows us to ensure that the entire piecewise polynomial trajectory is free of collisions using convex constraints. We demonstrate this technique in 2D and in 3D using a dynamical model in the Drake toolbox for Matlab [2].
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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/101082
DOI of Published Version
https://doi.org/10.1109/ICRA.2015.7138978
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.