Port material movement scheduling method based on multi-mode path-finding algorithm
Through the multi-modal pathfinding algorithm, a multi-modal pathfinding model is built, the scheduling tasks are decomposed and global optimization is performed, which solves the high cost, long cycle and lacks global analysis of port material movement scheduling methods in the existing technology. The problem has achieved more efficient and practical port material movement scheduling.
Patent Information
- Application Number
- CN202410914378.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-09
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2044-07-09
AI Technical Summary
The existing port material movement scheduling methods mainly rely on physical experiments, which have problems such as high cost, long cycles and poor repetition. They lack global path analysis and multi-source data for complex port environments, and ignore the impact of multi-modal data. .
Using the port material movement scheduling method based on multimodal pathfinding algorithm, the multimodal pathfinding model is constructed by obtaining satellite remote sensing images and equipment sensor data to prepare a multimodal pathfinding model, and decompose the scheduling task to perform pre-search and global optimization for sub-threads , and correct it in the case of path crossover and collision, taking into account the impact of multi-source data.
It improves the comprehensiveness and efficiency of port material movement scheduling, reduces the computational complexity, adapts to different transportation modes and material characteristics, and enhances the practicality and efficiency of scheduling.
Smart Images

Figure CN118941196A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the field of path planning and scheduling, and in particular to a port material movement scheduling method based on a multi-modal path-finding algorithm. Background Art
[0002] In modern port operations, the fast and accurate movement of materials is crucial to maintaining efficient port operations. With the rapid development of intelligent technology, the level of automation and intelligence in port operations continues to improve, and material movement scheduling has become a key factor in port operating efficiency. The application of multimodal pathfinding algorithms in port material movement scheduling can ensure the efficiency and safety of equipment operation and avoid path conflicts and waste of resources.
[0003] Traditional port material movement scheduling methods mainly rely on physical experiments, but this method has problems such as high cost, long cycle, and poor repeatability. In recent years, with the rapid development of technology, more and more fields have begun to use algorithm models for path planning to reduce costs and improve efficiency.
[0004] At present, although there are some port material movement scheduling methods, these methods often only focus on optimizing a single path, lack the analysis of the global path in the complex port environment, and only focus on the source of a single data, ignoring the impact of multi-source data on path optimization and lack consideration of multimodal data. Summary of the invention
[0005] The purpose of the present invention is to provide a port material movement scheduling method based on a multi-modal path-finding algorithm.
[0006] To achieve the above object, the present invention is implemented according to the following technical solutions:
[0007] The first aspect of the present invention provides a port material movement scheduling method based on a multimodal pathfinding algorithm, comprising the following steps:
[0008] S1 obtains a satellite remote sensing image and equipment sensor data of a port area, and adaptively encodes the satellite remote sensing data and equipment sensor data of the port area to obtain a multimodal factor library;
[0009] S2 constructs a multimodal pathfinding model based on the multimodal factor library;
[0010] S3 decomposes the scheduling job into multiple sub-threads, uses the multi-modal path-finding model to pre-search the sub-threads, obtains an initial set of sub-thread paths, performs global optimization on all the initial sets of sub-thread paths, and uses the obtained global optimal solution as the multi-thread path;
[0011] S4 simulates the multi-thread path, corrects the path based on the path intersection and collision obstacle conditions in the simulation results, and uses the corrected path as the mobile scheduling path.
[0012] Furthermore, the method for adaptively encoding the port area satellite remote sensing data and equipment sensor data includes:
[0013] S11 extracts spatial data modalities from satellite remote sensing images, including spatial distribution, equipment, and material distribution, and extracts structured data modalities from equipment sensor data, including equipment status reports, scheduling tasks, and cargo parameter information;
[0014] S12 designs a recurrent neural network adaptive encoder for spatial data modality and a fully connected layer neural network adaptive encoder for structured data modality;
[0015] S13 extracts encoded feature representations of the spatial data modality and the structured data modality through the corresponding autoencoder model, performs normalized scale matching processing on the extracted encoded feature representations, and obtains a dimensionless multimodal factor library.
[0016] Furthermore, the method for constructing a multimodal pathfinding model based on the multimodal factor library includes:
[0017] S21 designed a pathfinding method and gridded the port area. It was assumed that the target area had an attractive force on the material during material movement, and the obstacle area had a repulsive force on the material. The formula for calculating the attractive force was:
[0018] F at =k a d(xx goat )
[0019] Among them, k a is the positive proportionality coefficient of the gravitational potential field, d(xx goat ) is the distance from the current area point to the target area of the material, and the repulsion of the obstacle area on the material is calculated. The calculation formula is:
[0020]
[0021] in, is the repulsive force range of the obstacle, d min K is the shortest distance between the material and the obstacle, r is the positive proportionality coefficient of the repulsive potential field, is the sensitivity to intensive changes, For the dense change of materials to the shortest obstacle, For the dense change of materials from the current area to the target area, the path search from the starting area to the target area is completed by calculating the resultant force of the material location points;
[0022] S22 builds a multimodal pathfinding model based on a neural network. The construction process is as follows:
[0023] S221 constructs a multi-layer feedforward neural network structure consisting of an input layer, a hidden layer, and an output layer, wherein the input layer obtains a multimodal factor library, the hidden layer obtains the parameters required in the pathfinding algorithm based on the multimodal factor library, and the output layer outputs the path in combination with the pathfinding algorithm. The calculation formula for the weight increment of the output layer and the hidden layer is:
[0024] Δw jk =(d0(n)-y0(n))δ j ηy j f(net k )
[0025] Among them, d0(n) and y0(n) represent the expected output value and actual output value of the neural network respectively, δ j is the error gradient of the jth neuron in the output layer, η is the learning rate, y j is the output of the jth neuron in the output layer, f(net k ) is the derivative of the output layer transfer function, and the weight increments of the input layer and the hidden layer are calculated:
[0026]
[0027] Where L is the number of neurons in the output layer, δ k is the error gradient of the kth neuron in the input layer, η is the learning rate, and w jk is the weight increment of the output layer and the hidden layer, x i is the input of the i-th neuron in the input layer, f(net j ) is the derivative of the input layer transfer function;
[0028] S222 updates the neural network weights through the gradient descent method and optimizes the neural network through the root mean square back propagation algorithm.
[0029] Furthermore, the method of pre-searching the multiple sub-threads through the multimodal pathfinding model includes:
[0030] S31 designs a distance heuristic function through the Harmanton distance function to obtain the estimated cost of the material from the current node to the target node;
[0031] S32 sorts the nodes according to the estimated cost values, builds a priority queue, selects the node with the smallest estimated cost value from the priority queue for expansion, explores the selected node, generates its successor node, and applies a diversification strategy to the successor nodes of the selected node; randomly selects some successor nodes to add to the open list instead of adding only the best successor node; adjusts the heuristic function and increases randomness to explore different search paths;
[0032] S33 adds the newly generated nodes to the open list and updates their estimated cost values, and collects all explored paths or path candidates from the open list to form an initial path set.
[0033] Furthermore, the method for globally optimizing the initial set of paths of all sub-threads includes:
[0034] S41 calculates the utility rate of each path in the sub-thread path set, and the calculation formula is:
[0035]
[0036] Among them, T j is the scheduling efficiency of the jth path on the child thread, B U is the maximum amount of material that the port can handle within 1 hour, p i is the urgency coefficient of the i-th material, h i is the processing efficiency of the i-th material, i.e., the scheduling completion time, U n is the set of materials to be scheduled for the route, f i For the dispatching device, l(i) f i is the set of devices associated with the scheduling path l(i), u(f i , j) is the device f on the scheduling path j i Performance index, U(f i , S) is the device f i The average performance index on all path sets S of the sub-thread, N0 is the average time for the material on the sub-thread to complete one scheduling;
[0037] Select a path from each sub-thread path set to obtain multiple path combinations, and calculate the global optimal utility rate of the path combination. The calculation formula is:
[0038]
[0039] Among them, T all is the global utility rate of path combination, m is the number of sub-threads, n is the number of paths in the i-th sub-thread, is the utility rate of the jth path in the i-th subthread, B is the total weight of materials scheduled globally within 1 hour, v is the total area of materials scheduled globally within 1 hour, |P| is the length of the jth path in the i-th subthread, r i The number of device resources consumed by the jth path in the i-th child thread;
[0040] S43 takes the path combination with the maximum value of the global optimal utility rate as the global optimal path.
[0041] Furthermore, the method for path correction based on path intersection and collision with obstacles in the simulation results includes: for the situation where two sub-threads are scheduled on the intersection path, the priorities of the two sub-threads are obtained, and the materials in the low-priority sub-thread regard the materials in the high-priority sub-thread as obstacles to perform local path optimization; for the situation where materials collide with obstacle areas during the scheduling process, a new learning rate is calculated, the model is adjusted, and the path optimization is completed.
[0042] Furthermore, the method for performing local path optimization includes:
[0043] S51 obtains pheromone and heuristic information on low-priority subthreads through ant colony algorithm, and uses adaptive pseudo-random proportional selection rule to determine its local path optimization direction;
[0044] S52 takes the obstacle as the repulsive force source and introduces the distance factor to obtain an improved repulsive force potential field function. The expression of the repulsive force potential field function is:
[0045]
[0046] Among them, K rep is the positive proportionality coefficient of the repulsive potential field, ρ(p, p obs ) is the distance between the two materials, ρ0 is the influence range of the repulsive force source, ρ m (p,p g ) is the position p to the attraction center p g The mth power of the density function of is used to obtain the repulsive force in the local path optimization direction according to the repulsive potential field function. The resultant force is calculated by combining it with the gravitational force calculated before the path to complete the local path optimization.
[0047] Furthermore, the method for calculating a new learning rate includes:
[0048] S61 calculates the collision risk:
[0049]
[0050] Among them, d min is the minimum distance between the obstacle and the material, is the material speed at d min The projection in the direction, k t is the adjustment parameter, T is the scheduling time of the child thread, d s The safe distance for materials;
[0051] S62 obtains a new learning rate based on the collision risk, and the calculation formula is:
[0052]
[0053] Among them, α RN is the penalty coefficient, α VTA is the sensitivity that is adaptively adjusted according to the collision risk, k1 and k2 are α RN and α VTA The scaling factor is R, the collision risk, μ(ξ j ) is the forgetting factor emitted by neurons, ξ j is the number of neuron firings.
[0054] In a second aspect, an embodiment of the present application further provides an electronic device, comprising: a processor; and a memory arranged to store computer executable instructions, wherein when the executable instructions are executed, the processor executes the method steps described in the first aspect.
[0055] In a third aspect, an embodiment of the present application further provides a computer-readable storage medium, which stores one or more programs. When the one or more programs are executed by an electronic device including multiple applications, the electronic device executes the method steps described in the first aspect.
[0056] Compared with the prior art, the embodiments of the present invention have at least the following advantages or beneficial effects:
[0057] (1) The present invention provides a port material movement scheduling method based on a multimodal routing algorithm. By integrating data from different sources and adaptively encoding the features of data from different sources, a multimodal factor library is obtained. A multimodal routing algorithm model is constructed based on the multimodal factor library. By integrating data from multiple sources and performing encoding fusion, the impact of multi-source data on path optimization is taken into account, thereby improving the comprehensiveness of port material movement scheduling.
[0058] (2) The present invention decomposes the scheduling task into multiple sub-thread tasks, uses a multimodal path-finding model to pre-search the sub-threads, obtains an initial set of sub-thread paths, performs global optimization on all the initial sets of sub-thread paths, and uses the obtained global optimal solution as the multi-thread path. Compared with most methods that only optimize a single path, the present invention is more practical. By decomposing the task into sub-threads, the computational complexity of a single problem can be reduced, and the method can adapt to different transportation modes and material characteristics, thereby improving the efficiency and practicality of the port material movement scheduling method. BRIEF DESCRIPTION OF THE DRAWINGS
[0059] Figure 1 The present invention is a flowchart of the steps of the port material movement scheduling method based on the multi-modal path finding algorithm.
[0060] Figure 2 It is a schematic diagram of the structure of an electronic device in an embodiment of this specification. DETAILED DESCRIPTION
[0061] The technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.
[0062] Reference Figure 1 As shown, the present invention provides a port material movement scheduling method based on a multi-modal path finding algorithm, comprising:
[0063] S1 obtains a satellite remote sensing image and equipment sensor data of a port area, and adaptively encodes the satellite remote sensing data and equipment sensor data of the port area to obtain a multimodal factor library;
[0064] In the actual evaluation, satellite remote sensing images and equipment sensor data of the port area are obtained. Image data is extracted from the satellite remote sensing data as spatial modal data, and equipment, material parameters, and scheduling tasks are extracted from the equipment sensor data as semantic modal data. Feature extraction is performed on the three modal data to obtain relevant features, including:
[0065] Spatial data: Based on remote sensing images, complete the identification of material areas, equipment areas, obstacle areas, and berth areas, including: material areas 1, 2, 3, 4, equipment areas 1, 2, 3, obstacle areas, berth areas 1, 2, 3;
[0066] Equipment parameter data: quay crane 1, start-up status, quay crane 2, start-up status; conveyor belt 1, in area 1, conveyor belt 2 in area 1; forklift 1, forklift 2, forklift 3;
[0067] Material parameter data: 4 dry cargo containers, sizes are: 30 feet, 25 feet, 20 feet, 40 feet, weights are: 20 tons, 17 tons, 17 tons, 40 tons; 2 refrigerated containers, sizes are: 20 feet, 40 feet, 15 feet, 30 feet, weights are: 20 tons, 45 tons, 17 tons, 22 tons; urgency of each material;
[0068] Dispatching task: transport dry cargo containers to berth area 1 and refrigerated cargo containers to berth areas 2 and 3.
[0069] S2 constructs a multimodal pathfinding model based on the multimodal factor library;
[0070] In the actual evaluation, by setting the pathfinding method and designing the neural network structure, a multimodal pathfinding model is constructed based on the spatial data, equipment parameter data, and material parameter data in the multimodal factor library.
[0071] S3 decomposes the scheduling job into multiple sub-threads, uses the multi-modal path-finding model to pre-search the sub-threads, obtains an initial set of sub-thread paths, performs global optimization on all the initial sets of sub-thread paths, and uses the obtained global optimal solution as the multi-thread path;
[0072] In the actual evaluation, the scheduling tasks are divided into three sub-threads based on the different destinations. The scheduling tasks to berth area 1 are sub-thread 1, the scheduling tasks to berth area 2 are sub-thread 2, and the scheduling tasks to berth area 3 are sub-thread 3.
[0073] In the actual evaluation, the multimodal path-finding model is used to pre-search sub-thread 1, sub-thread 2, and sub-thread 3 respectively, and the initial set of paths for sub-thread 1 is 6, the initial set of paths for sub-thread 2 is 12, and the initial set of paths for sub-thread 3 is 7. Based on the utility rate of global scheduling, a global optimization is performed on the initial set of all sub-thread paths, and the global optimal solution is used as the multi-thread path. The multi-thread paths obtained are: path one in sub-thread 1, path two in sub-thread 2, and path three in sub-thread 3.
[0074] S4 simulates the multi-thread path, corrects the path based on the path intersection and collision obstacle conditions in the simulation results, and uses the corrected path as the mobile scheduling path;
[0075] In the actual evaluation, the obtained multi-threaded path was modeled, and it was found that path one and path two intersected, and path three collided with the obstacle area. Based on the situation that path one and path two intersected, it was found that the material urgency on path one was greater than that on path two. The material on path one was taken as an obstacle, and the local path of path two was re-optimized. Based on the situation that path three collided with the obstacle area, a new learning rate was obtained by calculating the collision risk. Based on the new learning rate, the multi-modal multi-threaded pathfinding algorithm model was adjusted to obtain the re-planning of path three in sub-thread 3. The corrected paths two and three were combined with path one as the material movement scheduling path.
[0076] In this embodiment, the method for adaptively encoding the port area satellite remote sensing data and equipment sensor data includes:
[0077] S11 extracts spatial data modalities from satellite remote sensing images, including spatial distribution, equipment, and material distribution, and extracts structured data modalities from equipment sensor data, including equipment status reports, scheduling tasks, and cargo parameter information;
[0078] S12 designs a recurrent neural network adaptive encoder for spatial data modality and a fully connected layer neural network adaptive encoder for structured data modality;
[0079] S13 extracts encoded feature representations of the spatial data modality and the structured data modality through the corresponding autoencoder model, performs normalized scale matching processing on the extracted encoded feature representations, and obtains a dimensionless multimodal factor library.
[0080] In this embodiment, the method for constructing a multimodal pathfinding model based on the multimodal factor library includes:
[0081] S21 designed a pathfinding method and gridded the port area. It was assumed that the target area had an attractive force on the material during material movement, and the obstacle area had a repulsive force on the material. The formula for calculating the attractive force was:
[0082] F at =k a d(xx goat )
[0083] Among them, k a is the positive proportionality coefficient of the gravitational potential field, d(xx goat ) is the distance from the current area point to the target area of the material, and the repulsion of the obstacle area on the material is calculated. The calculation formula is:
[0084]
[0085] in, is the repulsive force range of the obstacle, d min K is the shortest distance between the material and the obstacle, r is the positive proportionality coefficient of the repulsive potential field, is the sensitivity to intensive changes, For the dense change of materials to the shortest obstacle, For the dense change of materials from the current area to the target area, the path search from the starting area to the target area is completed by calculating the resultant force of the material location points;
[0086] S22 builds a multimodal pathfinding model based on a neural network. The construction process is as follows:
[0087] S221 constructs a multi-layer feedforward neural network structure consisting of an input layer, a hidden layer, and an output layer, wherein the input layer obtains a multimodal factor library, the hidden layer obtains the parameters required in the pathfinding algorithm based on the multimodal factor library, and the output layer outputs the path in combination with the pathfinding algorithm. The calculation formula for the weight increment of the output layer and the hidden layer is:
[0088] Δw jk =(d0(n)-y0(n))δ j ηy j f(net k )
[0089] Among them, d0(n) and y0(n) represent the expected output value and actual output value of the neural network respectively, δ j is the error gradient of the jth neuron in the output layer, η is the learning rate, y j is the output of the jth neuron in the output layer, f(net k ) is the derivative of the output layer transfer function, and the weight increments of the input layer and the hidden layer are calculated:
[0090]
[0091] Where L is the number of neurons in the output layer, δ k is the error gradient of the kth neuron in the input layer, η is the learning rate, and w jk is the weight increment of the output layer and the hidden layer, x i is the input of the i-th neuron in the input layer, f(net j ) is the derivative of the input layer transfer function;
[0092] S222 updates the neural network weights through the gradient descent method and optimizes the neural network through the root mean square back propagation algorithm.
[0093] In this embodiment, the method of pre-searching the multiple sub-threads through the multimodal pathfinding model includes:
[0094] S31 designs a distance heuristic function through the Harmanton distance function to obtain the estimated cost of the material from the current node to the target node;
[0095] S32 sorts the nodes according to the estimated cost values, builds a priority queue, selects the node with the smallest estimated cost value from the priority queue for expansion, explores the selected node, generates its successor node, and applies a diversification strategy to the successor nodes of the selected node; randomly selects some successor nodes to add to the open list instead of adding only the best successor node; adjusts the heuristic function and increases randomness to explore different search paths;
[0096] S33 adds the newly generated nodes to the open list and updates their estimated cost values, and collects all explored paths or path candidates from the open list to form an initial path set.
[0097] In this embodiment, the method for globally optimizing the initial set of paths of all sub-threads includes:
[0098] S41 calculates the utility rate of each path in the sub-thread path set, and the calculation formula is:
[0099]
[0100] Among them, T j is the scheduling efficiency of the jth path on the child thread, B U is the maximum amount of material that the port can handle within 1 hour, p i is the urgency coefficient of the i-th material, h i is the processing efficiency of the i-th material, i.e., the scheduling completion time, U n is the set of materials to be scheduled for the route, f i For the dispatching device, l(i) f i is the set of devices associated with the scheduling path l(i), u(f i , j) is the device f on the scheduling path j i Performance index, U(f i , S) is the device f i The average performance index on all path sets S of the sub-thread, N0 is the average time for the material on the sub-thread to complete one scheduling;
[0101] Select a path from each sub-thread path set to obtain multiple path combinations, and calculate the global optimal utility rate of the path combination. The calculation formula is:
[0102]
[0103] Among them, T allis the global utility rate of path combination, m is the number of sub-threads, n is the number of paths in the i-th sub-thread, is the utility rate of the jth path in the i-th subthread, B is the total weight of materials scheduled globally within 1 hour, v is the total area of materials scheduled globally within 1 hour, |P| is the length of the jth path in the i-th subthread, r i The number of device resources consumed by the jth path in the i-th child thread;
[0104] S43 takes the path combination with the maximum value of the global optimal utility rate as the global optimal path.
[0105] In this embodiment, the method for path correction based on path intersection and collision with obstacles in simulation results includes: for the situation where two sub-threads are scheduled on the intersection path, the priorities of the two sub-threads are obtained, and the materials in the low-priority sub-thread regard the materials in the high-priority sub-thread as obstacles to perform local path optimization; for the situation where materials collide with obstacle areas during the scheduling process, a new learning rate is calculated, the model is adjusted, and the path optimization is completed.
[0106] In this embodiment, the method for performing local path optimization includes:
[0107] S51 obtains pheromone and heuristic information on low-priority subthreads through ant colony algorithm, and uses adaptive pseudo-random proportional selection rule to determine its local path optimization direction;
[0108] S52 takes the obstacle as the repulsive force source and introduces the distance factor to obtain an improved repulsive force potential field function. The expression of the repulsive force potential field function is:
[0109]
[0110] Among them, K rep is the positive proportionality coefficient of the repulsive potential field, ρ(p, p obs ) is the distance between the two materials, ρ0 is the influence range of the repulsive force source, ρ m (p,p g ) is the position p to the attraction center p g The mth power of the density function of is used to obtain the repulsive force in the local path optimization direction according to the repulsive potential field function. The resultant force is calculated by combining it with the gravitational force calculated before the path to complete the local path optimization.
[0111] In this embodiment, the method for calculating a new learning rate includes:
[0112] S61 calculates the collision risk:
[0113]
[0114] Among them, d min is the minimum distance between the obstacle and the material, is the material speed at d min The projection in the direction, k t is the adjustment parameter, T is the scheduling time of the child thread, d s The safe distance for materials;
[0115] S62 obtains a new learning rate based on the collision risk, and the calculation formula is:
[0116]
[0117] Among them, α RN is the penalty coefficient, α VTA is the sensitivity that is adaptively adjusted according to the collision risk, k1 and k2 are α RN and α VTA The scaling factor is R, the collision risk, μ(ξ j ) is the forgetting factor emitted by neurons, ξ j is the number of neuron firings.
[0118] Figure 2 This is a schematic diagram of the structure of an electronic device according to an embodiment of the present application. Figure 2 At the hardware level, the electronic device includes a processor, and optionally also includes an internal bus, a network interface, and a memory. The memory may include a memory, such as a high-speed random access memory (RAM), and may also include a non-volatile memory (non-volatile memory), such as at least one disk storage. Of course, the electronic device may also include hardware required for other services.
[0119] The processor, network interface and memory can be interconnected through an internal bus, which can be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 2 Only one bidirectional arrow is used in the diagram, but this does not mean that there is only one bus or only one type of bus.
[0120] The memory is used to store the program. Specifically, the program may include a program code, and the program code includes a computer operation instruction. The memory may include a memory and a non-volatile memory, and provides instructions and data to the processor.
[0121] The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs it, forming an information push system for intelligent manufacturing services at the logical level. The processor executes the program stored in the memory and is specifically used to execute any of the aforementioned information push methods for intelligent manufacturing services.
[0122] The above application Figure 1 The port material movement scheduling method based on the multimodal pathfinding algorithm disclosed in the illustrated embodiment can be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiments of the present application can be directly embodied as a hardware decoding processor for execution, or a combination of hardware and software modules in the decoding processor for execution. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.
[0123] The electronic device may also perform Figure 1 A port material movement scheduling method based on multimodal pathfinding algorithm is implemented Figure 1 The functions of the illustrated embodiment will not be described in detail in the embodiments of the present application.
[0124] An embodiment of the present application also proposes a computer-readable storage medium, which stores one or more programs, and the one or more programs include instructions. When the instructions are executed by an electronic device including multiple applications, they execute any of the aforementioned port material movement scheduling methods based on the multimodal routing algorithm.
[0125] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.
[0126] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A system that specifies the functions of a box or multiple boxes.
[0127] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a product including an instruction system, which is implemented in the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0128] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0129] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.
[0130] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.
[0131] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.
[0132] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.
[0133] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.
[0134] The above contents are merely examples and explanations of the structure of the present invention. The technicians in this technical field may make various modifications or additions to the specific embodiments described or replace them in a similar manner. As long as they do not deviate from the structure of the invention or exceed the scope defined by the claims, they should all fall within the protection scope of the present invention.
Claims
1. A port material movement scheduling method based on a multimodal pathfinding algorithm is characterized in that: The following steps are involved: S1 obtains a satellite remote sensing image and equipment sensor data of a port area, and adaptively encodes the satellite remote sensing data and equipment sensor data of the port area to obtain a multimodal factor library; S2 constructs a multimodal pathfinding model based on the multimodal factor library; S3 divides the scheduling job into multiple sub-threads, performs a pre-search on the multiple sub-threads through the multi-modal path-finding model, obtains an initial set of paths of all sub-threads, performs a global optimization on the initial set of paths of all sub-threads, and uses the obtained global optimal solution as the multi-thread path; S4 simulates the multi-thread path, corrects the path based on the path intersection and collision obstacle conditions in the simulation results, and uses the corrected path as the mobile scheduling path.
2. The port material movement scheduling method based on multimodal pathfinding algorithm according to claim 1 is characterized in that: The method for adaptively encoding the port area satellite remote sensing data and equipment sensor data comprises: S11 extracts spatial data modalities from satellite remote sensing images, including spatial distribution, equipment, and material distribution, and extracts structured data modalities from equipment sensor data, including equipment status reports, scheduling tasks, and cargo parameter information; S12 designs a recurrent neural network adaptive encoder for spatial data modality and a fully connected layer neural network adaptive encoder for structured data modality; S13 extracts encoded feature representations of the spatial data modality and the structured data modality through the corresponding autoencoder model, performs normalized scale matching processing on the extracted encoded feature representations, and obtains a dimensionless multimodal factor library.
3. The port material movement scheduling method based on multimodal pathfinding algorithm according to claim 1 is characterized in that: The method for constructing a multimodal pathfinding model based on the multimodal factor library comprises: S21 designed a pathfinding method and gridded the port area. It was assumed that the target area had an attractive force on the material during material movement, and the obstacle area had a repulsive force on the material. The formula for calculating the attractive force was: F at =k a d(x-x goat ) Among them, k a is the positive proportionality coefficient of the gravitational potential field, d(xx goat ) is the distance from the current area point to the target area of the material, and the repulsion of the obstacle area on the material is calculated. The calculation formula is: in, is the repulsive force range of the obstacle, d min K is the shortest distance between the material and the obstacle. r is the positive proportionality coefficient of the repulsive potential field, is the sensitivity to intensive changes, For the dense change of materials to the shortest obstacle, For the dense change of materials from the current area to the target area, the path search from the starting area to the target area is completed by calculating the resultant force of the material location points; S22 builds a multimodal pathfinding model based on a neural network. The construction process is as follows: S221 constructs a multi-layer feedforward neural network structure consisting of an input layer, a hidden layer, and an output layer, wherein the input layer obtains a multimodal factor library, the hidden layer obtains the parameters required in the pathfinding algorithm based on the multimodal factor library, and the output layer outputs the path in combination with the pathfinding algorithm. The calculation formula for the weight increment of the output layer and the hidden layer is: Δw jk =(d0(n)-y0(n))δ j yy j f(net k ) Among them, d0(n) and y0(n) represent the expected output value and actual output value of the neural network respectively, δ j is the error gradient of the jth neuron in the output layer, η is the learning rate, y j is the output of the jth neuron in the output layer, f(net k ) is the derivative of the output layer transfer function, and the weight increments of the input layer and the hidden layer are calculated: Where L is the number of neurons in the output layer, δ k is the error gradient of the kth neuron in the input layer, η is the learning rate, and w jk is the weight increment of the output layer and the hidden layer, x i is the input of the i-th neuron in the input layer, f(net j ) is the derivative of the input layer transfer function; S222 updates the neural network weights through the gradient descent method and optimizes the neural network through the root mean square back propagation algorithm.
4. The port material movement scheduling method based on multimodal pathfinding algorithm according to claim 1 is characterized in that: The method of pre-searching the multiple sub-threads through the multimodal pathfinding model includes: S31 designs a distance heuristic function through the Harmanton distance function to obtain the estimated cost of the material from the current node to the target node; S32 sorts the nodes according to the estimated cost values, builds a priority queue, selects the node with the smallest estimated cost value from the priority queue for expansion, explores the selected node, generates its successor node, and applies a diversification strategy to the successor nodes of the selected node; randomly selects some successor nodes to add to the open list instead of adding only the best successor node; adjusts the heuristic function and increases randomness to explore different search paths; S33 adds the newly generated nodes to the open list and updates their estimated cost values, and collects all explored paths or path candidates from the open list to form an initial path set.
5. The port material movement scheduling method based on multimodal pathfinding algorithm according to claim 1 is characterized in that: The method for globally optimizing the initial set of paths of all sub-threads comprises: S41 calculates the utility rate of each path in the sub-thread path set, and the calculation formula is: Among them, T j is the scheduling efficiency of the jth path on the child thread, B U is the maximum amount of material that the port can handle within 1 hour, p i is the urgency coefficient of the i-th material, h i is the processing efficiency of the i-th material, i.e., the scheduling completion time, U n is the set of materials to be scheduled for the route, f i For dispatching equipment, l(i) f i is the set of devices associated with the scheduling path l(i), u(f i ,j) is the device f on the scheduling path j i Performance index, U(f i ,S) is the device f i The average performance index on all path sets S of the sub-thread, N0 is the average time for the material on the sub-thread to complete one scheduling; S42 selects a path from each sub-thread path set to obtain multiple path combinations, and calculates the global optimal utility rate of the path combination. The calculation formula is: Among them, T all is the global utility rate of path combination, m is the number of sub-threads, n is the number of paths in the i-th sub-thread, is the utility rate of the jth path in the ith subthread, B is the total weight of materials scheduled globally within 1 hour, v is the total area of materials scheduled globally within 1 hour, |P| is the length of the jth path in the ith subthread, r i The number of device resources consumed by the jth path in the i-th child thread; S43 takes the path combination with the maximum value of the global optimal utility rate as the global optimal path.
6. The port material movement scheduling method based on multimodal pathfinding algorithm according to claim 1 is characterized in that: The method for correcting a path based on path intersections and collisions with obstacles in simulation results includes: for a situation where two sub-threads are scheduled on an intersection path, the priorities of the two sub-threads are obtained, and the materials in the low-priority sub-thread regard the materials in the high-priority sub-thread as obstacles to perform local path optimization; for a situation where materials collide with an obstacle area during scheduling, a new learning rate is calculated, the model is adjusted, and the path optimization is completed.
7. The port material movement scheduling method based on multi-modal path finding algorithm according to claim 6 is characterized in that: The method for performing local path optimization comprises: S51 obtains pheromone and heuristic information on low-priority subthreads through ant colony algorithm, and uses adaptive pseudo-random proportional selection rule to determine its local path optimization direction; S52 takes the obstacle as the repulsive force source and introduces the distance factor to obtain an improved repulsive force potential field function. The expression of the repulsive force potential field function is: Among them, K rep is the positive proportionality coefficient of the repulsive potential field, ρ(p,p obs ) is the distance between the two materials, ρ0 is the influence range of the repulsive force source, ρ m (p,p g ) is the position p to the attraction center p g The mth power of the density function of is used to obtain the repulsive force in the local path optimization direction according to the repulsive potential field function. The resultant force is calculated by combining it with the gravitational force calculated before the path to complete the local path optimization.
8. The port material movement scheduling method based on multi-modal path finding algorithm according to claim 6 is characterized in that: The method for calculating a new learning rate comprises: S61 calculates the collision risk: Among them, d min is the minimum distance between the obstacle and the material, is the material speed at d min The projection in the direction, k t is the adjustment parameter, T is the scheduling time of the child thread, d s The safe distance for materials; S62 obtains a new learning rate based on the collision risk, and the calculation formula is: Among them, α RN is the penalty coefficient, α VTA is the sensitivity that is adaptively adjusted according to the collision risk, k1 and k2 are α RN and α VTA The scaling factor is R, the collision risk, μ(ξ j ) is the forgetting factor emitted by neurons, ξ j is the number of neuron firings.
9. An electronic device, comprising: processor; as well as A memory arranged to store computer executable instructions, which when executed cause the processor to perform the method according to any one of claims 1 to 8.
10. A computer-readable storage medium storing one or more programs, which, when executed by an electronic device including a plurality of application programs, enables the electronic device to execute the method according to any one of claims 1 to 8.
Citation Information
Patent Citations
Global dynamic smooth path planning method based on optimized A-STAR algorithm
CN114166235A
Temporary road path planning method and system based on graph neural network
CN116182875A
Port operation optimal path planning simulation method and system based on genetic algorithm
CN116258063A
Mobile robot fusion path planning control method and controller
CN118092435A
Path planning method and apparatus, and device and storage medium
WO2023029188A1
