Abstract
This paper introduces a heuristic planar trajectory-generation framework for multiple vehicles. Desired feasible trajectories are generated using Pythagorean Hodograph B ́ezier curves that satisfy the dynamic constraints of the vehicles, and guarantee spatial separation between the paths for safe operation. It is shown that the trajectory generation framework can be cast into a constrained optimization problem where a set of (sub)optimal desired trajectories are obtained by minimizing a cost function. To show the efficiency of the algorithm, a simulation example is given, where three fixed-wing Unmanned Aerial Vehicles are following and coordinating along feasible trajectories that are generated by the algorithm.
Original language | English (US) |
---|---|
DOIs | |
State | Published - 2013 |
Event | AIAA Infotech at Aerospace (I at A) Conference - Boston, MA, United States Duration: Aug 19 2013 → Aug 22 2013 |
Other
Other | AIAA Infotech at Aerospace (I at A) Conference |
---|---|
Country/Territory | United States |
City | Boston, MA |
Period | 8/19/13 → 8/22/13 |
ASJC Scopus subject areas
- Aerospace Engineering