The DOI matches its Crossref record; 76 of the 76 references it cites were found in a registry or an index.
Geometrically Constrained Trajectory Optimization for Multicopters
Open accessAbstract
In this article, we present an optimization-based framework for multicopter trajectory planning subject to geometrical configuration constraints and user-defined dynamic constraints. The basis of the framework is a novel trajectory representation built upon our novel optimality conditions for unconstrained control effort minimization. We design linear-complexity operations on this representation to conduct spatial–temporal deformation under various planning requirements. Smooth maps are utilized to exactly eliminate geometrical constraints in a lightweight fashion. A variety of state-input constraints are supported by the decoupling of dense constraint evaluation from sparse parameterization and the backward differentiation of flatness map. As a result, this framework transforms a generally constrained multicopter planning problem into an unconstrained optimization that can be solved reliably and efficiently. Our framework bridges the gaps among solution quality, planning efficiency, and constraint fidelity for a multicopter with limited resources and maneuvering capability. Its generality and robustness are both demonstrated by applications to different flight tasks. Extensive simulations and benchmarks are also conducted to show its capability of generating high-quality solutions while retaining the computation speed against other specialized methods by orders of magnitude.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
(1995) · Cited by 10,558
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483
(2006) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/978-0-387-40065-5 · Cited by 9,008
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · cited 3×
“The Probabilistic Roadmap (PRM) [16] and the Rapidly-exploring Random Tree (RRT) [17] are both probabilistically complete since their probability of failure decays to zero exponentially as the sample number goes to infinity [18].”
BackgroundThe quickhull algorithm for convex hulls
Barber, C. B., Dobkin, D. P., & Huhdanpaa, H. (1996) · ACM Transactions on Mathematical Software · doi:10.1145/235815.235821 · Cited by 5,359
Sampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
Horn, R. A., & Johnson, C. R. (2012) · doi:10.1017/cbo9781139020411 · Cited by 4,642
Rapidly-exploring random trees : a new tool for path planning
LaValle, S. M. (1998) · Cited by 3,704
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Flatness and defect of non-linear systems: introductory theory and examples
FLIESS, M., LÉVINE, J., MARTIN, P., & ROUCHON, P. (1995) · International Journal of Control · doi:10.1080/00207179508921959 · Cited by 3,126
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2005) · SIAM Review · doi:10.1137/s0036144504446096 · Cited by 2,834
Survey of Numerical Methods for Trajectory Optimization
Betts, J. T. (1998) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4231 · Cited by 2,602
Spline Functions: Basic Theory.
Smith, P. W., & Schumaker, L. (1982) · Mathematics of Computation · doi:10.2307/2007301 · Cited by 2,463
Minimum snap trajectory generation and control for quadrotors
Mellinger, D., & Kumar, V. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980409 · Cited by 2,367
Introduction to Smooth Manifolds
Lee, J. M. (2012) · Graduate Texts in Mathematics · doi:10.1007/978-1-4419-9982-5 · Cited by 2,296
FAST-LIO2: Fast Direct LiDAR-Inertial Odometry
Xu, W., Cai, Y., He, D., Lin, J., & Zhang, F. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3141876 · Cited by 1,750
Practical Methods for Optimal Control and Estimation Using Nonlinear Programming
Betts, J. T. (2010) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718577 · Cited by 1,567
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, Second Edition
Griewank, A., & Walther, A. (2008) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898717761 · Cited by 1,529
Handbook of discrete and computational geometry
(1998) · Choice Reviews Online · doi:10.5860/choice.35-5707b · Cited by 1,456
Patterson, M. A., & Rao, A. V. (2014) · ACM Transactions on Mathematical Software · doi:10.1145/2558904 · Cited by 1,349
Spline Functions: Basic Theory
Schumaker, L. (2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511618994 · Cited by 1,283
OSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
Handbook of Discrete and Computational Geometry, Second Edition
(2004) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035315 · Cited by 1,208
ACADO toolkit—An open‐source framework for automatic control and dynamic optimization
Houska, B., Ferreau, H. J., & Diehl, M. (2011) · Optimal Control Applications and Methods · doi:10.1002/oca.939 · Cited by 984
STOMP: Stochastic trajectory optimization for motion planning
Kalakrishnan, M., Chitta, S., Theodorou, E., Pastor, P., & Schaal, S. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980280 · Cited by 876
Motion planning with sequential convex optimization and convex collision checking
Schulman, J., Duan, Y., Ho, J., Lee, A., Awwal, I., Bradlow, H., Pan, J., Patil, S., Goldberg, K., & Abbeel, P. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914528132 · Cited by 866
A Supernodal Approach to Sparse Partial Pivoting
Demmel, J. W., Eisenstat, S. C., Gilbert, J. R., Li, X. S., & Liu, J. W. H. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895291765 · Cited by 840
Real-Time Motion Planning for Agile Autonomous Vehicles
Frazzoli, E., Dahleh, M. A., & Feron, E. (2002) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4856 · Cited by 830
Elastic bands: connecting path planning and control
Quinlan, S., & Khatib, O. (2002) · [1993] Proceedings IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1993.291936 · Cited by 793
CHOMP: Covariant Hamiltonian optimization for motion planning
Zucker, M., Ratliff, N., Dragan, A. D., Pivtoraiko, M., Klingensmith, M., Dellin, C. M., Bagnell, J. A., & Srinivasa, S. S. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913488805 · Cited by 758
Janson, L., Schmerling, E., Clark, A., & Pavone, M. (2015) · The International Journal of Robotics Research · doi:10.1177/0278364915577958 · Cited by 576
Liu, S., Watterson, M., Mohta, K., Sun, K., Bhattacharya, S., Taylor, C. J., & Kumar, V. (2017) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2017.2663526 · Cited by 555
EGO-Planner: An ESDF-Free Gradient-Based Local Planner for Quadrotors
Zhou, X., Wang, Z., Ye, H., Xu, C., & Gao, F. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.3047728 · Cited by 547
Self-citationTime-Optimal Path Tracking for Robots: A Convex Optimization Approach
Verscheure, D., Demeulenaere, B., Swevers, J., De Schutter, J., & Diehl, M. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2028959 · Cited by 536
Faessler, M., Franchi, A., & Scaramuzza, D. (2017) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2017.2776353 · Cited by 469
The complexity of partial derivatives
Baur, W., & Strassen, V. (1983) · Theoretical Computer Science · doi:10.1016/0304-3975(83)90110-x · Cited by 468
Towards a swarm of agile micro quadrotors
Kushleyev, A., Mellinger, D., Powers, C., & Kumar, V. (2013) · Autonomous Robots · doi:10.1007/s10514-013-9349-9 · Cited by 425
Optimal kinodynamic motion planning using incremental sampling-based methods
Karaman, S., & Frazzoli, E. (2010) · 49th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717430 · Cited by 416
Analysis of probabilistic roadmaps for path planning
Kavraki, L. E., Kolountzakis, M. N., & Latombe, J.-C. (2002) · Proceedings of IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1996.509171 · Cited by 409
A modified BFGS method and its global convergence in nonconvex minimization
Li, D., & Fukushima, M. (2001) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00540-9 · Cited by 407
A Computationally Efficient Motion Primitive for Quadrocopter Trajectory Generation
Mueller, M. W., Hehn, M., & D'Andrea, R. (2015) · IEEE Transactions on Robotics · doi:10.1109/tro.2015.2479878 · Cited by 377
Trajectory Planning for Quadrotor Swarms
Honig, W., Preiss, J. A., Kumar, T. K. S., Sukhatme, G. S., & Ayanian, N. (2018) · IEEE Transactions on Robotics · doi:10.1109/tro.2018.2853613 · Cited by 315
RAPTOR: Robust and Perception-Aware Trajectory Replanning for Quadrotor Fast Flight
Zhou, B., Pan, J., Gao, F., & Shen, S. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2021.3071527 · Cited by 308
Self-citationLoianno, G., Brunner, C., McGrath, G., & Kumar, V. (2017) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2016.2633290 · Cited by 305
Real-time trajectory generation for differentially flat systems
Van Nieuwstadt, M. J., & Murray, R. M. (1998) · International Journal of Robust and Nonlinear Control · doi:10.1002/(sici)1099-1239(199809)8:11<995::aid-rnc373>3.0.co;2-w · Cited by 264
Asymptotically optimal sampling-based kinodynamic planning
Li, Y., Littlefield, Z., & Bekris, K. E. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915614386 · Cited by 262
Computing Large Convex Regions of Obstacle-Free Space Through Semidefinite Programming
Deits, R., & Tedrake, R. (2015) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-16595-0_7 · Cited by 249
Efficient mixed-integer planning for UAVs in cluttered environments
Deits, R., & Tedrake, R. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7138978 · Cited by 222
Search-based motion planning for quadrotors using linear quadratic minimum time control
Liu, S., Atanasov, N., Mohta, K., & Kumar, V. (2017) · 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8206119 · Cited by 220
AlphaPilot: Autonomous Drone Racing
Foehn, P., Brescianini, D., Kaufmann, E., Cieslewski, T., Gehrig, M., Muglikar, M., & Scaramuzza, D. (2020) · Autonomous Robots · doi:10.1007/s10514-021-10011-y · Cited by 203
Fast, autonomous flight in GPS‐denied and cluttered environments
Mohta, K., Watterson, M., Mulgaonkar, Y., Liu, S., Qu, C., Makineni, A., Saulnier, K., Sun, K., Zhu, A., Delmerico, J., et al. (2018) · Journal of Field Robotics · doi:10.1002/rob.21774 · Cited by 200
Teach-Repeat-Replan: A Complete and Robust System for Aggressive Flight in Complex Environments
Gao, F., Wang, L., Zhou, B., Zhou, X., Pan, J., & Shen, S. (2020) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.2993215 · Cited by 188
Self-citationFalanga, D., Mueggler, E., Faessler, M., & Scaramuzza, D. (2017) · 2017 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2017.7989679 · Cited by 185
FASTER: Fast and Safe Trajectory Planner for Flights in Unknown Environments
Tordesillas, J., Lopez, B. T., & How, J. P. (2019) · 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros40897.2019.8968021 · Cited by 184
Nageli, T., Alonso-Mora, J., Domahidi, A., Rus, D., & Hilliges, O. (2017) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2017.2665693 · Cited by 173
A computational algorithm for functional inequality constrained optimization problems
Jennings, L. S., & Teo, K. L. (1990) · Automatica · doi:10.1016/0005-1098(90)90131-z · Cited by 168
Aggressive flight of fixed-wing and quadrotor aircraft in dense indoor environments
Bry, A., Richter, C., Bachrach, A., & Roy, N. (2015) · The International Journal of Robotics Research · doi:10.1177/0278364914558129 · Cited by 166
Gao, F., Wu, W., Gao, W., & Shen, S. (2019) · Journal of Field Robotics · doi:10.1002/rob.21842 · Cited by 165
Self-citationITOMP: Incremental Trajectory Optimization for Real-Time Replanning in Dynamic Environments
Park, C., Pan, J., & Manocha, D. (2012) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v22i1.13513 · Cited by 160
Proximity Queries and Penetration Depth Computation on 3D Game Objects
van den Bergen, G. (2001) · Cited by 154
Oleynikova, H., Lanegger, C., Taylor, Z., Pantic, M., Millane, A., Siegwart, R., & Nieto, J. I. (2020) · Journal of Field Robotics · doi:10.1002/rob.21950 · Cited by 87
Perception-aware Receding Horizon Navigation for MAVs
Zhang, Z., & Scaramuzza, D. (2018) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2018.8461133 · Cited by 80
Efficient Trajectory Planning for High Speed Flight in Unknown Environments
Ryll, M., Ware, J., Carter, J., & Roy, N. (2019) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2019.8793930 · Cited by 64
Autonomous navigation of MAVs in unknown cluttered environments
Campos‐Macías, L., Aldana‐López, R., de la Guardia, R., Parra‐Vilchis, J. I., & Gómez‐Gutiérrez, D. (2020) · Journal of Field Robotics · doi:10.1002/rob.21959 · Cited by 56
A Hybrid Method for Online Trajectory Planning of Mobile Robots in Cluttered Environments
Campos‐Macías, L., Gomez-Gutierrez, D., Aldana‐López, R., de la Guardia, R., & Parra-Vilchis, J. I. (2017) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2017.2655145 · Cited by 50
Control of Quadrotors Using the Hopf Fibration on SO(3)
Watterson, M., & Kumar, V. (2019) · Springer proceedings in advanced robotics · doi:10.1007/978-3-030-28619-4_20 · Cited by 47
Fisher Information Field: an Efficient and Differentiable Map for Perception-aware PlanningPreprint
Zhang, Z., & Scaramuzza, D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.03324 · Cited by 40
MINVO Basis: Finding Simplexes with Minimum Volume Enclosing Polynomial Curves
Tordesillas, J., & How, J. P. (2022) · Computer-Aided Design · doi:10.1016/j.cad.2022.103341 · Cited by 39
External Forces Resilient Safe Motion Planning for Quadrotor
Wu, Y., Ding, Z., Xu, C., & Gao, F. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3110316 · Cited by 32
Self-citationGenerating Minimum-Snap Quadrotor Trajectories Really Fast
Burke, D., Chapman, A., & Shames, I. (2020) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros45743.2020.9341794 · Cited by 30
Fast UAV Trajectory Optimization using Bilevel Optimization with Analytical Gradients
Sun, W., Tang, G., & Hauser, K. K. (2020) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc45564.2020.9147300 · Cited by 24
CPC: Complementary Progress Constraints for Time-Optimal Quadrotor TrajectoriesPreprint
Foehn, P., & Scaramuzza, D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.06255 · Cited by 10
Cited by
Swarm of micro flying robots in the wild
Zhou, X., Wen, X., Wang, Z., Gao, Y., Li, H., Wang, Q., Yang, T., Lu, H., Cao, Y., Xu, C., et al. (2022) · Science Robotics · doi:10.1126/scirobotics.abm5954 · Cited by 657
Self-citation
Metadata
- Authors
- Wang, Z., Zhou, X., Xu, C., & Gao, F.
- Venue
- IEEE Transactions on Robotics
- Published
- 2022-10
- Volume
- 38
- Issue
- 5
- Pages
- 3259-3278
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W3135798748
- Cited by
- 434
- References
- 76
- FWCI
- 26.22
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.