Path planning method, device and equipment based on seagull algorithm and storage medium
Through Gaussian mapping, flower pollination and rider optimization algorithms, the position update of the Seagull algorithm is improved, and combined with bidirectional sine chaos mutation processing, the problem of local optimality and low convergence accuracy in path planning is solved, and more efficient path planning is achieved.
Patent Information
- Application Number
- CN202410984055.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-22
- Publication Date
- 2024-11-12
AI Technical Summary
The Haigull algorithm is prone to falling into local optimization and low convergence accuracy in path planning, making it difficult to achieve ideal results for the planned path.
The seagull population position is initialized through Gaussian mapping, and the position update process is improved by combining the flower pollination algorithm and rider optimization algorithm. Two-way sine chaos mutation processing is adopted to optimize the seagull position to jump out of the local optimal solution.
It improves the stability and adaptability of the algorithm, increases the search range, achieves faster convergence speed and higher accuracy, and avoids local optimal traps.
Smart Images

Figure CN118936497A_ABST
Abstract
Description
Technical Field
[0001] The embodiments of the present application relate to the technical field of path planning, and in particular to a path planning method, apparatus, device and storage medium based on a Seagull algorithm. Background Art
[0002] The air-ground heterogeneous robot system composed of aerial drones and ground unmanned vehicles is a hot topic in the research of distributed artificial intelligence technology. The organic coordination and cross-domain collaboration of drones and unmanned vehicles will lead to a new model of future robot technology and applications, and has broad application prospects in power inspection.
[0003] Path planning for unmanned power inspection vehicles assisted by drones is one of the key technologies of air-ground heterogeneous robot systems. First, a grid map of the ground environment is established based on the perception system and positioning navigation system carried by the drone; second, the unmanned power inspection vehicle receives the drone grid map information in real time, corrects and supplements the grid map based on the environmental information it perceives, and then plans an optimal collision-free moving path from the starting point to the end point. At present, the relevant technology mainly relies on the Seagull algorithm for intelligent path planning when performing path planning. However, the Seagull algorithm still has certain defects when applied to path planning problems, which easily causes the overall algorithm to have local optimality and low convergence accuracy, making it difficult for the final output planning path to achieve the ideal effect.
[0004] Based on this, it is necessary to propose a path planning method that improves the Seagull algorithm. Summary of the invention
[0005] One purpose of the embodiments of the present application is to provide a path planning method, device, equipment and storage medium based on the Seagull algorithm to solve the technical problem that the current related technology is prone to fall into local optimality and low convergence accuracy when using the Seagull algorithm for path planning, resulting in the final planned path being difficult to achieve the ideal effect.
[0006] In a first aspect, an embodiment of the present application provides a path planning method based on a seagull algorithm, the method comprising: obtaining a grid map; determining an objective function of path planning based on the grid map; initializing the position of the seagull population through Gaussian mapping based on the seagull algorithm, and determining the optimal fitness value and the optimal seagull position based on the objective function; using a flower pollination algorithm and a rider optimization algorithm to improve the position update process of the seagull algorithm, and determining the updated initial optimal seagull position and the initial optimal fitness value; performing a bidirectional sine chaotic mutation process on the optimal seagull position to determine the target seagull position and the target fitness value corresponding to the target seagull position, and comparing the initial optimal fitness value with the target optimal fitness value to determine the updated optimal seagull position; when the position update process of the seagull algorithm meets the preset maximum number of iterations, outputting a path planning result based on the seagull algorithm.
[0007] In combination with the first aspect, in a possible implementation, the objective function satisfies at least one of the shortest moving path, the shortest time consumption, or the least energy consumption, and the objective function corresponds to specific constraints and the number of key nodes of the path.
[0008] In combination with the first aspect, in a possible implementation manner, the initializing the position of the seagull population by Gaussian mapping based on the seagull algorithm includes:
[0009] Determine the size N of the seagull population, the maximum number of iterations Miter, the lower boundary LB of the seagull search, and the upper boundary UB of the seagull search; determine the random number through Gaussian mapping:
[0010]
[0011] According to the random number, the position of the seagull population is initialized:
[0012] P s (t) = (UB - LB) × x t +LB,
[0013] Where: x t is a random number, x t+1 It is data generated iteratively based on the generated random numbers.
[0014] In combination with the first aspect, in a possible implementation manner, the position update process of the seagull algorithm includes the migration behavior of the seagull, and the migration behavior of the seagull includes:
[0015] Determine the new positions of individual seagulls to avoid overlap between individual seagulls:
[0016] C s (t) = A × P s (t),
[0017] A=f c -(t×f c / Miter),
[0018] Where: C s (t) is the new position that does not conflict with other seagulls, P s (t) is the current position of the seagull, t is the current iteration number, Miter is the maximum iteration number, and A is the movement behavior of the seagull in the given search space. c is the control coefficient, and its value decreases from 2 to 0;
[0019] After avoiding the overlap of positions between individual seagulls, the individual seagulls move towards the optimal position:
[0020] M s (t) = B × (P bs (t)-P s (t)),
[0021] B = 2 × A 2 × d ,
[0022] Where: M s (t) represents the direction of the optimal position, P bs (t) represents the best position at the tth iteration, and B is a random number responsible for balancing global and local searches. d is a random number in the range [0,1];
[0023] Seagull individuals arrive at new locations:
[0024] D s (t)=|C s (t)+M s (t)|,
[0025] Where: D s (t) is the distance the seagull moves to its new position.
[0026] In combination with the first aspect, in a possible implementation manner, the position update process of the seagull algorithm further includes a global attack behavior of the seagull, and the global attack behavior of the seagull includes:
[0027] The spiral motion can continuously change the attack angle and speed:
[0028]
[0029] Where r is the radius of each spiral, θ is a random angle value in the range [0, 2π], u and v are related constants of the spiral shape, and e is the base of the natural logarithm.
[0030] In combination with the first aspect, in a possible implementation, a flower pollination algorithm and a rider optimization algorithm are used to improve the position update process of the seagull algorithm, including:
[0031]
[0032] In the formula, P s (t+1) is the updated position of the seagull at the t+1th iteration, P bs (t) represents the optimal position of the tth iteration, P s (t) is the position of the seagull at the tth iteration, α is a random number between [0,1], rand is a random number between [0,1], p is the switching probability, which is used to control the formula for switching the seagull position update, ε is a random number between [0,1], r 1 and r 2 is a random integer between [1, N], P r1 (t) and P r2 (t) are randomly selected rth 1 and r 2 The position of the seagulls, r 1 ≠r 2 , L is the step size of the search using the Levy flight mechanism, Γ(λ) is the standard gamma function, λ = 1.5.
[0033] In combination with the first aspect, in a possible implementation manner, the performing a bidirectional sine chaotic variation process on the optimal seagull position includes:
[0034] According to the current number of iterations, the sine chaos value is determined, and the positive and negative directions are switched with equal probability, including:
[0035] SinValue=sin(πx 0 ),
[0036]
[0037] The optimal seagull position is subjected to a variation disturbance, including:
[0038] P bs(j) (t+1)'=P bs(j) (t+1)+SinValue×P bs(j) (t+1)
[0039] Where: P bs(j) (t+1) represents the optimal position P of the t+1th iteration bs The jth dimension of (t+1);
[0040] Perform a greedy update, including:
[0041]
[0042] Where: P bs (t+1) represents the optimal position of the t+1th iteration, P bs (t+1)′ represents the optimal position after the mutation disturbance after the t+1th iteration;
[0043] After the mutation disturbance is performed in each dimension, the bidirectional sine chaotic mutation processing of the optimal seagull position is stopped.
[0044] In the second aspect, the embodiment of the present application also proposes a path planning device based on the seagull algorithm, the device comprising: an information acquisition module for acquiring a grid map; a function determination module for determining the objective function of path planning according to the grid map; an initialization module for initializing the seagull population position through Gaussian mapping based on the seagull algorithm, and determining the optimal fitness value and the optimal seagull position according to the objective function; a position update module for improving the position update process of the seagull algorithm by adopting a flower pollination algorithm and a rider optimization algorithm, and determining the updated initial optimal seagull position and the initial optimal fitness value; a mutation processing module for performing bidirectional sine chaotic mutation processing on the optimal seagull position to determine the target seagull position and the target fitness value corresponding to the target seagull position, and comparing the initial optimal fitness value with the target optimal fitness value to determine the updated optimal seagull position; a path output module for outputting the path planning result based on the seagull algorithm when the position update process of the seagull algorithm meets the preset maximum number of iterations.
[0045] In a third aspect, an embodiment of the present application further proposes a computer device, comprising a memory and a processor, wherein the memory is connected to the processor, and the processor is used to execute one or more computer programs stored in the memory. When the processor executes the one or more computer programs, the computer device implements the method described in the first aspect.
[0046] In a fourth aspect, an embodiment of the present application further proposes a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, wherein the computer program includes program instructions, and when the program instructions are executed by a processor, the processor executes the method described in the first aspect.
[0047] The embodiments of the present application can achieve the following technical effects:
[0048] Based on the method proposed in the embodiment of the present application, when used for path planning, a grid map is first obtained, and based on the grid map, the objective function of the path planning is determined. Then, based on the seagull algorithm, the position of the seagull population is initialized through Gaussian mapping, and the optimal fitness value and the optimal seagull position are determined according to the objective function. At the same time, the flower pollination algorithm and the rider optimization algorithm are used to improve the position update process of the seagull algorithm, and the updated initial optimal seagull position and the initial optimal fitness value are determined. Finally, the optimal seagull position is subjected to bidirectional sine chaotic mutation processing to determine the target seagull position and the target fitness value corresponding to the target seagull position, and the initial optimal fitness value is compared with the target optimal fitness value to determine the updated optimal seagull position. When the position update process of the seagull algorithm meets the preset maximum number of iterations, the path planning result based on the seagull algorithm is output.
[0049] Compared with the existing technology, this method first introduces Gaussian mapping to initialize the position of the seagull population, thereby improving the uniformity and diversity of the population position distribution, and then enhancing the stability of the algorithm. At the same time, the position update method of the seagulls is improved, and the position update mechanism of the flower pollination algorithm and the rider optimization algorithm is introduced to improve the seagull position update method. The seagull position is updated by comprehensively considering different position update modes, the optimal position of the seagull in this iteration, the positions of other seagulls within the population, the Levy flight mechanism and other factors, thereby increasing the search range of the algorithm and enhancing the adaptability of the algorithm. Finally, the bidirectional sine chaotic mapping mutation is used for the optimal seagull, so that the algorithm can jump out of the local optimal solution in the later stage. BRIEF DESCRIPTION OF THE DRAWINGS
[0050] The accompanying drawings constituting a part of the present invention are used to provide a further understanding of the present invention. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the accompanying drawings:
[0051] Figure 1 A schematic diagram of a flow chart of a path planning method based on the Seagull algorithm provided in an embodiment of the present application;
[0052] Figure 2 A schematic diagram of an iteration curve provided in an embodiment of the present application;
[0053] Figure 3 A schematic diagram of a path planning result provided in an embodiment of the present application;
[0054] Figure 4 A schematic diagram of the structure of a path planning device based on the Seagull algorithm provided in an embodiment of the present application;
[0055] Figure 5 A schematic diagram of the structure of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0056] The present invention will be described in detail below with reference to the accompanying drawings and in combination with embodiments. It should be noted that the embodiments and features in the embodiments of the present invention can be combined with each other without conflict.
[0057] The following detailed description is an exemplary description, which is intended to provide further detailed description of the present invention. Unless otherwise specified, all technical terms used in the present invention have the same meaning as those generally understood by those skilled in the art to which the present invention belongs. The terms used in the present invention are only for describing specific embodiments, and are not intended to limit the exemplary embodiments according to the present invention.
[0058] Related technologies involved in the embodiments of this application:
[0059] Seagull Optimization Algorithm (SOA) is a global optimization algorithm inspired by the migration and predation behavior of seagulls in nature. In 2019, Gaurav Dhiman et al. first proposed this algorithm. The Seagull Optimization Algorithm simulates the migration and attack behavior of seagulls in nature, abstracts these behaviors and establishes a mathematical model, which is then used to solve optimization problems.
[0060] In order to better explain this application, the main features of the Seagull algorithm are introduced:
[0061] The core idea of the Seagull Algorithm is based on two important characteristics of seagulls: migration and predation. Migration is the seasonal change of location of seagulls in search of food, while predation involves the strategy of how seagulls can effectively capture prey.
[0062] The main process of the seagull algorithm includes: initialization, at the beginning of the algorithm, the position of the seagull group needs to be initialized, which is usually achieved by random distribution in the search space; migration phase, during the migration, the seagulls will avoid collisions with each other and move towards the companions with the strongest adaptability. This process is simulated by updating the position formula to ensure the balance between population diversity and search ability; predation phase: when preying, the seagulls adopt a spiral descent method to attack the prey to simulate the local search process and enhance the exploration ability of the algorithm.
[0063] For further information, please refer to Figure 2 , Figure 2 The figure shows a flow chart of a path planning method based on the Seagull algorithm, the method comprising:
[0064] Step S10, obtaining a grid map;
[0065] It should be noted that the application scenario of this method is an air-ground heterogeneous robot system composed of a drone and a ground unmanned vehicle. In this system, the drone is equipped with a perception system and a positioning and navigation system, and then through the cooperation between its perception system and the positioning and navigation system, it collects a grid map in a certain ground environment. The ground unmanned vehicle receives the grid map collected by the drone in real time, and further corrects and supplements the environmental information indicated by the grid map during its own inspection process, so that in the subsequent steps, combined with the improved Seagull algorithm, the optimal path is planned in the grid map.
[0066] Step S20, determining the objective function of path planning according to the grid map;
[0067] The objective function satisfies at least one of the shortest moving path, the shortest time consumption or the least energy consumption. In addition, the objective function can determine specific constraint conditions and information such as the number of key nodes of the path.
[0068] Step S30, based on the seagull algorithm, initializing the position of the seagull population through Gaussian mapping, and determining the optimal fitness value and the optimal seagull position according to the objective function;
[0069] Specifically, in this embodiment, the position of the seagull population is initialized by Gaussian mapping, including:
[0070] Determine the size N of the seagull population, the maximum number of iterations Miter, the lower boundary LB of the seagull search, and the upper boundary UB of the seagull search; determine the random number through Gaussian mapping:
[0071] Finally, according to the random number, the position of the seagull population is initialized as follows:
[0072] P s (t) = (UB - LB) × x t +LB,
[0073] Where: x t is a random number, x t+1 It is data generated iteratively based on the generated random numbers.
[0074] More specifically, as a feasible implementation method, there are:
[0075] fitness(t)=F f (P s (t+1))
[0076] Among them, F f () is the fitness function when calculating the fitness value.
[0077] Step S40, using the flower pollination algorithm and the rider optimization algorithm to improve the position update process of the seagull algorithm, and determine the updated initial optimal seagull position and the initial optimal fitness value;
[0078] Among them, the flower pollination algorithm is the flower pollination optimization algorithm (FPA), and the rider optimization algorithm is (Rider Optimization Algorithm, ROA). For the convenience of understanding this application, FPA and ROA are explained as follows:
[0079] FPA, which is based on the natural behavior of flower pollination, regards pollen gametes as feasible solutions to the optimization problem, and searches for the optimal solution by simulating cross-pollination (global search) and self-pollination (local search). ROA, which is based on the collaborative behavior of rider group competition, can effectively avoid falling into the local optimal situation and has strong global search capabilities.
[0080] In this embodiment, the flower pollination algorithm and the rider optimization algorithm are used to improve the position update process of the seagull algorithm, including:
[0081]
[0082] in, P s (t+1) is the updated position of the seagull at the t+1th iteration, P bs (t) represents the optimal position of the tth iteration, P s (t) is the position of the seagull at the tth iteration, α is a random number between [0,1], rand is a random number between [0,1], p is the switching probability, which is used to control the formula for switching the seagull position update, ε is a random number between [0,1], r 1 and r 2 is a random integer between [1, N], and are randomly selected r 1 and r 2 The position of the seagulls, r 1 ≠r 2 , L is the step length of the search using the Levy flight mechanism, when s>>s 0 When >0, the Levy flight mechanism can only be used at longer step sizes, Γ(λ) is the standard gamma function, λ=1.5.
[0083] The position update process of the seagull algorithm includes the migration behavior of the seagull, and the migration behavior of the seagull includes:
[0084] Determine the new positions of individual seagulls to avoid overlap between individual seagulls:
[0085] C s (t) = A × P s (t),
[0086] A=f c -(t×f c / Miter),
[0087] Where: C s (t) is the new position that does not conflict with other seagulls, P s (t) is the current position of the seagull, t is the current iteration number, Miter is the maximum iteration number, and A is the movement behavior of the seagull in the given search space. c is the control coefficient, and its value decreases from 2 to 0;
[0088] After avoiding the overlap of positions between individual seagulls, the individual seagulls move towards the optimal position:
[0089] M s (t) = B × (P bs (t)-P s (t)),
[0090] B = 2 × A 2 × d ,
[0091] Where: M s (t) represents the direction of the optimal position, P bs (t) represents the best position at the tth iteration, and B is a random number responsible for balancing global and local searches. d is a random number in the range [0,1];
[0092] Seagull individuals arrive at new locations:
[0093] D s (t)=|C s (t)+M s (t)|,
[0094] Where: D s (t) is the distance the seagull moves to its new position.
[0095] Furthermore, the position update process of the above-mentioned Seagull algorithm also includes the global attack behavior of the Seagull, and the global attack behavior of the Seagull includes:
[0096] The spiral motion can continuously change the attack angle and speed:
[0097]
[0098] Where r is the radius of each spiral, θ is a random angle value in the range [0, 2π]. u and v are constants related to the shape of the spiral, and e is the base of the natural logarithm.
[0099] Step S50, performing a bidirectional sine chaotic mutation process on the optimal seagull position to determine a target seagull position and a target fitness value corresponding to the target seagull position, and comparing the initial optimal fitness value with the target optimal fitness value to determine an updated optimal seagull position;
[0100] Specifically, the optimal seagull position is subjected to a bidirectional sine chaotic mutation process, including:
[0101] According to the current number of iterations, the sine chaos value is determined, and the positive and negative directions are switched with equal probability, including:
[0102] SinValue=sin(πx 0 ),
[0103]
[0104] The optimal seagull position is subjected to a variation disturbance, including:
[0105] P bs(j) (t+1)'=P bs(j) (t+1)+SinValue×P bs(j) (t+1)
[0106] Where: P bs(j) (t+1) represents the optimal position P of the t+1th iteration bs The jth dimension of (t+1);
[0107] Then a greedy update is performed, including:
[0108]
[0109] Where: P bs (t+1) represents the optimal position of the t+1th iteration, P bs (t+1)′ represents the optimal position after the mutation disturbance after the t+1th iteration;
[0110] After each dimension of the current iteration is subjected to mutation disturbance, the bidirectional sine chaotic mutation process on the optimal seagull position is stopped.
[0111] Step S60: When the position update process of the Seagull algorithm meets the preset maximum number of iterations, the path planning result based on the Seagull algorithm is output.
[0112] It is easy to understand that the above steps are repeated until the maximum number of iterations Miter is reached, the algorithm stops, and the optimal path result is output. Using MATLAB as the simulation platform, assuming that the unmanned vehicle obtains a 20×20 grid map from the drone, and taking the shortest moving distance as the goal, the traditional Seagull algorithm SOA (Seagull optimization algorithm, SOA) and the improved Seagull optimization algorithm ISOA (Improve Seagull optimization algorithm, ISOA) in the embodiment of the present application are analyzed and compared.
[0113] The parameters of the SOA algorithm are: N = 50, Maxiter = 200, LB = 1, UB = 20; the parameters of the ISOA algorithm are: N = 50, Maxiter = 200, LB = 1, UB = 20. The iteration curves obtained by the two methods in the simulation environment are as follows Figure 2 As shown, the path planning results are as follows Figure 3 As shown in Table 1 below, the data results of the two algorithms are compared.
[0114] Table 1. Comparison of algorithm path results
[0115] algorithm Path length SOA 36.9706 ISOA 33.3137
[0116] from Figure 2 It can be intuitively found that the moving path obtained by SOA is longer and more circuitous than that of ISOA, while the path obtained by ISOA is more reasonable. Figure 2 and Figure 3 From the results in , it can be seen that when the SOA algorithm is used, the algorithm converges slowly; when the ISOA algorithm is used, the convergence speed is faster and a better path can be found faster. It can be seen that the ISOA algorithm proposed in the embodiment of the present application has a faster convergence speed and convergence accuracy, while the traditional SOA falls into a local optimum. The simulation results show that under a variety of identical environments, the ISOA algorithm has a stronger search capability and obtains a better mobile path, verifying the effectiveness of the algorithm.
[0117] As another aspect of an embodiment of the present application, an embodiment of the present application also provides a path planning device based on the Seagull algorithm, which can be a software module. The software module includes a number of instructions stored in a memory. The processor can access the memory and call the instructions for execution to complete the path planning method based on the Seagull algorithm described in the above-mentioned embodiments.
[0118] In some embodiments, the path planning device based on the Seagull algorithm can also be constructed by hardware devices. For example, the path planning device based on the Seagull algorithm can be constructed by one or more chips, and each chip can work in coordination with each other to complete the path planning method based on the Seagull algorithm described in the above embodiments. For another example, the path planning device based on the Seagull algorithm can also be constructed by various logic devices, such as a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), a single-chip microcomputer, an ARM (Acorn RISC Machine) or other programmable logic device, a discrete gate or transistor logic, a discrete hardware component, or any combination of these components.
[0119] For details, please refer to Figure 4 , Figure 4 The figure is a schematic diagram of the structure of a path planning device based on the Seagull algorithm, as shown in the figure, including:
[0120] The information acquisition module 410 is used to acquire a grid map;
[0121] A function determination module 420, configured to determine an objective function of path planning according to the grid map;
[0122] An initialization module 430 is used to initialize the position of the seagull population through Gaussian mapping based on the seagull algorithm, and determine the optimal fitness value and the optimal seagull position according to the objective function;
[0123] A position updating module 440 is used to improve the position updating process of the seagull algorithm by using the flower pollination algorithm and the rider optimization algorithm, and determine the updated initial optimal seagull position and the initial optimal fitness value;
[0124] A mutation processing module 450 is used to perform a bidirectional sine chaotic mutation process on the optimal seagull position to determine a target seagull position and a target fitness value corresponding to the target seagull position, and compare the initial optimal fitness value with the target optimal fitness value to determine an updated optimal seagull position;
[0125] The path output module 460 is used to output the path planning result based on the Seagull algorithm when the position update process of the Seagull algorithm meets the preset maximum number of iterations.
[0126] Further, see Figure 5 , Figure 5 1 is a schematic diagram of the structure of a computer device provided in an embodiment of the present application. The computer device includes one or more processors 51 and a memory 52. The memory 52 is connected to the one or more processors 51, for example, connected to the processor 51 via a bus.
[0127] The processor 51 is configured to support the computer device to perform the corresponding functions in the method in the above method embodiment. The processor 51 can be a central processing unit (CPU), a network processor (NP), a hardware chip or any combination thereof. The above hardware chip can be an application specific integrated circuit (ASIC), a programmable logic device (PLD) or a combination thereof. The above PLD can be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL) or any combination thereof.
[0128] The memory 52 is used to store program codes, etc. The memory 52 may include a volatile memory (VM), such as a random access memory (RAM); the memory 52 may also include a non-volatile memory (NVM), such as a read-only memory (ROM), a flash memory, a hard disk drive (HDD) or a solid-state drive (SSD); the memory 52 may also include a combination of the above-mentioned types of memory.
[0129] The memory 52 can be used to store non-volatile software programs, non-volatile computer executable programs and modules, such as program instructions / modules corresponding to the path planning method based on the seagull algorithm in the embodiment of the present application. The processor 51 executes various functional applications and data processing of the path planning method based on the seagull algorithm and the path planning device based on the seagull algorithm by running the non-volatile software programs, instructions and modules stored in the memory 52, that is, to realize the functions of the various modules or units of the path planning method based on the seagull algorithm and the path planning device based on the seagull algorithm provided in the above method embodiment.
[0130] The memory 52 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application required for at least one function. The data storage area may store data created based on the use of a path planning device based on the seagull algorithm, etc. In some embodiments, the memory 52 may optionally include a memory remotely arranged relative to the processor 51, and these remote memories may be connected to the path planning device based on the seagull algorithm via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0131] One or more modules are stored in the memory 52. When executed by one or more processors 51, the path planning method based on the Seagull algorithm in any of the above method embodiments is executed, for example, the method steps described in the above method embodiments are executed to realize the functions of the modules described in the above device embodiments.
[0132] An embodiment of the present application further provides a computer-readable storage medium, which stores a computer program. The computer program includes program instructions. When the program instructions are executed by a computer, the computer executes the method of the aforementioned embodiment.
[0133] It is known from common technical knowledge that the present invention can be implemented by other embodiments that do not deviate from its spirit or essential features. Therefore, the above disclosed embodiments are only illustrative in all respects and are not exclusive. All changes within the scope of the present invention or within the scope equivalent to the present invention are included in the present invention.
[0134] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take 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.) containing computer-usable program code.
[0135] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks 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 produce 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 device that provides the functions specified in a block or multiple blocks.
[0136] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0137] 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.
[0138] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the above embodiments, ordinary technicians in the relevant field should understand that the specific implementation methods of the present invention can still be modified or replaced by equivalents. Any modification or equivalent replacement that does not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.
Claims
1. A path planning method based on the Seagull algorithm, characterized in that: The method comprises: Get the raster map; Determining an objective function of path planning according to the grid map; Based on the seagull algorithm, the positions of the seagull population are initialized by Gaussian mapping, and the optimal fitness value and the optimal seagull position are determined according to the objective function; The flower pollination algorithm and the rider optimization algorithm are used to improve the position update process of the seagull algorithm and determine the updated initial optimal seagull position and initial optimal fitness value; Performing a bidirectional sine chaotic mutation process on the optimal seagull position to determine a target seagull position and a target fitness value corresponding to the target seagull position, and comparing the initial optimal fitness value with the target optimal fitness value to determine an updated optimal seagull position; When the position update process of the Seagull algorithm meets the preset maximum number of iterations, the path planning result based on the Seagull algorithm is output.
2. The method according to claim 1, characterized in that The objective function satisfies at least one of the shortest moving path, the shortest time consumption or the least energy consumption, and the objective function corresponds to specific constraint conditions and the number of key nodes of the path.
3. The method according to claim 1, characterized in that The method based on the seagull algorithm and initializing the position of the seagull population through Gaussian mapping includes: Determine the size of the seagull population N, the maximum number of iterations Miter, the lower boundary LB of the seagull search, and the upper boundary UB of the seagull search; Determine random numbers through Gaussian mapping: According to the random number, the position of the seagull population is initialized: P s (t)=(UB-LB)×x t +LB, Where: x t is a random number, x t+1 It is data generated iteratively based on the generated random numbers.
4. The method according to claim 1, characterized in that: The position update process of the seagull algorithm includes the migration behavior of seagulls, and the migration behavior of seagulls includes: Determine the new positions of individual seagulls to avoid overlap between individual seagulls: C s (t)=A×P s (t), A=f c -(t×f c / Miter), Where: C s (t) is the new position that does not conflict with other seagulls, P s (t) is the current position of the seagull, t is the current iteration number, Miter is the maximum iteration number, A is the movement behavior of the seagull in the given search space, and f c is the control coefficient, and its value decreases from 2 to 0; After avoiding the overlap of positions between individual seagulls, the individual seagulls move towards the optimal position: M s (t)=B×(P bs (t)-P s (t)), B=2×A 2 ×r d , Where: M s (t) represents the direction of the optimal position, P bs (t) represents the best position of the tth iteration, B is a random number responsible for balancing global and local searches, and r d is a random number in the range [0,1]; Seagull individuals arrive at new locations: D s (t)=|C s (t)+M s (t)|, Where: D s (t) is the distance the seagull moves to its new position.
5. The method according to claim 1, characterized in that The position update process of the Seagull algorithm also includes the global attack behavior of the Seagull, and the global attack behavior of the Seagull includes: The spiral motion can continuously change the attack angle and speed: Where r is the radius of each spiral, θ is a random angle value in the range [0, 2π], u and v are related constants of the spiral shape, and e is the base of the natural logarithm.
6. The method according to claim 1, characterized in that The flower pollination algorithm and rider optimization algorithm are used to improve the position update process of the seagull algorithm, including: In the formula, P s (t+1) is the updated position of the seagull at the t+1th iteration, P bs (t) represents the optimal position of the tth iteration, P s (t) is the position of the seagull at the tth iteration, α is a random number between [0,1], rand is a random number between [0,1], p is the switching probability, which is used to control the formula for switching the seagull position update, ε is a random number between [0,1], r1 and r2 are random integers between [1,N], P r1 (t) and P r2 (t) are the positions of the randomly selected r1-th and r2-th seagulls, respectively, r1≠r2, L is the step size of the search using the Levy flight mechanism, Γ(λ) is the standard gamma function, λ=1.
5.
7. The method according to claim 1, characterized in that The performing of bidirectional sine chaotic variation processing on the optimal seagull position includes: According to the current number of iterations, the sine chaos value is determined, and the positive and negative directions are switched with equal probability, including: SinValue=sin(πx0), The optimal seagull position is subjected to a variation disturbance, including: P bs(j) (t+1)'=P bs(j) (t+1)+SinValue×P bs(j) (t+1) Where: P bs(j) (t+1) represents the optimal position P of the t+1th iteration bs The jth dimension of (t+1); Perform a greedy update, including: Where: P bs (t+1) represents the optimal position of the t+1th iteration, P bs (t+1)′ represents the optimal position after the mutation disturbance after the t+1th iteration; After the mutation disturbance is performed in each dimension, the bidirectional sine chaotic mutation processing of the optimal seagull position is stopped.
8. A path planning device based on the Seagull algorithm, characterized in that: The device comprises: An information acquisition module, used to obtain a raster map; A function determination module, used to determine the objective function of path planning according to the grid map; An initialization module, used for initializing the position of the seagull population through Gaussian mapping based on the seagull algorithm, and determining the optimal fitness value and the optimal seagull position according to the objective function; The position update module is used to improve the position update process of the seagull algorithm by using the flower pollination algorithm and the rider optimization algorithm, and determine the updated initial optimal seagull position and the initial optimal fitness value; A mutation processing module, used for performing a bidirectional sine chaotic mutation process on the optimal seagull position to determine a target seagull position and a target fitness value corresponding to the target seagull position, and comparing the initial optimal fitness value with the target optimal fitness value to determine an updated optimal seagull position; The path output module is used to output the path planning result based on the Seagull algorithm when the position update process of the Seagull algorithm meets the preset maximum number of iterations.
9. A computer device, characterized in that: The method comprises a memory and a processor, wherein the memory is connected to the processor, and the processor is used to execute one or more computer programs stored in the memory. When the processor executes the one or more computer programs, the computer device implements the method according to any one of claims 1 to 7.
10. A storage medium, characterized in that: The storage medium stores a computer program, wherein the computer program includes program instructions, and when the program instructions are executed by a processor, the processor executes the method according to any one of claims 1 to 7.
Citation Information
Patent Citations
Effective mixed feature selection method based on elite flower pollination algorithm and ReliefF
CN110110753A
Robot path planning method based on improved seagull algorithm
CN113867368A
Unmanned vehicle path planning method, device and equipment and storage medium
CN116859910A
Robot inspection global path planning method for booster station of wind power plant
CN117553821A
Automatic driving vehicle path planning method
CN117873090A
Cited By
Automatic navigation method and system for ablation
CN120093432A
Ablation automated navigation method and system
CN120093432B
Water flow path planning method and system based on improved Manhattan algorithm
CN122242903A
