Research On The Arrangement And The Dispatching Methods Of Military Vehicles Of Large Surface Ships

Large surface ships such as aircraft carriers and amphibious assault ships play an important role in amphibious operations.Amphibious assault ship is a kind of comprehensive ship.In the naval vessels,the tonnage of the amphibious assault ship is only smaller than the aircraft carrier.It can execute amphibious operations independently.In this paper,the arrangement and dispatching of military vehicle in the amphibious assault ship are studied with reference to the American "Wasp-class" amphibious assault ship.The arrangement problem is a kind of two-dimensional nesting problem,which is to park one or more military vehicles such as tanks and armored vehicles as much as possible on the deck with the maximum utilization rate of deck area.In this paper,the problem of arrangement is analyzed to determine the constraints of the problem.The mathematical model of the arrangement problem is established and the optimization objective of the optimization problem is determined.The localization algorithm of the problem is determined so that the problem could be expressed by the order of serial numbers.The improved genetic algorithm is used to solve the problem.Simulate the actual situation for simulation analysis.Analyze user needs and solve them.The dispatching problem begins with path planning for a single vehicle,looking for a feasible optimal loading path on the deck with polygon obstacles.Multiple vehicle dispatching is then performed based on the vehicle embarkation path.In this paper,the dispatching problem is analyzed to determine the constraints of the problem.The model of single vehicle path planning is established and the problem is transformed into configuration space to simplify the problem.Grid method is used to model the environment.The vehicle motion model is established.The position and rotation angle of the vehicle is discretized,so that the moving trajectory of the vehicle is discretized and the problem is transformed into the path finding problem in the connected graph.Finally,the A* algorithm is used to search for a feasible optimal path.After completing the single vehicle path planning,the multi-vehicle dynamic scheduling problem is analyzed and rules were formulated to reduce and resolve the collision between vehicles.At the end of the paper,the feasibility of the method based on improved genetic algorithm is verified by simulation.The different optimization algorithms are compared.The simulation analysis is carried out on the different situations of the number of vehicles can be arranged.Simulate user requirements and design solutions in the layout.Then,the single vehicle path planning method in the dispatching problem in this paper is simulated and verified;the simulation experiment is carried out for the multi-vehicle dispatching method.