منابع مشابه
Minimum-Time Roll Around the Velocity-Vector Maneuver of Aircraft
In this paper, some results are provided for minimum time roll about velocity vector maneuvering with thrust-vectoring and aerodynamic control in effect. The mathematical model for attitude motions of the aircraft is developed. First order necessary conditions for optimality using Pontryagen principle is applied, and the existence of an extreme family of solutions for the maneuver is shown. Mul...
متن کاملMinimum-Time Roll Around the Velocity-Vector Maneuver of Aircraft
In this paper, some results are provided for minimum time roll about velocity vector maneuvering with thrust-vectoring and aerodynamic control in effect. The mathematical model for attitude motions of the aircraft is developed. First order necessary conditions for optimality using Pontryagen principle is applied, and the existence of an extreme family of solutions for the maneuver is shown. Mul...
متن کاملOn Covering Points with Minimum Turns
For the rectilinear version of the problem in which the lines must be axis-parallel, • Hassin and Megiddo (1991) observed that the problem in R reduces to vertex cover in bipartite graphs and hence is solvable in polynomial time, and proved that the problem in R in NP-hard by a reduction from 3SAT, • Gaur and Bhattacharya (2007) presented a (d − 1)approximation algorithm for the problem in R fo...
متن کاملA Note On Minimum Path Bases
Given an undirected graph G(V,E) and a vertex subset U ⊆ V the U -space is the vector space over GF(2) spanned by the paths with end-points in U and the cycles in G(V,E). We extend Vismara’s algorithm to the computation of the union of all minimum length bases of the U -space.
متن کاملA note on finding minimum mean cycle
In a directed graph with edge weights, the mean weight of a directed cycle is the weight of its edges divided by their number. The minimum cycle mean of the graph is the minimum mean weight of a cycle. Karp gave a characterization of minimum cycle mean and an O(nm) algorithm to compute it, where n is the number of vertices and m is the number of edges. However, an algorithm he suggested for ide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan Society for Aeronautical and Space Sciences
سال: 1988
ISSN: 0021-4663
DOI: 10.2322/jjsass1969.36.433