Cooperative Trajectory Generation
Our work is based on the use of Bezier curves, defined by Bernstein polynomials, which have favorable geometric and mathematical properties. We formulate the cooperative trajectory generation problem as a continuous-time optimal control problem, and approximate it by a discrete-time formulation using Bernstein polynomials. These polynomials allow for efficient computation of constraints (e.g. minimum distance between trajectories, input saturation constraints, etc.) along the whole trajectory, and are particularly convenient for generating optimal trajectories for safe operation of multiple vehicles in complex environments. The benefits of using Bezier curves for trajectory generation in multi-agent missions are discussed in  and . Reference  uses Bezier curves to address the problem of distributed trajectory generation for a large fleet of agents. Finally, reference  analyzes the convergence properties of the proposed framework and presents a comparison with other techniques based on direct methods.
Figure 1. A typical scenario of cooperative trajectory generation
- R. Choe, J. Puig-Navarro, V. Cichella, E. Xargay, and N. Hovakimyan. Cooperative trajectory generation using Pythagorean Hodograph Bézier curves. In Journal of Guidance, Control, and Dynamics, pages 1–20, 2016
- R. Choe. Distributed cooperative trajectory generation for multiple autonomous vehicles using Pythagorean Hodograph Bézier curves. PHD Thesis, University of Illinois at Urbana-Champaign, Urbana, IL, United States, 2017. (link to this thesis)
- V. Cichella, I. Kaminer, C. Walton, and N. Hovakimyan. Bernstein approximation of optimal control problems for differentially flat systems. In Proceedings of 56th IEEE Conference on Decision and Control (CDC). 2017. Submitted.