Research paper
Fleet trajectories · Sequential convexification with feasibility checks
Sequential convex programming approximates nonconvex multi-vehicle trajectory constraints. Vehicle-specific feasibility checks and time-step adjustment accompany reported quadrotor flights in the Flying Machine Arena.
Reviewed 2026-11-05 · Source and bibliography checked
- Original title
- Generation of collision-free trajectories for a quadrocopter fleet: A sequential convex programming approach
- Publisher
- IEEE
- Authors
- Federico Augugliaro, Angela P. Schoellig, Raffaello D'Andrea
- DOI
- 10.1109/iros.2012.6385823
- Publication date
- 2012-10
- Source language
- en
- Edition
- 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems; 2012-10; DOI 10.1109/iros.2012.6385823
- Access
- Publisher metadata and open author manuscript
- Publication status
- Published
Related resources and engineering notes
Source overview
Sequential convex programming approximates nonconvex multi-vehicle trajectory constraints. Vehicle-specific feasibility checks and time-step adjustment accompany reported quadrotor flights in the Flying Machine Arena.
Use and review
Bibliography and indexed institutional paper text checked; current direct PDF access failed. Between-step collisions and vehicle-specific feasibility checks remain material.
Sources & editions
Generation of collision-free trajectories for a quadrocopter fleet: A sequential convex programming approach ↗
IEEE · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems; 2012-10; DOI 10.1109/iros.2012.6385823
IROS2012 author paper https://www.flyingmachinearena.ethz.ch/wp-content/publications/2012/AugugliaroIROS2012.pdf; indexed author-paper algorithm/conclusion and flight results.