Near-OptimaI Collision Avoidance Maneuvers for UAV

  • Published : 2004.12.31


Collision avoidance for multiple aircraft can be stated as a problem ofmaintaining safe distance between aircraft in conflict. Optimal collision avoidanceproblem seeks to minimize the given cost function while simultaneously satisfyingconstraints. The cost function could be a function of time or control input. This paper addresses the trajectory time-optimization problem for collision avoidance of unmanned aerial vehicles(UAVs). The problem is difficult to handle in general due to the two-point boundary value problem subject to dynamic environments. Some simplifying aleorithms are used for potential applications in on-line operation.Although under possibility of more complicated problems, a dynamic problem is transformed into a static one by prediction of the conflict time and some appropriate assumptions.


  1. Kumar, B. A., and Ghose, D., 2001, 'Radar-assisted collision avoidance/guidance strategy for planar flight', IEEE Transactions on Aerospace And Electronic System, Vol.37, No.1, pp.77-90
  2. Sundar, S. and Shiller, Z., 1997, 'Optimal obstacle avoidance based on the Hamilton-Jacobi-Bellman equation', IEEE Transaction on Robotics and Automation, Vol.13, No.2, pp.305-310
  3. Twigg, S., Calise, A., and Johnson, E., 2003, 'On-line trajectory optimization for autonomous air vehicles', AIAA Guidance, Navigation and Control Conference, number AIAA-2003-5522, Austin, TX
  4. Fiorini, P., and Shiller, Z., 1995, 'Robot motion planning in dynamic envtronments', International Symposium of Robotic Research, Munich, Germany, pp.237-248
  5. Hu, J., Prandini, M., and Sastry, S., 2002, 'Optimal coordinated maneuvers for three-dimensional aircraft conflict resolution', Journal of Guidance, and Dynamics, Vol.25, No.5, pp.888-900