Gas leakage tracing method based on mobile robot
By combining mobile robots with an improved ant colony algorithm and the DWA algorithm for gas leak tracing, the safety hazards and location difficulties of traditional manual detection have been solved, enabling rapid and accurate leak source location and improving the ability to respond to hazardous chemical accidents.
Patent Information
- Application Number
- CN202411039097.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-31
- Publication Date
- 2024-11-12
AI Technical Summary
Traditional methods of detecting gas leaks by manpower pose safety hazards and cannot quickly pinpoint the location of unknown leak sources, leading to the escalation of hazardous chemical accidents and threatening the safety of firefighters.
A mobile robot-based gas leak tracing method is adopted, which utilizes autonomous navigation and SLAM technology, combined with an improved ant colony algorithm and DWA algorithm, to perform environmental scanning and path planning. By detecting gas concentration, the source of the leak can be determined and the leak point can be quickly located.
It enables rapid and accurate location of gas leaks, improving safety and efficiency, reducing accident losses, and enhancing the robot's adaptability and practicality in complex environments.
Smart Images

Figure CN118937587A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the field of mobile robots, and in particular relates to a gas leakage tracing method based on a mobile robot. Background Art
[0002] Hazardous chemical accidents occur frequently in the chemical industry. About 70% of accidental explosions are caused by leaks. The lack of intelligent detection equipment and the limitations of rapid detection technology have led to the current situation of relying on manual investigation, which may not only lead to larger-scale accidents, but also pose a threat to the lives of firefighters.
[0003] Mobile robots with environmental perception capabilities are deployed to the site of hazardous source leakage, and they are used to scan the environment and detect the source of the leakage by detecting gas concentration and judging the location. They can quickly and accurately locate the leakage point and provide an effective solution for timely response and loss reduction. Therefore, the application of autonomous mobile robots in emergency response to hazardous material leakage is of great significance and is an effective way to improve industrial safety and protect human lives. Summary of the invention
[0004] Purpose of the invention: In order to solve the problem of potential safety hazards to personnel when hazardous chemicals leak, especially hazardous gases leak, in which the traditional method relies on manpower to detect gas concentration and determine the position to track the source of leakage, and to solve the problem that the traditional method cannot quickly determine the location of an unknown leakage source, the present invention proposes a gas leakage tracing method based on a mobile robot. Through autonomous navigation and SLAM technology, tracing motion control technology and other technologies, mobile robots with environmental perception capabilities are deployed to the hazardous source leakage site, and they are used to perform environmental scanning and detection. The source of the leakage is tracked by detecting gas concentration and determining the position, which can quickly and accurately locate the leakage point, providing an effective solution for timely response and reducing losses.
[0005] Technical solution: A gas leak tracing method based on a mobile robot, comprising the following steps:
[0006] Step 1: The mobile robot determines whether there is a corresponding simulation map for the current environment. If so, step 2 is executed; if not, a simulation map of the current environment is constructed and step 2 is executed; the simulation map obtains the obstacle distribution and gas concentration distribution through the color depth;
[0007] Step 2: Based on the simulation map, patrol path planning is performed, and patrol is performed based on the planned patrol path;
[0008] Step 3: During the inspection process, detect whether the corresponding gas exists; if so, execute step 4; if not, continue to inspect based on the planned path;
[0009] Step 4: Trace the source of the corresponding gas to obtain the location of the leakage source.
[0010] Furthermore, the corresponding gases include: methane, propane and carbon monoxide.
[0011] Furthermore, the construction of the simulation map of the current environment specifically includes:
[0012] Use Gmapping algorithm to construct a two-dimensional grid map;
[0013] Gas concentration values are quantified and marked only in barrier-free areas;
[0014] Establishing a cost function on gas concentration in the constructed two-dimensional grid map, wherein the cost function on gas concentration is used to combine gas concentration and grid state together;
[0015] Based on the cost function of gas concentration, the values of the two-dimensional grid map are converted into a color pattern through RGB to obtain a simulation map.
[0016] Furthermore, the cost function of the gas concentration is expressed as:
[0017]
[0018] In the formula, C (x,y) Indicates the gas concentration value at the coordinate (x, y); C max It indicates the maximum range of the gas sensor, and P indicates the critical value of whether there is an obstacle.
[0019] Furthermore, the patrol route planning based on the simulation map includes the following specific operations:
[0020] Adopt adaptive ant colony algorithm for global path planning;
[0021] On the basis of global path planning, the DWA algorithm is used for local planning to determine the optimal speed space of the mobile robot.
[0022] Furthermore, a heuristic algorithm based on direction information is adopted in the adaptive ant colony algorithm; the heuristic algorithm based on direction information specifically includes:
[0023] The orientation information is formed according to the positions of the starting point and the target point, and the 8 optional points in each direction are reduced to 3 optional points in each direction by using the orientation information;
[0024] The adopted heuristic function is expressed as:
[0025]
[0026] Where η(i,j)' represents the heuristic function; d sj is the distance from the starting point to the next point; d jT is the distance from the next point to the target point; g is d Sj The weight of h is d jT The weights of , g and h satisfy g + h = 1, c(i) represents the number of turns from the previous point i-1 to the next point j, and a represents the turning coefficient;
[0027] The following state transition probability model is used in the adaptive ant colony algorithm:
[0028] Assuming that ant m is at point i at time t, the position of ant m at the next time t+1 is represented by j, which is represented by the improved pseudo-random transmission rule, expressed as:
[0029] j=argmax{[τ ij (t)] α [η ij (t)] β},q≤q0
[0030] Among them, argmax(f(j)) is the function that finds the value of j that can produce the maximum value of f(j), q is the adaptive transition probability of a random variable distributed in the range [0,1], and q0 represents the threshold value of q;
[0031] The position of ant m at time t+1 will be at the position that can produce the maximum product of pheromone concentration and heuristic information visibility;
[0032] If q>q0, the probability selection rule of ant m will operate according to the traditional ant colony algorithm using the roulette wheel selection method;
[0033] The calculation formula of q0 is expressed as:
[0034]
[0035] Among them, k is the current iteration number, K is the maximum iteration number, q 0_initial is the initial value of q0.
[0036] Furthermore, the local path planning using the DWA algorithm specifically includes:
[0037] Sample multiple groups of rates in the velocity space (v,ω) of the mobile robot;
[0038] Simulate the movement trajectory of each group of rates within a certain period of time;
[0039] The motion trajectory route corresponding to the sampling rate is evaluated, and the optimal operating rate is selected for movement based on the evaluation results.
[0040] Furthermore, the speed space (v, ω) satisfies the two-dimensional speed extreme value space and the collision avoidance allowable speed range;
[0041] The two-dimensional velocity extreme value space is expressed as:
[0042] V s ={v∈v min ,v max ],ω∈[ω min ,ω max ]}
[0043] Where V s represents the two-dimensional velocity extreme value space, v represents the velocity, v min ,v max Respectively represent the minimum and maximum values of the velocity, ω represents the angular velocity, ω min ,ω max Respectively represent the minimum and maximum values of angular velocity;
[0044] The collision avoidance allowable speed range is expressed as:
[0045]
[0046] Where dist(v,ω) is the distance between the mobile robot and the nearest obstacle in the velocity space (v,ω), are the maximum deceleration and rotational deceleration respectively.
[0047] Furthermore, the evaluation of the motion trajectory corresponding to the sampling rate includes:
[0048] The following evaluation function is used to evaluate the motion trajectory corresponding to the sampling rate:
[0049]
[0050] Where Obs is the sum of the values of the motion trajectory route passing through the grid corresponding to the sampling rate, Gdist is the shortest distance from the end point to the target point of the motion trajectory route corresponding to the sampling rate, and Pdist is the length of the motion trajectory route corresponding to the sampling rate with the shortest distance. is the translation component of the sampling rate, and α, β, γ, and δ are the weights of the corresponding terms.
[0051] Furthermore, the gas is traced to its source to obtain the location of the leakage source, and the specific operations include:
[0052] Assume that the gas concentration at the current position 1 of the mobile robot is C1. The mobile robot will first move forward for n seconds to reach position 2, and then stay still for k seconds to detect the gas concentration. The gas concentration at position 2 is recorded as C2. If C2>C1, the mobile robot will continue to move forward for n seconds. Otherwise, the mobile robot will move back to position 1. n is the set forward time, and k is the set still time.
[0053] If the mobile robot returns to position 1, it turns left 90 degrees and walks forward for n seconds to reach position 3, and stays still for k seconds to detect the gas concentration. The gas concentration at position 3 is recorded as C3; if C3>C1, the mobile robot continues to walk forward for n seconds; otherwise, the mobile robot retreats back to position 1;
[0054] If the mobile robot returns to position 1 again, it turns right 90 degrees and walks forward for n seconds to reach position 4, and stays still for k seconds to detect the gas concentration. The gas concentration at position 4 is recorded as C4; if C4>C1, the mobile robot continues to walk forward for n seconds; otherwise, the mobile robot retreats back to position 1. At this time, it can be proved that the gas concentration at position 1 is the local highest point of the concentration distribution in the environment, and position 1 is considered to be the source of the leakage.
[0055] Beneficial effects: Compared with the prior art, the present invention has the following advantages:
[0056] (1) The method of the present invention introduces a new improved ant colony algorithm (MAACO), which overcomes the shortcomings of the traditional ant colony algorithm such as slow convergence and low efficiency, and has a faster convergence speed and stronger global optimal solution search capability;
[0057] (2) The method of the present invention introduces a new type of improved ant colony algorithm (MAACO), which introduces a new type of pheromone with clear direction indication, which not only speeds up the convergence process of the algorithm, but also improves the overall quality of the path;
[0058] (3) A novel improved ant colony algorithm (MAACO) introduced in the method of the present invention introduces a more effective pheromone mechanism, which makes the algorithm more direct when exploring the path, effectively reduces unnecessary turns, and thus improves the efficiency of the path;
[0059] (4) The method of the present invention introduces a new improved ant colony algorithm (MAACO), which adopts a new state transition probability model, which not only enhances the search efficiency, but also promotes the diversity within the colony and prevents stagnation in the search process;
[0060] (4) The method of the present invention adopts the DWA local path planning algorithm, which is specially designed for fast response and high dynamic environments. The algorithm predicts the feasible speed through a dynamic window to ensure that the robot can brake safely when facing emergencies and quickly adjust the path. This flexibility enables the robot to perform tasks efficiently and safely in crowded or complex commercial environments, such as shopping malls or factories, thereby enhancing the practicality and adaptability of the robot. BRIEF DESCRIPTION OF THE DRAWINGS
[0061] Figure 1 This is a flow chart of a gas leakage tracing method based on a mobile robot proposed by the present invention;
[0062] Figure 2 It is the correspondence diagram between the value of the grid map and the robot state;
[0063] Figure 3 It is a simulation diagram based on cost function design;
[0064] Figure 4 It is a simulation diagram based on cost function design;
[0065] Figure 5 are the 8 optional points of the current point in the traditional ant colony algorithm;
[0066] Figure 6 It is a schematic diagram of the heuristic mechanism based on the orientation information;
[0067] Figure 7 Run the arc graph for the robot. DETAILED DESCRIPTION
[0068] The technical solution of the present invention is now further described in conjunction with the accompanying drawings.
[0069] Embodiment 1:
[0070] like Figure 1 As shown, this embodiment discloses a gas leakage tracing method based on a mobile robot, which mainly includes the following steps:
[0071] Step 1: The mobile robot determines whether the current environment is an unknown environment. If the current environment is an unknown environment, it starts the lidar scan to scan the surrounding environment and builds a two-dimensional grid map through the Gmapping algorithm. For the mobile robot, it only needs to know three states of the grid in path planning: with obstacles (the value is 254), without obstacles (the obstacle threshold is set to 128), and unknown (the value is 0). Figure 2is the correspondence between the value of the grid map and the robot state. The gas concentration value is quantified and marked in the obstacle-free area. The robot can only move in the obstacle-free area. The cost function of gas concentration is established in the two-dimensional grid map.
[0072] Now we will further explain how to establish a cost function for gas concentration in a two-dimensional grid map. The following steps are included:
[0073] First, the gas concentration is normalized and expressed as:
[0074]
[0075] Among them, C (x,y) Indicates the gas concentration value at the coordinate (x, y); C max Indicates the maximum range of the gas sensor.
[0076] Secondly, the standard value C′(x,y) in the range of (0,1) is quantized and converted into the value in the cost map:
[0077]
[0078] Among them, P represents the critical value of whether there is an obstacle (already set to 128).
[0079] The cost function of gas concentration is expressed as:
[0080]
[0081] The cost function effectively combines gas concentration and obstacle information to form a cost map that can represent both the obstacle distribution and the gas concentration distribution. According to the change of gas concentration value, the robot is driven to move to the high gas concentration area to achieve traceability.
[0082] Through the function design of the cost map, the values of the established raster map are converted into a color pattern through RGB. The distribution of obstacles and gas concentrations in the map can be intuitively seen through the contrast of color depth in the figure.
[0083] As attached Figure 3 And attached Figure 4 As shown in the figure, it is a schematic diagram of the simulation map designed based on the cost function. Figure 3 The highlighted area is the obstacle in the room (walls, tables, chairs, etc.). Figure 4 This is a schematic diagram of the gas concentration distribution in the room. The darker the color, the higher the gas concentration value. The "+" sign indicates the source of gas leakage.
[0084] Step 2: The mobile robot uses autonomous navigation and SLAM technology to plan the path and accurately locate the area, and then conducts patrols based on the planned path. The specific operations include:
[0085] First, a new improved ant colony algorithm (MAACO) is used for global path planning. The new improved ant colony algorithm (MAACO) used in this embodiment is Used in The heuristic function is expressed as:
[0086]
[0087] Where η(i,j)' represents the heuristic function; d Sj is the distance from the starting point to the next point; d jT is the distance from the next point to the target point; g is d Sj The weight of , h is d jT The weight of g and h satisfies the formula g+h=1; c(i) represents the number of turns from the previous point i-1 to the next point j, and a represents the turning coefficient.
[0088] A new improved ant colony algorithm introduces a heuristic mechanism with directional information:
[0089] For the current point, in the traditional ant colony algorithm, if there are no obstacles around the current point, there are 8 optional points as the next point. Figure 5 As shown in the figure, the current point is represented by P, and its 8 optional points are represented by P1, P2, P3, P4, P5, P6, P7, and P8. According to the rules of the traditional ant colony algorithm, all 8 optional points are required to calculate the corresponding transition probabilities. This means that some unnecessary calculations are performed and the calculation time will be longer. In addition, the 8 optional points will cause path redundancy and increase the number of turns when searching for the path. Therefore, when selecting the next point, it is a better choice to perform directional guidance from the starting point to the target point and delete some unnecessary operations.
[0090] Aiming at the shortcomings of the traditional ant colony algorithm, a heuristic algorithm based on direction information is proposed. The orientation information is formed according to the positions of the starting point and the target point, and the 8 optional points of the current point are reduced to 3 optional points. The coordinates of the starting point S are (x S ,y S ), the coordinates of the target point T are (x T ,y T ),like Figure 6 As shown. The direction information between the starting point S and the target point T is represented by the arrow from S to T. Obviously, if the starting point is taken as the origin of the coordinate system, the direction of the arrow from S to T points to the fourth quadrant. Therefore, in order to ensure the efficiency of the search process, it is hoped that the next selected point of the current point is also along the arrow direction. Assume that the coordinates of the current point P are (xc ,y c ), the coordinates of the next point Pn are (x d ,y d ). According to the new heuristic mechanism with directional information, the vector from P to Pn should point to the fourth quadrant. That is, x d-c =x d -x c The value of y is not less than 0, d-c =y d -y c The value of is not greater than 0. According to this rule, 5 of the above 8 points (P4, P5, P6, P7, P8) cannot meet the requirements, leaving only 3 optional points, such as Figure 6 Likewise, if the arrow from S to T points into the first quadrant, then x d-c and d-c The value of should be greater than 0 and equal to 0. There are two more cases: when the arrow points to the second quadrant, x d-c The value of y is not greater than 0, d-c The value of is not less than 0; if the arrow points to the third quadrant, then x d-c and d-c The value should not be greater than 0.
[0091] Since the number of next optional points is reduced, the algorithm has directional intelligence, which is beneficial to reduce the computational complexity and time. On the other hand, the heuristic mechanism based on directional information has the ability to avoid blind search and path redundancy.
[0092] A new state transition probability model is adopted in the new improved ant colony algorithm:
[0093] Assuming that ant m is at point i at time t, the position of ant m at the next time t+1 is represented by j, which can be represented by the improved pseudo-random transmission rule, as shown in the formula:
[0094] j=argmax{[τ ij (t)] α [η ij (t)] β},q≤q0
[0095] Where argmax(f(j)) is a function that finds the value of j that can produce the maximum value of f(j), q is the adaptive transition probability of a random variable distributed in the range [0,1], and q0 represents the threshold of q. According to the above formula, the position of ant m at time t+1 will be located at the position that can produce the maximum product of pheromone concentration and heuristic information visibility. Obviously, this method belongs to the deterministic selection mode, which is conducive to improving the convergence speed. On the other hand, if q>q0, the probability selection rule of ant m will operate according to the traditional ant colony algorithm using the roulette wheel selection method.
[0096] In fact, the value of q0 determines the probability of which mode is selected (deterministic selection mode or random selection mode). Therefore, q0 has a significant impact on the convergence speed and global search ability. If the value of q0 is large, the selection of the next point is more likely to be a deterministic mode. In this case, it can speed up the convergence speed. However, the global search ability will be reduced. If the value of q0 is small, the shift of the path tends to be a random mode, which will increase the randomness of path selection and further improve the ability of global search.
[0097] Therefore, it is necessary to propose a rule for setting the q0 value to balance the deterministic mode and the random mode. Therefore, an adaptive adjustment mechanism of q0 is introduced to improve the state transition probability rule. The proposed q0 calculation formula is shown below:
[0098]
[0099] Among them, k is the current iteration number, K is the maximum iteration number, q 0_initial is the initial value of q0. A larger q0 value will be generated in the early stage of iteration. Therefore, the algorithm can effectively search for the optimal path with a faster convergence speed. The value of q0 becomes smaller as the number of iterations increases, which enhances the diversity of the population and improves the global search ability of the algorithm.
[0100] Then, the DWA algorithm is used for local path planning, which is mainly divided into three steps: first, sampling multiple groups of rates in the mobile robot speed space (v, ω). Second, simulating the motion trajectory routes completed by each group of rates within a certain period of time. Third, evaluating the motion trajectory routes corresponding to the sampled rates, and selecting the optimal operating rate for movement based on the evaluation results.
[0101] The motion trajectory of the mobile robot in the DWA algorithm is a series of arcs, so a two-dimensional velocity extreme value space is generated:
[0102] V s ={v∈[v min ,v max ],ω∈[ω min ,ω max ]}
[0103] Where V s represents the two-dimensional velocity extreme value space, v represents the velocity, v min ,v max Respectively represent the minimum and maximum values of the velocity, ω represents the angular velocity, ω min ,ω max Represent the minimum and maximum angular velocity respectively.
[0104] Obstacles in the environment can also limit the linear and rotational speeds of the mobile robot. Figure 7 As shown, let dist(v,ω) be the distance between the mobile robot and the nearest obstacle on the velocity arc (v,ω), is the maximum deceleration and rotational deceleration, then the permissible speed range to avoid collision is:
[0105]
[0106] V a The constraint allows the robot to avoid collision with the nearest obstacle.
[0107] When evaluating the motion trajectory corresponding to the sampling rate, the evaluation function used is:
[0108]
[0109] Where Obs is the sum of the values of the motion trajectory route passing through the grid corresponding to the sampling rate; Gdist is the shortest distance from the end point to the target point of the motion trajectory route corresponding to the sampling rate; Pdist is the length of the motion trajectory route corresponding to the sampling rate with the shortest distance. is the translation component of the sampling rate. α, β, γ and δ are the weights of the corresponding terms.
[0110] Step 3: During the inspection process, use highly sensitive gas sensors to detect multiple gases, such as methane, propane, carbon monoxide, etc., and collect and analyze gas concentration data, so that the robot can determine the location and extent of the leak; when the gas sensor detects the corresponding gas, execute step 4; otherwise, continue the inspection.
[0111] Step 4: Gas source tracing through Bang-Bang control strategy, including:
[0112] In order to allow the mobile robot to autonomously perform the tracking and searching task dominated by gas concentration, this embodiment adopts an implementation method based on the Bang-Bang control strategy. When performing the gas detection task in the environment, the mobile robot will adopt a systematic detection process. The specific detection and path algorithm is as follows:
[0113] S4_1: Assume that the gas concentration at the current position 1 of the mobile robot is C1. The mobile robot will first move forward for 2 seconds to position 2, and then stay still for 30 seconds to detect the gas concentration. At this time, the gas concentration is C2. If C2>C1, the mobile robot will continue to move forward. Otherwise, the mobile robot will move back to position 1.
[0114] S4_2: If the mobile robot returns to position 1, the mobile robot turns left 90 degrees and walks forward for 2 seconds to position 3, and stays still for 30 seconds to detect the gas concentration. At this time, the gas concentration is C3; if C3>C1, the mobile robot will continue to move forward; otherwise, the mobile robot will continue to retreat to position 1.
[0115] S4_3: If the mobile robot returns to position 1 again, the mobile robot turns right 90 degrees and walks forward for 2 seconds to position 4, and stays still for 30 seconds to detect the gas concentration. At this time, the gas concentration is C4; if C4>C1, the mobile robot will continue to walk forward; otherwise, the mobile robot will continue to retreat to position 1, which proves that the gas concentration at position 1 is the local highest point of the concentration distribution in the environment, and position 1 can be considered as the leakage source.
[0116] Step 5: Upload the location of the leak source. In this step, a wireless communication module can be equipped to transmit data in real time, which is convenient for remote monitoring and management.
[0117] The gas leakage tracing method proposed in this embodiment enables the mobile robot to patrol autonomously in a complex environment and monitor the changes in gas concentration in real time. Once a leak is detected, the tracking program is immediately started to accurately find the source of the leak, and the alarm information is transmitted to the control center in real time through the wireless communication module.
Claims
1. A gas leakage tracing method based on a mobile robot, characterized in that: The following steps are involved: Step 1: The mobile robot determines whether there is a corresponding simulation map for the current environment. If so, step 2 is executed; if not, a simulation map of the current environment is constructed and step 2 is executed; the simulation map obtains the obstacle distribution and gas concentration distribution through the color depth; Step 2: Based on the simulation map, patrol path planning is performed, and patrol is performed based on the planned patrol path; Step 3: During the inspection process, detect whether the corresponding gas exists; if so, execute step 4; if not, continue to inspect based on the planned path; Step 4: Trace the source of the corresponding gas to obtain the location of the leakage source.
2. A gas leakage tracing method based on a mobile robot according to claim 1, characterized in that: The corresponding gases include: methane, propane and carbon monoxide.
3. A gas leakage tracing method based on a mobile robot according to claim 1, characterized in that: The construction of the simulation map of the current environment specifically includes: Use Gmapping algorithm to construct a two-dimensional grid map; Gas concentration values are quantified and marked only in barrier-free areas; Establishing a cost function on gas concentration in the constructed two-dimensional grid map, wherein the cost function on gas concentration is used to combine gas concentration and grid state; Based on the cost function of gas concentration, the values of the two-dimensional grid map are converted into a color pattern through RGB to obtain a simulation map.
4. A gas leakage tracing method based on a mobile robot according to claim 3, characterized in that: The cost function of gas concentration is expressed as: In the formula, C (x,y) Indicates the gas concentration value at the coordinate (x, y); C max It indicates the maximum range of the gas sensor, and P indicates the critical value of whether there is an obstacle.
5. The method for tracing the source of a gas leak based on a mobile robot according to claim 1, characterized in that: The patrol route planning based on the simulation map includes the following specific operations: Adopt adaptive ant colony algorithm for global path planning; On the basis of global path planning, the DWA algorithm is used for local planning to determine the optimal speed space of the mobile robot.
6. A gas leakage tracing method based on a mobile robot according to claim 5, characterized in that: In the adaptive ant colony algorithm, a heuristic algorithm based on direction information is adopted; the heuristic algorithm based on direction information specifically includes: The orientation information is formed according to the positions of the starting point and the target point, and the 8 optional points in each direction are reduced to 3 optional points in each direction by using the orientation information; The adopted heuristic function is expressed as: Where η(i,j)' represents the heuristic function; d Sj is the distance from the starting point to the next point; d jT is the distance from the next point to the target point; g is d Sj The weight of h is d jT The weights of , g and h satisfy g + h = 1, c(i) represents the number of turns from the previous point i-1 to the next point j, and a represents the turning coefficient; The following state transition probability model is used in the adaptive ant colony algorithm: Assuming that ant m is at point i at time t, the position of ant m at the next time t+1 is represented by j, which is represented by the improved pseudo-random transmission rule, expressed as: j=argmax{[τ ij (t)] α [or ij (t)] β },q≤q0 Among them, argmax(f(j)) is the function that finds the value of j that can produce the maximum value of f(j), q is the adaptive transition probability of a random variable distributed in the range [0,1], and q0 represents the threshold value of q; The position of ant m at time t+1 will be at the position that can produce the maximum product of pheromone concentration and heuristic information visibility; If q>q0, the probability selection rule of ant m will operate according to the traditional ant colony algorithm using the roulette wheel selection method; The calculation formula of q0 is expressed as: Among them, k is the current iteration number, K is the maximum iteration number, q 0_initial is the initial value of q0.
7. A gas leakage tracing method based on a mobile robot according to claim 5, characterized in that: The local path planning using the DWA algorithm specifically includes: Sample multiple groups of rates in the velocity space (v,ω) of the mobile robot; Simulate the movement trajectory of each group of rates within a certain period of time; The motion trajectory route corresponding to the sampling rate is evaluated, and the optimal operating rate is selected for movement based on the evaluation results.
8. A gas leakage tracing method based on a mobile robot according to claim 7, characterized in that: The speed space (v, ω) satisfies the two-dimensional speed extreme value space and the collision-avoiding allowable speed range; The two-dimensional velocity extreme value space is expressed as: V s ={v∈[v min ,v max ],ω∈[ω min ,ω max ]} Where V s represents the two-dimensional velocity extreme value space, v represents the velocity, v min ,v max Respectively represent the minimum and maximum values of the velocity, ω represents the angular velocity, ω min ,ω max Respectively represent the minimum and maximum values of angular velocity; The collision avoidance allowable speed range is expressed as: Where dist(v,ω) is the distance between the mobile robot and the nearest obstacle in the velocity space (v,ω), are the maximum deceleration and rotational deceleration respectively.
9. A gas leakage tracing method based on a mobile robot according to claim 7, characterized in that: The specific operations of evaluating the motion trajectory corresponding to the sampling rate include: The following evaluation function is used to evaluate the motion trajectory corresponding to the sampling rate: Where Obs is the sum of the values of the motion trajectory route passing through the grid corresponding to the sampling rate, Gdist is the shortest distance from the end point to the target point of the motion trajectory route corresponding to the sampling rate, and Pdist is the length of the motion trajectory route corresponding to the sampling rate with the shortest distance. is the translation component of the sampling rate, and α, β, γ, and δ are the weights of the corresponding terms.
10. A gas leakage tracing method based on a mobile robot according to claim 6, characterized in that: The aforementioned tracing of the source of the corresponding gas to obtain the location of the leakage source includes: Assume that the gas concentration at the current position 1 of the mobile robot is C1. The mobile robot will first move forward for n seconds to reach position 2, and then stay still for k seconds to detect the gas concentration. The gas concentration at position 2 is recorded as C2. If C2>C1, the mobile robot will continue to move forward for n seconds. Otherwise, the mobile robot will move back to position 1. n is the set forward time, and k is the set still time. If the mobile robot returns to position 1, it turns left 90 degrees and walks forward for n seconds to reach position 3, and stays still for k seconds to detect the gas concentration. The gas concentration at position 3 is recorded as C3; if C3>C1, the mobile robot continues to walk forward for n seconds; otherwise, the mobile robot retreats back to position 1; If the mobile robot returns to position 1 again, it turns right 90 degrees and walks forward for n seconds to reach position 4, and stays still for k seconds to detect the gas concentration. The gas concentration at position 4 is recorded as C4; if C4>C1, the mobile robot continues to walk forward for n seconds; otherwise, the mobile robot retreats back to position 1. At this time, it can be proved that the gas concentration at position 1 is the local highest point of the concentration distribution in the environment, and position 1 is considered to be the source of the leakage.
