Warehousing and carrying industrial robot path planning method based on improved ant colony algorithm
The improved ant colony algorithm with RRT integration addresses inefficiencies in traditional path planning by optimizing path smoothness and convergence for warehouse robots, achieving efficient and stable solutions in dynamic environments.
Patent Information
- Application Number
- CN202411401022.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-10-09
- Publication Date
- 2024-12-06
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
Traditional path planning algorithms for warehouse handling robots struggle with inefficiency, lack of multi-objective decision-making, slow convergence, and inability to find a stable optimal solution, especially in complex and dynamically changing environments.
A path planning method for warehouse handling robots using an improved ant colony algorithm, combining it with the RRT algorithm, where ants update paths based on pheromones and obstacles, and the RRT algorithm explores new paths, iteratively refining the global optimal path through parallel execution and pheromone distribution.
The hybrid method efficiently plans paths that consider both path length and smoothness, ensuring rapid convergence to a stable optimal solution, even in complex environments, by integrating ant colony and RRT algorithms.
Smart Images

Figure CN119088040A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of industrial robot path planning, and in particular relates to a warehouse handling industrial robot path planning method based on an improved ant colony algorithm. Background Art
[0002] Industrial robots are a type of mobile robots, which have great potential and research value in the fields of manufacturing, medical services, smart logistics, etc. In warehouse management, warehouse handling robots can be used to carry target goods, reduce labor costs, and improve the efficiency of goods handling. During the handling process, it is necessary to plan the robot's handling route.
[0003] Path planning refers to the strategy of a path composed of a sequence of points or curves connecting the starting point and the end point. Its purpose is to enable the target subject, such as a warehouse handling robot, to avoid obstacles in the route according to the principle of optimal planning of the handling route and select an optimal route from the starting point to the end point. Although traditional path planning algorithms, such as the Dijkstra algorithm and the A* algorithm, can perform well in certain specific scenarios, in complex warehousing environments, especially when faced with dynamically changing environments and multiple constraints, these algorithms often find it difficult to find the optimal path while processing multiple targets. In addition, these algorithms usually only focus on the shortest path, but ignore the smoothness of the shortest path, and the algorithm converges slowly and cannot stably obtain the optimal solution. Summary of the invention
[0004] In view of the shortcomings of the above-mentioned existing methods, the present invention provides a path planning method for a warehouse handling industrial robot based on an improved ant colony algorithm, aiming to solve the core problems of the prior art that warehouse handling robots are inefficient, lack the ability to allocate multi-objective decision-making tasks, and have slow algorithm convergence and cannot obtain a stable optimal solution.
[0005] To achieve the above-mentioned purpose, the present invention is implemented by the following technical solutions: A path planning method for a storage and handling industrial robot based on an improved ant colony algorithm, the method comprising the following steps: S10: Modeling the warehouse map environment using the grid method, including setting the initial node, target node, shelf and obstacle grid, and initializing the ant colony algorithm parameters; S20: After the map environment modeling is completed, the parameters of the ant colony algorithm and the RRT algorithm are initialized, the ant colony algorithm and the RRT algorithm are executed in parallel, all ants are released, and the global optimal path for the storage and handling industrial robot to transport the target goods is found according to the modeled map environment; S30: During the movement, the ants update the feasible paths according to the shelves and obstacles on the path, and release pheromones on the paths they pass. Meanwhile, the RRT algorithm continues to explore new paths and regularly converts the valid paths in the RRT tree into pheromone distributions in the ant colony algorithm. S40: After all ants have completed a traversal or reached the preset conditions, the global optimal path is updated based on the path information provided by the RRT tree and the pheromone distribution of the ant colony algorithm, and the pheromone is allowed to evaporate according to the set rules; S50: Repeat steps S20 to S40 until a preset number of iterations is reached or convergence conditions are met, thereby obtaining a global optimal path for the warehousing and handling industrial robot to transport the target goods.
[0006] Preferably, in step S10, the warehouse map environment is modeled using a grid method, which divides the workspace of the storage and handling robot into grid units, and runs in eight directions represented by an octree, and no longer moves in any direction.
[0007] Preferably, the parameters of the ant colony algorithm and the RRT algorithm in step S10 include the ant colony scale, the initial value of pheromone, the pheromone volatility coefficient, the pheromone importance factor, the heuristic factor, the random exploration probability, the warehouse map information, the step size of the RRT algorithm, and the initial node of the RRT tree is set as the starting point.
[0008] Preferably, the warehouse map information includes shelf locations, obstacle locations, and entrance and exit locations.
[0009] Preferably, the initialization phase in step S10 further includes adjusting the expansion priority of the RRT algorithm and weighted processing of shelf positions in the ant colony algorithm according to the urgency or transportation priority of the stored goods.
[0010] Preferably, in step S20, the ant colony algorithm and the RRT algorithm are executed in parallel to release all ants, including: RRT algorithm: Starting from the initial node, a new node is generated according to the randomly generated expansion direction and step size, and the new node is checked to see if it is valid (i.e., it does not conflict with obstacles). If so, it is added to the RRT tree and tried to connect to the target point. Ant colony algorithm: Release all ants, and the ants choose paths in the area explored by the RRT tree based on pheromones and heuristic information, while considering the potential optimal direction provided by the RRT tree.
[0011] Preferably, in step S30, when the RRT algorithm continuously explores new paths, in addition to considering randomness and step size, it also refers to the pheromone concentration area in the ant colony algorithm; at the same time, the ant colony algorithm combines the path information provided by the RRT tree when selecting the moving direction.
[0012] Preferably, the updating of the global optimal path in step S40 not only considers the path length, but also comprehensively evaluates the smoothness of the RRT tree path and the concentration of the ant colony algorithm pheromone to obtain a more practical and efficient transportation path.
[0013] Preferably, after obtaining the global optimal path for the warehouse handling industrial robot path planning by the ant colony algorithm in step S50, the global optimal path is further smoothed, and dynamic programming is used to remove redundant turning points, optimize the path shape, and reduce energy consumption and time costs during the handling process.
[0014] Preferably, in order to achieve the above purpose, the present invention also proposes a path planning device for a warehouse handling industrial robot based on an improved ant colony algorithm, and the path planning device for a warehouse handling industrial robot based on an improved ant colony algorithm comprises: Map modeling and parameter initialization module: used to model the warehouse map environment using the grid method, including setting the initial node, target node, shelf and obstacle grid, and initializing the ant colony algorithm parameters; Execution module: used to add RRT algorithm to the ant colony algorithm, initialize RRT algorithm parameters, execute the ant colony algorithm and RRT algorithm in parallel, and release all ants; parameter update module: used for ants to update feasible paths according to the shelves and obstacles on the path during movement, and release pheromones on the passed path. At the same time, the RRT algorithm continues to explore new paths and regularly converts valid paths in the RRT tree into pheromone distribution in the ant colony algorithm; iterative operation module: repeatedly run the execution module and the parameter update module until the preset number of iterations is reached or the convergence conditions are met, and the ant colony algorithm is used to obtain the global optimal path for the warehouse handling industrial robot to transport the target goods.
[0015] Preferably, in order to achieve the above-mentioned purpose, the present invention also proposes a warehouse handling industrial robot path planning device based on an improved ant colony algorithm, the device comprising: a memory, a processor, and programs such as an improved ant colony algorithm and an RRT algorithm stored in the memory and executable on the processor, the programs such as the improved ant colony algorithm and the RRT algorithm being steps for implementing the warehouse handling industrial robot path planning method based on the improved ant colony algorithm as described above.
[0016] Preferably, in order to achieve the above-mentioned purpose, the present invention also provides a computer program product, which includes programs such as an improved ant colony algorithm and an RRT algorithm. When the programs such as the improved ant colony algorithm and the RRT algorithm are executed by a processor, the path planning method for a warehousing and handling industrial robot based on the improved ant colony algorithm as described above is implemented.
[0017] The advantages and effects of the present invention are: The present invention provides a path planning method for a warehouse handling industrial robot based on an improved ant colony algorithm. An RRT algorithm is added to the ant colony algorithm to avoid obstacles that may be encountered in the path, and the handling priority is arranged according to the urgency of the handling targets of the warehouse handling robot, so that the robot can plan the handling path according to the priority of the target goods when carrying multi-target goods, thereby solving the shortcomings of the warehouse handling robot in the prior art that is low in efficiency and does not have multi-target decision-making task allocation. BRIEF DESCRIPTION OF THE DRAWINGS
[0018] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0019] Figure 1 It is a flow chart of the path planning method of the warehousing and handling industrial robot based on the improved ant colony algorithm of the present invention.
[0020] Figure 2 The figure is a schematic structural diagram of a path planning device for a warehousing and handling industrial robot based on an improved ant colony algorithm according to the present invention.
[0021] Figure 3 This is a schematic block diagram of the structure of an electronic device for path planning of a warehouse handling industrial robot based on an improved ant colony algorithm according to the present invention. DETAILED DESCRIPTION
[0022] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0023] The present invention provides a path planning method for a storage and handling industrial robot based on an improved ant colony algorithm. The method is as follows: Figure 1 As shown, the following steps are included: Step S10: Modeling the warehouse map environment using the grid method, including setting the initial node, target node, shelf and obstacle grid, and initializing the ant colony algorithm parameters.
[0024] Using the grid method to model the warehouse map environment means that the grid method divides the workspace of the warehouse handling robot into grid units, and runs in the eight directions represented by the octree, and no longer moves in any direction. The warehouse map has two grid states, occupied or idle. Occupied indicates obstacle information, and idle indicates the operating area of the warehouse handling robot. Set the coordinates of the warehouse handling robot to (x a ,y a ), then the map sequence encoding of the storage and handling robot is calculated as shown in formula (1): (1) Among them, Num represents the label of the sequence, N a Indicates the number of rows in the raster map, N y Represents the number of raster map columns.
[0025] The parameters of the ant colony algorithm and the RRT algorithm include: ant colony size, pheromone initial value, pheromone volatility coefficient, pheromone importance factor, heuristic factor, random exploration probability, warehouse map information, RRT algorithm step size, and the initial node of the RRT tree is set as the starting point.
[0026] The size of the ant colony is the number of ants participating in the search simultaneously in the algorithm, which will affect the parallelism and diversity of the search. A larger ant colony size can increase the comprehensiveness of the search, but it may also increase the amount of calculation. In the present invention, the size of the ant colony is dynamically adjusted according to the complexity of the storage environment and the computing resources.
[0027] The initial pheromone value is the pheromone concentration on each path at the beginning of the algorithm. A higher initial value may make the algorithm more inclined to explore known areas, while a lower initial value increases the exploration of new areas. The present invention reasonably sets the initial pheromone value according to the characteristics of the storage environment to promote global search.
[0028] The pheromone volatility coefficient is the rate at which pheromones disappear naturally over time, and is used to adjust the forgetting speed of the algorithm and the balance between exploration and utilization. A higher volatility coefficient makes the algorithm more inclined to exploration, while a lower volatility coefficient makes the algorithm more inclined to utilize known information. The present invention dynamically adjusts the volatility coefficient according to the needs of path planning and environmental changes.
[0029] The pheromone importance factor is the weight of pheromone concentration relative to other factors (such as heuristic information) in the path selection process, which is used to adjust the algorithm's reliance on historical information. A larger factor value makes the algorithm more dependent on historical information, while a smaller factor value makes the algorithm more dependent on current heuristic information.
[0030] The heuristic factor is similar to the pheromone importance factor and is used to adjust the algorithm's reliance on direct path information and the use of global information. The random exploration probability is the probability that an ant will randomly choose a path when choosing the next step. Increasing this probability can improve the algorithm's exploration ability, but may sacrifice the convergence speed; reducing it makes the algorithm more stable but may fall into a local optimum.
[0031] Warehouse map information includes shelf locations, obstacle locations, and entrance and exit locations.
[0032] The step size of the RRT algorithm parameter is the actual expansion distance from the current node to the random point when the RRT tree expands a new node. A larger step size can improve the search efficiency, but may increase the risk of collision; a smaller step size makes the search more precise, but the speed is slower. The present invention is adjusted according to the actual environment and objectives to reduce the risk of collision as much as possible while improving the search efficiency.
[0033] The initial node of the RRT tree is set as the starting node, that is, the root node of the RRT tree is set as the starting position of the path search, ensuring that the algorithm starts searching from the correct starting point.
[0034] By fine-tuning the above parameters, the performance of the ant colony algorithm and the RRT algorithm in path planning can be significantly improved.
[0035] Step S20: After the map environment modeling is completed, the ant colony algorithm and RRT algorithm parameters are initialized, the ant colony algorithm and RRT algorithm are executed in parallel, all ants are released, and the global optimal path for the warehouse handling industrial robot to transport the target goods is found according to the modeled map environment, and the ant colony algorithm and RRT algorithm are executed in parallel.
[0036] The RRT algorithm process includes: Initialization: Set the initial node q init and the target node q goal ; Initialize an empty RRT tree and add the initial node to the empty RRT tree; Generate a random node: randomly generate a node q in the search space rand ; Find the nearest node: Find the node closest to q in the empty RRT tree rand The nearest node q near ; Expand the tree: from q near To q rand Direction expansion, generating a new node q new , whose position is constrained by the step size; Check validity: check q new Is it valid, that is, whether it is in the obstacle, if q new If it is valid, it is added to the RRT tree and a near to q new The edge of Try to connect to the target: if q new Close to the target node q goal , then try to connect to q new to q goal , if the connection is successful, a path is found, otherwise continue to iterate; Termination condition: The algorithm is terminated when the maximum number of iterations is reached or a feasible path is found for the warehouse handling robot to transport goods.
[0037] The ant colony algorithm process includes: Initialization: Initialize pheromone concentration , usually set to a small positive number, to initialize the heuristic information , usually the reciprocal of the distance between two points; Release ants: Each ant starts from the starting point and selects the next node based on the pheromone concentration and heuristic information. The probability of selection is calculated as shown in formula (2): # (2) Among them, α is the pheromone factor weight, β is the heuristic factor weight, i and j are the starting point and end point respectively, and k represents the kth ant. allowed k represents the set of nodes that ant k has not visited yet, represents the pheromone concentration from i to j under the pheromone factor weight α, represents the heuristic information from i to j under the weight of β heuristic factor; Update pheromone: After completing a traversal, update the pheromone according to the path found by the ant. The pheromone update formula is shown in formula (3): # (3) Among them, i and j are the starting point and the end point respectively, and k represents the kth ant. is the pheromone volatilization rate, is the pheromone left by ant k when it walks from path i to j in iteration t, m is the number of ants, is the pheromone concentration of path from i to j at time t, is the pheromone concentration of path i to j at time t+1; Iterative operation: Repeat the steps of building solutions and updating pheromones until the maximum number of iterations is reached or the optimal planning path for the warehouse handling robot to transport goods is obtained.
[0038] Step S30: During the movement, the ants update the feasible paths according to the shelves and obstacles on the path and release pheromones on the paths they pass. Meanwhile, the RRT algorithm continues to explore new paths and regularly converts the valid paths in the RRT tree into pheromone distributions in the ant colony algorithm.
[0039] Step S40: After all ants have completed a traversal or reached a preset condition, the global optimal path is updated based on the path information provided by the RRT tree and the pheromone distribution of the ant colony algorithm, and the pheromone is allowed to evaporate according to the set rules.
[0040] Specifically, step S30 and step S40 mainly include: RRT tree construction: The RRT algorithm is responsible for building a path tree in the search space and updating the tree structure after each iteration; Information sharing: The latest status of the RRT tree is notified to the ant colony algorithm, so that ants can find paths in the area that the RRT has explored; Ant path selection: When choosing a path, ants can consider not only pheromones and heuristic information, but also the potential optimal direction provided by the RRT tree; Pheromone update: After the ants complete the path construction, they update the pheromone according to the path quality and effectiveness. This information can also be used to guide the subsequent RRT expansion.
[0041] Step S50: Repeat steps S20 to S40 until a preset number of iterations is reached or convergence conditions are met, and the ant colony algorithm is used to obtain the global optimal path for the warehouse handling industrial robot to transport the target goods.
[0042] By running the RRT algorithm and the ant colony algorithm in parallel, the RRT algorithm can help quickly explore new areas, while the ant colony algorithm can optimize based on existing paths, achieving the collaborative work of the two. This hybrid method can find effective paths faster in complex environments.
[0043] In addition, the present invention also proposes a path planning device for a storage and handling industrial robot based on an improved ant colony algorithm, please refer to Figure 2 The path planning device for a storage and handling industrial robot based on an improved ant colony algorithm comprises: Map modeling and parameter initialization module: used to model the warehouse map environment using the grid method, including setting the initial node, target node, shelf and obstacle grid, and initializing the ant colony algorithm parameters; Execution module: used to add RRT algorithm to the ant colony algorithm, initialize RRT algorithm parameters, execute the ant colony algorithm and RRT algorithm in parallel, and release all ants; parameter update module: used for ants to update feasible paths according to the shelves and obstacles on the path during movement, and release pheromones on the passed path. At the same time, the RRT algorithm continues to explore new paths and regularly converts valid paths in the RRT tree into pheromone distribution in the ant colony algorithm; iterative operation module: repeatedly run the execution module and the parameter update module until the preset number of iterations is reached or the convergence conditions are met, and the ant colony algorithm is used to obtain the global optimal path for the warehouse handling industrial robot to transport the target goods.
[0044] The path planning device for a warehouse handling industrial robot based on an improved ant colony algorithm provided by the present application adopts the path planning method for a warehouse handling industrial robot based on an improved ant colony algorithm in the above-mentioned embodiment, which can solve the technical problem that the optimal solution cannot be stably obtained. Compared with the prior art, the beneficial effects of the path planning device for a warehouse handling industrial robot based on an improved ant colony algorithm provided by the present application are the same as the beneficial effects of the path planning method for a warehouse handling industrial robot based on an improved ant colony algorithm provided by the above-mentioned embodiment, and the other technical features of the path planning device for a warehouse handling industrial robot based on an improved ant colony algorithm are the same as the features disclosed in the above-mentioned embodiment method, which will not be repeated here.
[0045] The present application provides a warehouse and handling industrial robot path planning device based on an improved ant colony algorithm, and the warehouse and handling industrial robot path planning device based on the improved ant colony algorithm includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the warehouse and handling industrial robot path planning method based on the improved ant colony algorithm in the above-mentioned embodiment one.
[0046] Reference below Figure 3 , which shows a schematic diagram of the structure of a warehouse handling industrial robot path planning device based on an improved ant colony algorithm suitable for implementing the embodiment of the present application. The warehouse handling industrial robot path planning device based on an improved ant colony algorithm in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions: tablet computers), PMPs (Portable Media Players: portable multimedia players), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 3The warehouse handling industrial robot path planning device based on the improved ant colony algorithm is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.
[0047] Figure 3 The warehouse handling industrial robot path planning device based on the improved ant colony algorithm shown may include a processing device 1001 (e.g., a central processing unit, a graphics processor, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: ReadOnly Memory) 1002 or a program loaded from a storage device 1003 to a random access memory (RAM: RandomAccess Memory) 1004. In RAM1004, various programs and data required for the operation of the warehouse handling industrial robot path planning device based on the improved ant colony algorithm are also stored. The processing device 1001, ROM1002, and RAM1004 are connected to each other via a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems can be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 1003 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 1009. The communication device 1009 can allow the warehouse handling industrial robot path planning device based on the improved ant colony algorithm to communicate wirelessly or wired with other devices to exchange data. Although the figure shows a warehouse handling industrial robot path planning device based on the improved ant colony algorithm with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems may be implemented or have alternatively.
[0048] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.
[0049] The warehouse handling industrial robot path planning device based on the improved ant colony algorithm provided by the present application adopts the warehouse handling industrial robot path planning method based on the improved ant colony algorithm in the above embodiment, which can solve the technical problem that complex public data is difficult to process. Compared with the prior art, the beneficial effects of the warehouse handling industrial robot path planning device based on the improved ant colony algorithm provided by the present application are the same as the beneficial effects of the warehouse handling industrial robot path planning method based on the improved ant colony algorithm provided by the above embodiment, and the other technical features of the warehouse handling industrial robot path planning device based on the improved ant colony algorithm are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.
[0050] The various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.
[0051] The present application also provides a computer program product, including a computer program, which, when executed by a processor, implements the steps of the above-mentioned warehouse handling industrial robot path planning method based on the improved ant colony algorithm.
[0052] The computer program product provided by this application can solve the technical problem that complex public data is difficult to process. Compared with the prior art, the beneficial effects of the computer program product provided by this application are the same as the beneficial effects of the warehouse handling industrial robot path planning method based on the improved ant colony algorithm provided in the above embodiment, which will not be repeated here.
[0053] The above descriptions are only some embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structural changes made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect applications in other related technical fields are included in the patent protection scope of the present application.
Claims
1. A path planning method for a warehouse handling industrial robot based on an improved ant colony algorithm, characterized in that: The method comprises the following steps: S10: Modeling the warehouse map environment using the grid method, including setting the initial node, target node, shelf and obstacle grid, and initializing the ant colony algorithm parameters; S20: After the map environment modeling is completed, the parameters of the ant colony algorithm and the RRT algorithm are initialized, the ant colony algorithm and the RRT algorithm are executed in parallel, all ants are released, and the global optimal path for the storage and handling industrial robot to transport the target goods is found according to the modeled map environment; S30: During the movement, the ants update the feasible paths according to the shelves and obstacles on the path, and release pheromones on the paths they pass. Meanwhile, the RRT algorithm continues to explore new paths and regularly converts the valid paths in the RRT tree into pheromone distributions in the ant colony algorithm. S40: After all ants have completed a traversal or reached the preset conditions, the global optimal path is updated based on the path information provided by the RRT tree and the pheromone distribution of the ant colony algorithm, and the pheromone is allowed to evaporate according to the set rules; S50: Repeat steps S20 to S40 until a preset number of iterations is reached or convergence conditions are met, thereby obtaining a global optimal path for the warehousing and handling industrial robot to transport the target goods.
2. The path planning method for a warehouse handling industrial robot based on an improved ant colony algorithm according to claim 1 is characterized in that in, The ant colony algorithm parameters and RRT algorithm parameters initialized in step S20 include ant colony size, pheromone initial value, pheromone volatility coefficient, pheromone importance factor, heuristic factor, random exploration probability, warehouse map environment information, RRT algorithm step size and the initial node of the RRT tree is set as the starting point.
3. The path planning method for a warehouse handling industrial robot based on an improved ant colony algorithm according to claim 2 is characterized in that in, The warehouse map environment information includes shelf locations, obstacle locations, and entrance and exit locations.
4. The path planning method for a warehouse handling industrial robot based on an improved ant colony algorithm according to claim 1 is characterized in that: It also includes adjusting the expansion priority of the RRT algorithm according to the urgency or handling priority of the warehouse goods during the initialization phase, as well as the weighted processing of shelf positions in the ant colony algorithm.
5. The path planning method for a warehouse handling industrial robot based on an improved ant colony algorithm according to claim 1 is characterized in that: In step S30, the RRT algorithm is used to update the feasible path. When updating the feasible path, the RRT algorithm not only considers randomness and step size, but also refers to the pheromone concentration area in the ant colony algorithm. At the same time, the ant colony algorithm combines the path information provided by the RRT tree when selecting the moving direction.
6. The path planning method for a storage and handling industrial robot based on an improved ant colony algorithm according to claim 1 is characterized in that: The updating of the global optimal path in step S40 not only considers the path length, but also comprehensively evaluates the smoothness of the RRT tree path and the concentration of the ant colony algorithm pheromone.
7. The path planning method for a warehouse handling industrial robot based on an improved ant colony algorithm according to claim 1 is characterized in that: After the global optimal path is obtained in step S50, the global optimal path is smoothed, and redundant turning points are removed by dynamic programming to optimize the path shape.
8. A path planning device for a warehouse handling industrial robot based on an improved ant colony algorithm, characterized in that: The path planning device for a storage and handling industrial robot based on an improved ant colony algorithm comprises: Map modeling and parameter initialization module: used to model the warehouse map environment using the grid method, including setting the initial node, target node, shelf and obstacle grid, and initializing the ant colony algorithm parameters; Execution module: used to add RRT algorithm to the ant colony algorithm, initialize RRT algorithm parameters, execute the ant colony algorithm and RRT algorithm in parallel, and release all ants; parameter update module: used for ants to update feasible paths according to the shelves and obstacles on the path during movement, and release pheromones on the passed path. At the same time, the RRT algorithm continues to explore new paths and regularly converts valid paths in the RRT tree into pheromone distribution in the ant colony algorithm; iterative operation module: repeatedly run the execution module and the parameter update module until the preset number of iterations is reached or the convergence conditions are met, and the ant colony algorithm is used to obtain the global optimal path for the warehouse handling industrial robot to transport the target goods.
9. A warehouse handling industrial robot path planning device based on an improved ant colony algorithm, characterized in that: The warehouse handling industrial robot path planning device based on the improved ant colony algorithm includes: a memory, a processor, and programs of the improved ant colony algorithm and the RRT algorithm stored in the memory and executable on the processor. When the improved ant colony algorithm and the RRT algorithm programs are executed by the processor, the warehouse handling industrial robot path planning method based on the improved ant colony algorithm as described in any one of claims 1 to 7 is implemented.
10. A computer program product, characterized in that The computer program product includes programs of improved ant colony algorithm and RRT algorithm. When the programs of improved ant colony algorithm and RRT algorithm are executed by a processor, the path planning method for a warehousing and handling industrial robot based on the improved ant colony algorithm as described in any one of claims 1 to 7 is implemented.
Citation Information
Patent Citations
Three-dimensional space multi-target path planning method combining RRT algorithm and ant colony algorithm
CN109211242A
Robot path planning method
CN116203975A
Cited By
Cluster storage robot system control method based on artificial intelligence
CN120397536A
An artificial intelligence-based cluster warehouse robot system control method
CN120397536B
