Abstract
Given n vertices in a plane and UCAV going through each vertex once and only once and then coming back, the objective is to find the direction (heading) of motion in each vertex to minimize the smooth path of bounded curvature. This paper studies the headings of UCAV. First, the optimal headings for two vertices were given. On this basis, an n-player two-strategy game theoretic model was established. In addition, in order to obtain the mixed Nash equilibrium efficiently, n linear equations were set up. The simulation results demonstrated that the headings given in this paper are effective.