An automotive collision avoidance control based on a feasible set

This paper considers an optimal path generation problem that generates a path of an automobile without any collision with obstacles. The problem is formulated as a mixed integer programming problem. In the problem the obstacles and environments around the automobile can be represent as inequality conditions. A feasible set called collision avoidable set (CAS) is considered to constract a driver assisit control.

[1]  David Q. Mayne,et al.  Constrained model predictive control: Stability and optimality , 2000, Autom..

[2]  J. How,et al.  Mixed-integer programming for control , 2005, Proceedings of the 2005, American Control Conference, 2005..

[3]  M. Fujita,et al.  A collision avoidance control for multi-vehicle using PWA/MLD hybrid system representation , 2004, Proceedings of the 2004 IEEE International Conference on Control Applications, 2004..

[4]  Y. Oishi,et al.  Stability analysis of aperiodic sampled-data control systems: An approach using robust linear matrix inequalities , 2009, 2009 ICCAS-SICE.

[5]  Sung Hyun Kim,et al.  An improved approach to robust H∞ stabilization for networked control systems , 2009, 2009 ICCAS-SICE.

[6]  Jonathan P. How,et al.  Aircraft trajectory planning with collision avoidance using mixed integer linear programming , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[7]  T. Ohtsuka,et al.  An optimal path generator using a receding horizon control scheme for intelligent automobiles , 2004, Proceedings of the 2004 IEEE International Conference on Control Applications, 2004..