An improyed ant colony optimization approach for multi-aircraft escape maneuvers in the horizontal plane was proposed in this paper. An ant colony algorithm is a typical cluster algorithm, which is a new application i...
详细信息
ISBN:
(纸本)9781467316996
An improyed ant colony optimization approach for multi-aircraft escape maneuvers in the horizontal plane was proposed in this paper. An ant colony algorithm is a typical cluster algorithm, which is a new application in aircraft traffic collision avoidance system. A multi-aircraft horizontal maneuver model based on ant colony algorithm was proposed. The right maneuver angle as probability value was selected as the optimization parameter in the ant colony approach, which is a preference angle. And multiple simulation results showed that the improved ant colony algorithm made a great progress than the basic ant colony algorithm, which with the minimum maneuver cost in conflict escape. This improved ant colony optimization approach can apply in the next generation TCAS in horizontal RAs.
To solve the constraint multi-solution problem, the constraints are separated to two sets, the original constraint set and the additional constraint set. First, the solver finds out multiple solutions. Then genetic al...
详细信息
ISBN:
(纸本)9781424429141
To solve the constraint multi-solution problem, the constraints are separated to two sets, the original constraint set and the additional constraint set. First, the solver finds out multiple solutions. Then genetic algorithm and ant algorithm are combined in the process of searching optimal solution. We adopt genetic algorithm in the former process to produce the initiatory distribution of information elements, and then ant algorithm in the latter process. The random colony is adopted in genetic algorithm, which can not only accelerate the convergence process of ant algorithm but also avoid the local best solution. The heuristic searching algorithm maximizes the fitness of the additional constraint set, thereby reaches the final result that can satisfy the user's expectation.
Fluidic lens camera systems present a new field of exploration for both the optics and image processing communities. Developed for surgical applications, these cameras do not have moving parts while zooming and they h...
详细信息
ISBN:
(纸本)9781424456536;9781424456543
Fluidic lens camera systems present a new field of exploration for both the optics and image processing communities. Developed for surgical applications, these cameras do not have moving parts while zooming and they have better miniaturization possibilities. However, the lens causes non-uniform color blur between color planes which creates an image processing problem. We propose the use of a contourlet filter bank system to deblur color images without estimating a point spread function. This multi-band deblurring method uses sharper color planes to improve blurred ones. Compared to the conventional Lucy-Richardson and Wiener filtering, our previous wavelet-based method significantly improves sharpness and ghosting artifacts. The proposed contourlet-based system better adjusts to the natural image contours. This effect produces an image with a similar level of sharpness, but fewer ghosting artifacts. Furthermore, we analyze conditions for when this algorithm will reduce the mean squared error. We also use an ant Colony Optimization algorithm to detect sharp edges. This algorithm naturally extends to many systems for multi-band deblurring that have high edge correlation.
In recent years, smart and ecological urbanism and transformations into the new models of city making have become a global mainstream. These are models of the smart city, the eco-city, and the eco-megacity. The articl...
详细信息
ants of artificial colony are able to generate good solutions to the famous traveling salesman problem (TSP).We propose an artificial ants algorithm for solving the minimum ratio TSP, which is more general than the st...
详细信息
ants of artificial colony are able to generate good solutions to the famous traveling salesman problem (TSP).We propose an artificial ants algorithm for solving the minimum ratio TSP, which is more general than the standard TSP in combinatorial optimization area. In the minimum ratio TSP, another criterion concerning each edge is added, that is,the traveling salesman can have a benefit if he travels from one city to another. The objective is to minimize the ratio between total costs or distances and total benefits. The idea of this type of optimization is in some sense quite similar to that of traditional cost-benefit analysis in management science. Computational results substantiate the solution quality and efficiency of the algorithm.
暂无评论