Abstract
When planning the soccer robot path at present, a two-dimensional map is used mainly to optimize the path of the soccer robot's operating field. However, because the two-dimensional robot is selected, which can only utilize the data of plane about a specific environment, the data information of the mobile soccer robot cannot be gathered, impacting greatly the completion of the plan of the robot path. The path planning of the soccer robot is conducted using the quantum genetic algorithm so that the problem can be dealt with. On the premise that there is a lack of full consideration of the accurate motion path between the two points, the inertia weight is dynamically adjusted to overcome the disadvantage of premature convergence of the traditional quantum group algorithm, which can make the weight of the quantum genetic algorithm controllable with adaptability so that the problem of the extremely slow convergence speed of a single quantum in the quantum group and the high group dispersion can be solved. Furthermore, the selected quantum genetic algorithm can realize the real-time update of the soccer robot's position, effectively increase the trajectory change of the particle swarm movement, and to a certain extent effectively increase the search ability and convergence effect of the particle swarm in the global scope, so as to ensure that this algorithm can be more effective than the traditional path planning algorithm in terms of global search ability and convergence speed in the path planning of the soccer robot and has a higher use value.
1. Introduction
Soccer robot is one of the hotspots in the current international robotics research field [1–3]. Soccer robot is a mobile machine that simulates athletes for training. Therefore, the best, fastest, and collision-free path planning to efficiently avoid obstacles in the moving process becomes the bottleneck of manual control in the movement process [4–7]. At present, domestic and foreign researchers have effectively combined particle swarm algorithm, neural network algorithm, quantum theory, genetic algorithm, and other algorithms and used them in large-scale robot path planning. The theoretical research status of the soccer robot path is slowly turning to the path of group optimization calculation. Its quantum genetic algorithm is a new type of group optimization calculation method. The features of the objective function are not standardized with this method, the excellent optimization function cannot be completed easily along with it, and it has gradually become an important goal of robot intelligent control optimization research in China and other countries. The use of the quantum genetic algorithm to calculate soccer robots makes planning easier and the calculation method simpler, but the search function has a large dependence on parameters, which will cause some problems of small results. Regarding how to improve the results of quantum particle groups to be more accurate and comprehensive, many researchers have reformed and optimized quantum group calculation methods. Since the computer technology and Internet technology have developed continuously, people's research on robots has become multifaceted and intelligent. In many occasions of daily life and industrial processing and production, people maximize the use of robots in order to obtain maximum economic benefits. In this circumstance, traditional methods for soccer robot path planning will not be able to meet the functional requirements. Therefore, it is more important to apply the quantum genetic algorithm to fuzzy control path planning for soccer robot to navigate its motion in indoor environment.
The quantum group computing method mostly relies on the global value to transmit information, which is faster and more accurate than other computing methods. The disadvantage is that it will end earlier. Regarding this shortcoming, this paper finds the main algorithm of the study, the quantum genetic algorithm, which uses the single quantum optimization progress and the overall dispersed dynamic motion proportion, so that the inertia proportion contains control characteristics and adaptive characteristics. This algorithm can quickly improve the convergence progress of the calculation, maintain the characteristics of different groups, enhance the comprehensive search advantage of the calculation, and so on. Finally, according to the calculation methods proposed in this paper, it is applied to the trajectory planning of soccer robots. Through comparison with the common calculation methods, the analysis of the experimental results is performed, the result of which shows that the quantum genetic algorithm proposed in this paper is more effective than the traditional one in the path planning of the soccer robot [8–15].
2. Quantum Genetic Algorithm
If the optimization of the genetic algorithm is realized in accordance with the characteristics of the quantum particle swarm, the path planning is not required to convert the speed in the search process. Therefore, the calculation process of the quantum genetic algorithm is simpler, and fewer reference objects exist for comparison, which can be easily managed. The comparison with traditional algorithms shows that both the convergence speed and search ability of the quantum genetic algorithm are more significant.
After the optimization of the quantum genetic algorithm, the calculation formula is as follows:
According to the above expression, the ith quantum particle can be represented by expression at t; the optimal position of each particle is expressed by ; the optimal position of the whole process is represented by ; the mean value corresponding to the optimal position is represented by the position and number of the quantum particle group and the number of iterations are represented by D, N, and M; ; represents the expansion and contraction amount; represent the convergence factor; and represent the average number of particles dispersed.
In the process of genetic algorithm optimization calculation, it is very important to realize the effective control of its parameters. According to the evolutionary formulas (1) and (3), the convergence characteristics of the quantum genetic algorithm calculation method can be improved. According to formula (2) of the quantum , it can be converted into the following formula:
Based on (1) and (4), the conversion quantum and overall optimal relation are specially related to the itch gap between the quantum optimal relation at that time, and the relationship that exists between and the corresponding quantum mean is related to the error value at position .
When selecting parameters, the calculation method in this paper uses the individual quantum optimization speed and the inertia proportion of the overall separation, so that the inertia proportion contains the self-adaptive aggregation degree, which can effectively avoid the problem of premature convergence of genetic particles in the process of global search, and at the same time, a random selection algorithm can be used to ensure the quantum motion to the optimal position. In order to effectively ensure the diversification and stability of the particle swarm motion, the convergence capacity of the genetic algorithm can be effectively promoted based on the enhancement of the global search capacity of the particle swarm.
Definition 1. The optimization speed of the quantum particle swarm can use the function Fitness Gbest(t) to represent the overall motion characteristics of the particle swarm, and use the function Fitness Pi(t) to represent the optimal characteristics of the current particle swarm, and then the expression for particle swarm optimization can be obtained as follows:When the minimum value of the particle swarm satisfies , if the ip value is reduced, the speed of this movement will gradually increase. If ip = 1, the quantum genetic algorithm can be used to obtain the optimal value.
Definition 2. The dispersion degree of the particle swarm can ensure that the quantum particle swarm used can find the optimal gap represented by , and using this expression, the quantum swarm dispersion can be obtained as follows:According to the above expression, gs can represent the progress of particle discrete optimization. If the value of gs changes, the quantum discrete optimization progress will be accelerated, and due to the difference in the size of the quantum population, the speed will be reduced. If gs = 1 is satisfied, then the obtained optimal value Pbest is inconsistent with the current value, which will cause the value of gs to change continuously.
3. Fuzzy Control Path Planning of Soccer Robot
Aiming at solving the problems of traditional genetic algorithm in robot path planning, neuro-fuzzy controller is used to adjust the solution to the local minimum point problem in quantum genetic algorithm, so as to improve the real-time performance and effectiveness of robot dynamic planning in the process of fuzzy control. The fuzzy control variable can be represented by a ternary array , and its membership function is as follows:
Assuming the fuzzy control path planning and according to the expansion principle of fuzzy control retrieval number addition and scalar multiplication, we can obtain the following:
That is, the sum of the fuzzy control path planning is still the fuzzy control path planning, and
Based on , we can obtain the following:
Assuming , , be the fuzzy control path planning, we obtain the nonnegative linear combination of and the fuzzy control path planning:
It is still fuzzy control path planning, and
As for the fuzzy control path planning environment, the opportunity is understood as the possibility that the establishment of the constraints is conducted. The fuzzy control path planning is made use of to effectively solve the optimization problem of the path planning parameters of the robot.
The double circular arc curve equation is used to calculate the dynamic change of the motion curve based on the fuzzy control parameter α during the motion of the soccer robot. The parameters α and β are used as the variables of the fuzzy control (Figure 1).
In the quantum swarm algorithm, quantum represents the motion path of the soccer robot. In this paper, N motion trajectories are set, and the quantum dimension D represents the number of paths from the starting point to the end point. The process of the path planning of the soccer robot can be represented as the planning process of obtaining the optimal angle value under each path planning.
Due to the movement scene of the soccer robot, this paper selects the grid algorithm to optimize the constructed robot path planning model. The selected grid method selects the motion path of the soccer robot for grids with the same size. Both the polar coordinates and rectangular coordinates can be used to display the motion scene of soccer robot for path planning. The length of polar coordinate represents the straight-line distance from the initial motion position to the stop position of the soccer robot, and the angle represents the motion trajectory of the soccer robot within the range of motion. The grid specifications need to be set reasonably according to the motion range of the soccer robot and the specifications of the obstacles. Both the polar coordinates and rectangular coordinates are combined to represent the detection of the relationship as shown in Figure 2.
Suppose that the parameter values of the quantum particle swarm are set: D represents the quantum motion dimension; M represents the maximum number of iterations of the particle; N represents the quantum swarm; learning factors are C1 and C2; and the expansion-contraction coefficient is α. The dimension of the quantum group motion can be calculated as follows:
In the expression, distance path is used to calculate the straight-line distance from the initial point to the end point, and lengthrobot represents the height of the soccer robot.
The establishment straight-line distance from the initial point to the end point of the soccer robot is the determining factor for the length of the polar coordinates. The range of detection angle used is [0, π/2]; then, the expression can be used as follows:
In the above formula, β = arccos(Ltarget/ρi), and αtop and αdown, respectively, represent the maximum and minimum values that the soccer robot can reach in the range of motion; the constraints that need to be satisfied are as follows:
The distribution of the quantum group settings is relatively uniform, and the search position and movement speed are represented as follows:
The calculation process of the fuzzy control path planning algorithm proposed in this paper is shown in Figure 3, according to which G = (S, E) represents the grid map of the robot in the plane, S represents the grid corresponding to the motion position of the soccer robot, and E represents the reachable boundary of the motion position. The function represents the raster grid within the motion area. If the first grid and the target grid of soccer robot motion satisfies (}, the fuzzy control path planning algorithm used in this paper can be applied to the function (s) for calculating the consumption of s from the initial position to each motion position, and the optimal motion path can be obtained.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
The real-time position of the soccer robot on the field is represented by h(s), and the initial speed is set to 0. If the grid where the robot is located can pass smoothly, the obtained data information cannot be determined for the soccer robot. If is satisfied, then S can be represented by CLOSED when it is not necessary to complete this barrier setting. The full grid of robot motion is represented by and can be represented in this way by the function g(s) and the value . In the detection, if the no grid s is apparent in the CLOSED sequence, then in the motion sequence, the OPEN sequence can use the k(s) function to search according to the grid where the soccer robot is set.
Before formulating the plan of the path of the soccer robot on the field, a model of the field environment needs to be built, mainly to ensure that the soccer robot is familiar with the field environment. By dividing the field position where the soccer robot is located into several grids, the abstract description is carried out according to the grid of the field.
The total length of the field is represented by m, and the width is represented by n. Taking the upper left corner of the field as the origin, and setting the grid coordinates of the upper left corner as (0, 0), the Cartesian coordinate system of the soccer robot movement is constructed. If the boundary of the field is represented by a, the size of a can be regarded as a soccer robot motion cell grid, and the number of grids of the field can be represented by the grid number ceil(m/a) of different columns, where ceil represents the upward movement direction of the soccer robot.
In the fuzzy control path planning, the motion path can be converted according to the algorithm, and the mapping relationship between the soccer robot and the field can be represented as follows:
Figure 4 is a schematic diagram of simulating the local movement of the soccer robot on the field.
By setting the controller parameters according to Table 1, the layer-by-layer control steps of the system are calculated as follows:(1)Fuzzification layer: The input variables of the fuzzy control system (the displacement between the robot and the obstacle and the relative movement between the two to form the angle θ, the relative velocity ΔV) can be fuzzified, and the node i has an output function: In the formula, the fuzzy sets Ai, Bi, and Ci are planned as shown in Table 1, and the D2 with the universe of discourse of (0, 2), θ with the universe of discourse of (−π, π), and the ΔV with the universe of discourse of (−1, 1) are divided into (ZD, SD, MD, FD), (NH, NB, NM, NS, Z, PS, PM, PB), and (NB, NM, NS, Z, PS, PM, PB), respectively. is the membership function value of Ai and Bi. Selecting (), (), and () are used as the membership function to calculate the corresponding maximum value of 1 and minimum value of 0. Then, In the formula, m, p, and q are the antecedent parameters, and the shape of the membership function changes with the change of these three parameters.(2)Operation layer (fuzzy inference layer): Perform operation on the input signal. The output of each node represents the credibility of the rule, and its output is as shown in the following formulas:
The control rules represented by (22) and (23) are listed in Tables 2 and 3.(3)Normalization layer: The ith node calculates the normalized credibility of the ith rule:(4)Conclusion layer: The output contained in the ith node is as follows: In the formula, is the output of the third layer, and x, y, and z are the consequent parameters.(5)Deblurring layer: This layer calculates the total output:
Among them, the universes of discourse of K2 and β are both (1, 100).
4. Result and Analysis of Simulation
In practical application, the two-wheeled soccer robot is taken as the research target in order to test the effect of the algorithm in this paper. Among control parameters, the set parameter values of the wheeled soccer robot are shown in Table 4. The number of experiments is set to 100, and the path planning results obtained from the test are shown in Figure 5.
According to the experimental results in Figure 5, the result of the soccer robot path planning according to the quantum genetic algorithm is better than that of the traditional genetic algorithm. The length of the planned path is 4.0253 m upon the measurement, while the motion path length of the soccer robot under the traditional genetic algorithm is 4.3813 m. The main reason is that the traditional one is prone to plunge into the local optimum in the process of searching for the path, but the optimal path can be obtained by applying the quantum genetic algorithm to the global search of the soccer robot.
Based on the test results of experiments in Figures 6 and 7, the soccer robot can obtain the local optimal value after 149 iterations under both the traditional genetic algorithm and the quantum one. However, the quantum genetic algorithm used in this paper can be far beyond the local optimal value after 200 iterations and search for the global optimal path after about 250 iterative adjustments, but the soccer robot is still involved in the local optimal path under the traditional genetic algorithm. According to the above-mentioned explanation, the quantum genetic algorithm proposed in this paper is better than the traditional genetic algorithm in the global convergence speed.
The Bi application is on the basis of selecting an automated stereo field and building a rasterized environment of field as shown in Figure 8.
The warehousing environment after being rasterized is as shown in Figure 8, which is composed of a total of 23 parts in the size classification station on the left side of the field. Following the path formed by the next-door protective casing, only one soccer robot can pass through all paths, that is, a single passenger ticket. A lot of selection work by sifting is completed in the field by soccer robot at the speed of 1 m/s.
The performance of quantum genetic algorithm significantly affects the result of fuzzy control path planning of soccer robot, which is testified in this section. Figure 9 shows the changing process of the individual fitness of each generation according to the number of evolutionary generation when using the quantum genetic algorithm. Figure 9 shows the concentrated points representing the mean fitness values of each generation, and the points which are comparatively dispersed nearby represent the optimal fitness values of each generation, wherein the optimal fitness values of each generation match the mean fitness value of the generation.
The experimental results in Figure 9 show that the quantum genetic algorithm used in this paper can effectively be used to improve the convergence speed of the soccer robot and most quantum groups can quickly find the global optimal solution. In the initial process of the quantum genetic algorithm, if the individual expected value difference is too large, the particle swarm can be quickly optimized during the processing. In the later particle iteration process, if the particle swarm is similar to the optimal solution, the obtained optimal path is closer to the real situation and avoids the emergence of local optimal solutions.
5. Conclusion
During the process of soccer robot path planning, choosing a reasonable and scientific path has gradually become the key goal of current research. In this paper, quantum genetic algorithm and adaptive neuro-fuzzy artificial potential field are used to plan and study the fuzzy control route of soccer robot and plan the soccer robot's mobile path. The selected plane grid map can realize the calculation of the movement range of the soccer robot and can test the collision phenomenon in the robot movement process, so as to avoid the deadlock phenomenon of the robot. The trap prediction mechanism is added, so that the robot can overcome the limitation of the sensor measurement range to a certain extent and can conduct relevant analysis of spatial feasibility more quickly. The purpose is to provide support for the generation of fuzzy rules when dealing with the establishment of a fuzzy system and to facilitate the planning of the optimal path of the soccer robot. The robot simulation results show that the soccer robot can effectively assist people in heavy and repetitive mechanical work on the field, and using it in the field can effectively improve the management level of the field and save labor costs. The experimental results verify that the algorithm in this paper can perform optimal path planning.
Data Availability
The data used to support the findings of this study are available from the author upon request.
Conflicts of Interest
The author declares no conflicts of interest.