Task assignment method for unmanned vehicles based on k-means and discrete particle swarm optimization
A k-means algorithm, discrete particle swarm technology, applied in computing, computer parts, character and pattern recognition, etc., can solve the problems of long operation time, low degree of fit, slow convergence speed, etc., to improve efficiency and reduce The effect of size and convergence speed
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0025] The technical solution of the present invention will be further described below in conjunction with the accompanying drawings.
[0026] The multi-unmanned vehicle task allocation method based on K-means and discrete particle swarm optimization algorithm uses K-means clustering to package the task objectives with an appropriate number of task packages before task allocation, and uses discrete particle swarm optimization for multiple task packages. Algorithm for allocation of multiple unmanned vehicles, figure 1 The overall flow of the method of the present invention is given.
[0027] Step S1, initialize the logistics scene information.
[0028] Including: loading each warehouse information Storehouse(x,y,n,id), where Storehouse.x indicates the geographic dimension of the warehouse, Storehouse.y indicates the geographic longitude of the warehouse, Storehouse.n indicates the number of remaining items in the warehouse, and Storehouse.id indicates the warehouse number of ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


