Path Planning of UAV by Combing Improved Ant Colony System and Dynamic Window Algorithm

A fusion algorithm is proposed to enhance the search speed of an ant colony system(ACS)for the global path planning and overcome the challenges of the local path planning in an unmanned aerial vehicle(UAV).The ACS search efficiency is enhanced by adopting a 16-direction 24-neighborhood search way,a safety grid search way,and an elite hybrid strategy to accelerate global convergence.Quadratic planning is performed using the moving average(MA)method.The fusion algorithm incorporates a dynamic window approach(DWA)to deal with the local path planning,sets a retracement mechanism,and adjusts the evaluation function accordingly.Experimental results in two environments demonstrate that the improved ant colony system(IACS)achieves superior planning efficiency.Additionally,the optimized dynamic window approach(ODWA)demonstrates its ability to handle multiple dynamic situations.Overall,the fusion optimization algorithm can accomplish the mixed path planning effectively.

Dual-mode dynamic window approach to robot navigation with convergence guarantees

In this paper,a novel,dual-mode model predictive control framework is introduced that combines the dynamic window approach to navigation with generic path planning techniques through a dual-mode model predictive control framework.The planned path adds information on the connectivity of the free space to the obstacle avoidance capabilities of the dynamic window approach.This allows for guaranteed convergence to a goal location while navigating through an unknown environment at relatively high speeds.The framework is applied in a combined simulation/hardware implementation to demonstrate the computational feasibility and the ability to cope with the constraints of a dynamic system.

COMPRESSIBLE VIRTUAL WINDOW ALGORITHM IN PICKING PROCESS CONTROL OF AUTOMATED SORTING SYSTEM

Compared to fixed virtual window algorithm （FVWA）, the dynamic virtual window algorithm （DVWA） determines the length of each virtual container according to the sizes of goods of each order, which saves space of virtual containers and improves the picking efficiency. However, the interval of consecutive goods caused by dispensers on conveyor can not be eliminated by DVWA, which limits a further improvement of picking efficiency. In order to solve this problem, a compressible virtual window algorithm （CVWA） is presented. It not only inherits the merit of DVWA but also compresses the length of virtual containers without congestion of order accumulation by advancing the beginning time of order picking and reasonably coordinating the pace of order accumulation. The simulation result proves that the picking efficiency of automated sorting system is greatly improved by CVWA.

Performance analysis of fast GPS signal acquisition based on PMF and Window FFT

Combining the advantages of partial matched filter（PMF） and fast Fourier transform（FFT）,an improved fast acquisition method for GPS C/A code is proposed.According to PMF-FFT acquisition architecture,the greater the number of PMF will bring out the more slowly amplitude decreasing of the amplitude-frequency response,the smaller scale of the corresponding PMF,and the larger computation of the FFT.In order to compensate the frequency spectrum attenuation caused by spectrum leakage and fence effect,adding window function to PMF-FFT is presented.Through comparing the influences to the acquisition performance based on rectangular,Hamming,Blackman and Rife-Vincent（Ⅲ） window functions,an improved Rife-Vincent Ⅲ windowing algorithm is recommended for the fast acquisition based on PMF-FFT.