Online path planning method for auv based on fully oscillating invasive weed optimization algorithm
An optimization algorithm and path planning technology, applied in two-dimensional position/channel control, vehicle position/route/altitude control, instruments and other directions, which can solve the problem that the real-time performance of path planning and path optimality cannot be satisfied at the same time, and online is not considered. Path planning, high cost and high cost, to prevent falling into local optimum, improve the progress of optimization, and achieve good real-time performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment approach
[0092] As an implementation, in the full oscillating invasive weed optimization algorithm, the position information carried by the jth weed is a j =(θ 1j ,θ 2j ,…,θ (n-2)j ), θ 1j …theta (n-2)j Respectively represent the angle values corresponding to the n-2 path control points carried by the jth weed except the starting point and the ending point;
[0093] Select the optimal solution of the global planning as the initial solution of the first re-planning, and set the initial solution of the global planning as a best =(θ 1 ,θ 2 ,…,θ n-2 ), then the initial solution of the first reprogramming It can be expressed as:
[0094]
[0095] The initial solution of the kth re-planning is expressed as:
[0096]
[0097] The method for initializing the full-oscillating invasive weed optimization algorithm in step 3 is to set and select appropriate full-oscillating invasive weed optimization algorithm parameters according to the current online path planning requirements...
Embodiment 1
[0162] Set the center coordinates of the horizontal plane of the no-navigation zone ((133230m, 25400m) and the radius of the no-navigation zone (30m), move randomly under the normal distribution Gaussian noise disturbance, and the noise amplitude is 0.1.
[0163] When the enemy threat is single-platform combat, it is assumed that the combat platforms are surface ships and submarines.
[0164] Set the initial parameters of the surface ship: the deployment position is (132950m, 25440m, -10m), the maximum detection distance is 80m, the detection azimuth range is (0,360°), the detection height angle range is (0,180°), the maximum damage The distance is 30m.
[0165] Set the initial parameters of the submarine: the deployment position is (133150m, 25430m, -130m), the maximum detection distance is 80m, the detection azimuth range is (30,180°), the detection height angle range is (0,90°), the maximum The killing distance is 80m.
[0166] Set the number of iterations of the path pla...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


