Map generation method, robot, storage medium, device and program product

By identifying and adaptively filling invalid reflection points in complex environments, and combining this with sliding window processing, a high-quality global map is generated. This solves the problems of noise and thickened obstacles in map generation, and improves the accuracy and efficiency of robot navigation.

CN118915766APending Publication Date: 2024-11-08ZHEJIANG ZHIDING ROBOT CO LTD
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411062024.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-02
Publication Date
2024-11-08

AI Technical Summary

Technical Problem

In complex environments, existing robot navigation technologies generate maps of low quality, which are prone to noise and thickened obstacles, leading to increased post-processing requirements.

Method used

By projecting the initial pose of the target laser frame onto a local map, invalid points are identified and matched, and passable areas are calculated. Combined with sliding window processing and adaptive filling of invalid reflection points, a high-quality global map is generated.

Benefits of technology

It improves the accuracy and efficiency of map generation, reduces the need for post-processing, and is suitable for robot navigation in complex environments such as narrow, open, and bumpy areas.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118915766A_ABST
    Figure CN118915766A_ABST
Patent Text Reader

Abstract

The invention provides a map generation method, a robot, a storage medium, equipment and a program product, and the method comprises the steps: projecting a target laser frame into a first local map through employing an initial pose corresponding to the target laser frame, so as to calculate a local pose of the target laser frame in the first local map; processing the first local map by using the target laser frame and the laser frames after the target laser frame to obtain a second local map; projecting the target laser frame into a second local map by using the local pose of the target laser frame in the first local map so as to determine at least one matching invalid point in the target laser frame; and calculating a passable area based on the matched invalid points in the target laser frame to generate a global map of the target area. According to the method, the laser data in a complex environment can be adaptively processed, matching invalid points in the laser frame can be effectively utilized, the method is only used for generating the passable area, the situation that the contour of an obstacle becomes thick is reduced, and a high-quality global map is provided.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of robot positioning algorithms, and in particular to map generation methods, robots, storage media, devices and program products. Background Art

[0002] Currently, in areas such as commercial cleaning, industrial logistics, and commercial food delivery, mobile robot navigation requires building a map of the activity scene first. Related robot navigation technologies use artificial features, such as reflective column navigation and QR code navigation. However, these features need to be constructed in advance and have high maintenance costs in the later stage. For this reason, contour navigation can be used as an alternative.

[0003] Before using contour navigation, it is necessary to build a high-quality contour map. However, in complex environments such as narrow, open, and bumpy, the generated map quality is not high.

[0004] Based on this, the present application provides a map generation method, a robot, a storage medium, a device and a program product to improve the relevant technology. Summary of the invention

[0005] The purpose of this application is to provide a map generation method, a robot, a storage medium, a device and a program product to generate high-quality maps in complex environments.

[0006] The purpose of this application is achieved by the following technical solutions:

[0007] In a first aspect, the present application provides a map generation method, which is applied to a robot working in a target area, and the method comprises:

[0008] Using the initial pose corresponding to the target laser frame, the target laser frame is projected into the first local map to calculate the local pose of the target laser frame in the first local map; the laser frame is obtained by scanning using the corresponding laser sensor of the robot;

[0009] Processing the first local map using the target laser frame and subsequent laser frames to obtain a second local map;

[0010] Using the local pose of the target laser frame in the first local map, the target laser frame is projected into the second local map to determine at least one invalid matching point in the target laser frame; the invalid matching point is a laser point in the target laser frame that does not meet the target matching condition;

[0011] A traversable area is calculated based on the matched invalid points in the target laser frame to generate a global map of the target area.

[0012] In some embodiments, before projecting the target laser frame into the first local map using the initial pose corresponding to the target laser frame, the method further includes:

[0013] Counting continuous reflection invalid points in the target laser frame to obtain one or more reflection invalid point sets; the reflection invalid points are laser points in the target laser frame that do not meet the target reflection condition;

[0014] Determine one of the two effective reflection points adjacent to the set of invalid reflection points as a target effective reflection point; the effective reflection point is a laser point in the target laser frame that satisfies the target reflection condition;

[0015] According to the numerical relationship between the ranging value of the target reflection valid point of the reflection invalid point set and the target ranging value, the ranging value of at least one of the reflection invalid points is filled so that the filled target laser frame is projected into the first local map.

[0016] In some embodiments, the step of determining one of two effective reflection points adjacent to the set of invalid reflection points as a target effective reflection point comprises:

[0017] For two reflection effective points adjacent to the reflection invalid point set, the differences between the ranging values ​​of the two reflection effective points and the target ranging value are calculated respectively, and the reflection effective point corresponding to the smaller difference is determined as the target reflection effective point of the reflection invalid point set.

[0018] In some embodiments, filling the ranging value of at least one of the reflection invalid points according to the numerical relationship between the ranging value of the target reflection valid point of the reflection invalid point set and the target ranging value comprises:

[0019] In the case where the distance measurement value of the target reflection valid point is greater than the target distance measurement value, the target distance measurement value is used to fill the distance measurement value of at least one of the reflection invalid points; or

[0020] In a case where the distance measurement value of the target reflection effective point is not greater than the target distance measurement value, the distance measurement value of at least one of the reflection invalid points is filled with the distance measurement value of the target reflection effective point.

[0021] In some embodiments, the process of processing the first local map using the target laser frame and subsequent laser frames includes:

[0022] In the first local map, determining undetermined obstacle points corresponding to the target laser frame and the laser frames thereafter;

[0023] Count the number of times at least one undetermined obstacle point is occupied;

[0024] When the occupation number of the undetermined obstacle point is greater than the target number, the undetermined obstacle point is determined as an obstacle point.

[0025] In some embodiments, the processing the first local map using the target laser frame and the subsequent laser frames to obtain the second local map includes: storing the target laser frame and N subsequent laser frames in a sliding window, and processing the first local map using the target laser frame and N subsequent laser frames in the sliding window to obtain the second local map; N is a positive integer;

[0026] The method further includes: before storing the N+1th laser frame after the target laser frame in the sliding window, taking out the target laser frame.

[0027] In some embodiments, the process of calculating the traversable area based on the matching invalid points in the target laser frame includes:

[0028] For at least one invalid matching point in the target laser frame, the number of penetrations of the grid between the invalid matching point and the laser origin is increased by one, but no operation is performed on the number of occupancy of the grid where the invalid matching point is located;

[0029] A passable area in the global map is determined according to the number of occupancy and penetration of the grid in the global map.

[0030] In some embodiments, the target area has one or more environmental characteristics of narrow, open, and bumpy.

[0031] In a second aspect, the present application provides a robot comprising a control module and a laser sensor, wherein the control module is used to execute any of the above methods to generate a global map of a target area; and the laser sensor is used to scan and obtain a laser frame.

[0032] In a third aspect, the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program implements any of the above methods when executed by a processor.

[0033] In a fourth aspect, the present application provides a computer device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements any one of the above methods when executing the computer program.

[0034] In a fifth aspect, the present application provides a computer program product, wherein the computer program product comprises a computer program, and the computer program implements any one of the above methods when executed by a processor.

[0035] The present application provides a map generation method, a robot, a storage medium, a device and a program product, which utilizes the initial pose of a target laser frame and projects it into a first local map, and calculates the local pose of the target laser frame in the first local map. Next, the first local map is processed using the target laser frame and the laser frames thereafter to obtain a second local map. Then, based on the local pose of the target laser frame, it is projected into the second local map, and the invalid matching points in the target laser frame are identified, which may be caused by a complex environment. Afterwards, in the process of generating a global map, the invalid matching points are used to calculate the passable area. The present application can adaptively process laser data in a complex environment, and can effectively utilize the invalid matching points in the laser frame, which are only used to generate passable areas, thereby reducing the thickening of the obstacle contour, improving the accuracy of map generation, and providing a high-quality global map. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] The present application is further described below in conjunction with the accompanying drawings and specific implementation methods.

[0037] Figure 1 It is a flowchart of a map generation method provided in an embodiment of the present application.

[0038] Figure 2 It is a schematic diagram of filling the ranging value of the reflection invalid point provided by an embodiment of the present application.

[0039] Figure 3 It is a schematic diagram of a laser origin, an obstacle and a ground point provided in an embodiment of the present application.

[0040] Figure 4 It is a structural block diagram of a robot provided in an embodiment of the present application.

[0041] Figure 5 It is a structural block diagram of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0042] The following will be combined with the drawings in this application to clearly and completely describe the technical solutions in the implementation mode of this application. Obviously, the described implementation mode is only a part of the implementation mode of this application, not all the implementation modes. Based on the implementation mode in this application, all other implementation modes obtained by those skilled in the art without creative work are within the scope of protection of this application.

[0043] In the description of the embodiments of the present application, it should be understood that the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, features defined as "first" and "second" may explicitly or implicitly include one or more of the features. In the description of the embodiments of the present application, the meaning of "multiple" is two or more, unless otherwise clearly and specifically defined.

[0044] First, a brief explanation of the terms used in this article is given.

[0045] Reflective column: A cylinder that can reflect back most of the energy of the laser.

[0046] Posture: includes position and attitude. In two-dimensional space, the position can be expressed by (x, y) coordinates and the attitude can be expressed by azimuth.

[0047] Profile data: Point cloud data from laser sensors.

[0048] Reflective column navigation: Use reflective columns placed in the environment for navigation.

[0049] QR code navigation: Navigate using QR codes posted in the environment.

[0050] Contour navigation: Exploiting natural point cloud features in the environment for navigation.

[0051] Sliding window: A laser frame queue that stores a certain number of laser frames.

[0052] Obstacle point: The point left on the map when the laser point hits an obstacle.

[0053] Passable area: The area between the laser sensor and the obstacle that is penetrated.

[0054] Unexplored area: The area in the environment that has not been explored by the laser sensor.

[0055] At present, in the fields of commercial cleaning, industrial logistics, and commercial food delivery, mobile robot navigation requires building a map of the activity scene first. Related robot navigation technologies use artificial features, such as reflective column navigation and QR code navigation. However, these features need to be constructed and laid out in advance, and the subsequent maintenance costs are high, and customer acceptance is low. For this reason, the applicant proposed to use contour navigation as a substitute. Compared with reflective column navigation and QR code navigation, contour navigation reduces the need for environmental modification and complex subsequent maintenance costs, and has become an important navigation solution.

[0056] Before using contour navigation, you need to build a high-quality contour map. Contour maps can use three colors to represent map status, namely obstacle points, passable areas, and unexplored areas. Obstacle points are used for positioning, and passable areas are used for navigation route planning.

[0057] In some simple scenarios, such as when the environment area is smaller than the maximum laser distance measurement, the ground is flat, and the laser field of view is 360 degrees (or close to 360 degrees), the use of laser data can well fill the traversable area without forming extra noise points, and there is no need to remove noise points after the map is built. However, in some complex environments, such as airports, bumpy roads, and narrow passages, due to the installation limitations of laser sensors, the field of view is less than 300 degrees, which faces more challenges when building maps.

[0058] In the related art, the robot is expanded to a certain extent to adapt to narrow passages or pushed against obstacles, and it is difficult to avoid mistaking obstacles in these areas for passable areas. In open areas such as airports and underground garages, the environmental area is larger than the laser ranging range, and some laser areas cannot form effective reflections, resulting in sporadic noise points in unexplored areas behind the robot during map building. On bumpy roads, the laser can easily hit the ground or other planes, causing the walls to become thicker and obstacles such as the ground to appear in the map. These scenes require special processing such as denoising and wall filling after the map is built, and the thickening of obstacles will reduce the quality of the map. In order to solve these problems, the applicant has proposed a comprehensive treatment plan that can deal with one or more of the above situations.

[0059] When using a mobile robot to construct a contour map, the sensors used may include, for example, an odometer, an IMU (inertial measurement unit), a laser sensor, etc. The odometer and IMU provide the initial pose of the laser frame. By matching the laser frame with the local map, the precise pose of the laser frame in the local map can be obtained. By projecting all laser frames onto the grid map using the precise pose, a global map containing obstacle points, passable areas, and unexplored areas can be formed. In simple scenarios, there is no need for manual denoising after the map is generated, and the map quality is good.

[0060] However, in complex environments such as narrow, open and bumpy, the generated map is prone to noise and thickening of obstacles, which affects the quality of the map. To this end, the applicant proposed an adaptive processing solution that can effectively eliminate noise in the map generation process and improve the map quality.

[0061] See also Figure 1 , Figure 1 It is a flowchart of a map generation method provided in an embodiment of the present application.

[0062] In order to improve the relevant technology, an embodiment of the present application provides a map generation method, which is applied to a robot working in a target area. The method includes steps S101 to S104.

[0063] Step S101: using the initial posture corresponding to the target laser frame, projecting the target laser frame into the first local map to calculate the local posture of the target laser frame in the first local map; the laser frame is obtained by scanning using the corresponding laser sensor of the robot.

[0064] Step S102: using the target laser frame and subsequent laser frames to process the first local map to obtain a second local map.

[0065] Step S103: using the local pose of the target laser frame in the first local map, projecting the target laser frame into the second local map to determine at least one invalid matching point in the target laser frame; the invalid matching point is a laser point in the target laser frame that does not meet the target matching condition.

[0066] Step S104: Calculate the traversable area based on the matching invalid points in the target laser frame to generate a global map of the target area.

[0067] In some embodiments, the target matching condition can be preset, for example, the matching score is greater than the target matching score. The target matching score is, for example, 60, 80, 90, etc.

[0068] In some embodiments, the target area may have one or more environmental characteristics of narrow, open, and bumpy.

[0069] In some embodiments, the grids in the global map can be classified into obstacle points, passable areas, and unexplored areas according to the number of occupancy and the number of penetrations. As an example, when the ratio of the number of occupancy and the number of penetrations corresponding to the grid is greater than the target ratio, the grid is identified as an obstacle point; when the ratio of the number of occupancy and the number of penetrations corresponding to the grid is not greater than the target ratio, the grid is identified as a passable area; when the sum of the number of occupancy and the number of penetrations corresponding to the grid is less than the target sum value, the grid is identified as an unexplored area. Among them, the target ratio is, for example, 20%, 30%, 40%, 50%, etc., and the target sum value is, for example, 1, 2, 3, 5, etc.

[0070] Among them, the robot can be a biped robot (also known as a humanoid robot, a humanoid robot), a quadruped robot, a wheeled robot, an AGV car or other self-moving equipment. In terms of application fields, the robot can be a cleaning robot, a delivery robot, a disinfection robot, an inspection robot, a navigation robot, a companion robot, etc. The target laser frame can be any laser frame, that is, it can be any frame of laser point cloud data obtained by scanning by a laser sensor on the robot. The initial pose, for example, refers to the initial position and pose of the robot when collecting the target laser frame, for example, it can be provided by the robot's corresponding odometer and inertial measurement unit. The local map refers to a part of the map generated by the robot during the mapping process, which contains local information of the target area. In this article, "the first local map" and "the second local map" are both local maps, and the prefixes "first" and "second" serve to distinguish them. The local pose can be regarded as a precise pose, which is determined by matching the target laser frame with the first local map to determine the exact position and pose of the target laser frame in the first local map. As the target laser frame and the laser frames thereafter are processed, the first local map is updated to obtain the second local map. Invalid matching points refer to laser points that fail to meet the target matching conditions when the target laser frame is projected into the second local map. In the second local map, the environment in which the target laser frame is located has been fully observed. At this time, when the target laser frame is projected into the second local map, the laser points that still cannot be matched will be identified as invalid matching points. These invalid matching points can be used to calculate the passable area. The global map is a map of the entire target area, for example, it can be in the form of a grid map, where each grid can be divided into obstacle points, passable areas or unexplored areas.

[0071] Related map generation methods are prone to obstacle problems in complex environments (such as narrow, open and bumpy scenes), resulting in low quality of the generated map and requiring a lot of post-processing. In the above embodiment, the initial pose of the target laser frame is used to project it into the first local map, and the local pose of the target laser frame in the first local map is calculated. Next, the first local map is processed using the target laser frame and the laser frame thereafter to obtain a second local map. Then, based on the local pose of the target laser frame, it is projected into the second local map to identify invalid matching points in the target laser frame. These invalid matching points may be caused by complex environments or sensor errors, such as abnormal laser points caused by hitting the ground in a bumpy road section. Afterwards, in the process of generating a global map, the invalid matching points are used to calculate the passable area. For example, invalid matching points can be used to increase the number of penetrations of the corresponding grid.

[0072] The above embodiment can adaptively process laser data (i.e., laser frames) in complex environments, effectively utilize invalid matching points in laser frames, and only use them to generate traversable areas, thereby reducing the thickening of obstacle contours, improving the accuracy of map generation, and providing high-quality global maps. In addition, the need for post-processing manual processing is significantly reduced, the efficiency of map generation is improved, and it is suitable for robot navigation in a variety of complex scenarios.

[0073] In some embodiments, before the target laser frame is projected into the first local map using the corresponding initial posture of the target laser frame, the method may further include: counting continuous reflection invalid points in the target laser frame to obtain one or more reflection invalid point sets; the reflection invalid points are laser points in the target laser frame that do not meet the target reflection condition; determining one of two reflection valid points adjacent to the reflection invalid point set as the target reflection valid point; the reflection valid point is a laser point in the target laser frame that meets the target reflection condition; filling in the ranging value of at least one of the reflection invalid points according to the numerical relationship between the ranging value of the target reflection valid point in the reflection invalid point set and the target ranging value, so that the filled target laser frame can be projected into the first local map.

[0074] In some embodiments, the target reflection condition can be preset, for example, the reflectivity is greater than the target reflectivity, or the reflectivity is within the target reflectivity range. The target reflectivity can be selected or given in advance as needed, and the target reflectivity range can be selected or given in advance as needed. As an example, the laser sensor can set the ranging value of the laser point that does not meet the target reflection condition to infinity, then the laser point with a ranging value of infinity in the target laser frame is a reflection invalid point, and the laser point with a ranging value of non-infinity in the target laser frame is a reflection valid point.

[0075] Among them, the reflection invalid points are laser points in the target laser frame, which do not meet the target reflection conditions (for example, the preset reflectivity conditions), and may fail to effectively reflect the laser signal due to the distance being too far or other reasons, and cannot obtain a valid ranging value. Correspondingly, the reflection valid points are laser points in the target laser frame that meet the target reflection conditions, can effectively reflect the laser signal and be received by the laser sensor, and can obtain a valid ranging value. The reflection invalid point set is a set of continuous reflection invalid points in the target laser frame, and the number of reflection invalid points in the reflection invalid point set can be one or more. In some embodiments, the number of reflection invalid points in the reflection invalid point set is not less than the number of targets. The number of targets can be determined according to the resolution of the laser sensor and the target ranging value, for example, it can be 5, 6, 10, etc. The target ranging value can be selected according to the needs in the actual application, for example, it can be 1m, 2m, 3m, 5m, etc. As an example, if the ranging value of the target reflection valid point exceeds the target ranging value, the ranging value of the reflection invalid point is filled with the target ranging value; if the ranging value of the adjacent valid point is less than or equal to the target ranging value, it is filled according to the ranging value of the reflection valid point.

[0076] In a complex environment, the related map generation method is prone to invalid reflection points, resulting in noise and misidentification in the generated map, which affects the accuracy and quality of the map. The above embodiment reduces noise by filling the ranging values ​​of invalid reflection points, improves the accuracy and quality of map generation, and is suitable for robot navigation in complex environments such as narrow, open and bumpy environments. Specifically, before using the initial position and posture of the target laser frame to project the target laser frame into the first local map, the continuous invalid reflection points in the target laser frame are first counted to form one or more sets of invalid reflection points, and the target reflection valid points are determined. The ranging values ​​of these invalid reflection points are filled according to the numerical relationship between the ranging values ​​of the target reflection valid points and the preset target ranging values. Using the initial position and posture of the target laser frame, the filled target laser frame is projected into the first local map, and the local position and posture of the target laser frame in the first local map are calculated. The first local map is processed using the target laser frame and the laser frames thereafter to generate a second local map. Using the local position and posture of the target laser frame in the first local map, the target laser frame is projected into the second local map, and the matching invalid points in the target laser frame are identified and determined. The passable area is calculated based on the matching invalid points in the target laser frame, and a global map of the target area is generated. The above embodiment can effectively process invalid reflection points, reduce noise points, and significantly improve the accuracy and quality of the map. Adaptively fill the ranging values ​​of invalid reflection points to avoid misjudgment caused by fixed range filling (for example, misjudging obstacles such as walls as passable areas), thereby improving the reliability of the map. Provide high-quality global maps, suitable for robot navigation in a variety of complex scenarios such as narrow, open and bumpy, reducing the need for later manual processing.

[0077] In some embodiments, determining one of the two reflection valid points adjacent to the reflection invalid point set as the target reflection valid point may include: for the two reflection valid points adjacent to the reflection invalid point set, respectively calculating the difference between the ranging values ​​of the two reflection valid points and the target ranging value, and determining the reflection valid point corresponding to the smaller difference as the target reflection valid point of the reflection invalid point set.

[0078] In the above embodiment, among the two adjacent effective reflection points at both ends of the invalid reflection point set, a effective reflection point with a smaller difference with the target ranging value is selected as the target effective reflection point, which is closer to the actual ranging value of the invalid reflection point, thereby reducing the error that may be introduced by directly using the ranging value of the target effective reflection point, ensuring the continuity and consistency of data in the map generation process, and avoiding map instability or distortion caused by improper filling of invalid reflection points.

[0079] In some embodiments, filling the ranging value of at least one of the reflection invalid points according to the numerical size relationship between the ranging value of the target reflection valid point and the target ranging value of the reflection invalid point set may include: when the ranging value of the target reflection valid point is greater than the target ranging value, using the target ranging value to fill the ranging value of at least one of the reflection invalid points; or, when the ranging value of the target reflection valid point is not greater than the target ranging value, using the ranging value of the target reflection valid point to fill the ranging value of at least one of the reflection invalid points.

[0080] The above embodiment can more accurately reflect the distance information in the actual environment by filling the distance measurement value of the reflection invalid point according to the numerical size relationship between the target reflection valid point and the target distance measurement value, avoid the error caused by the fixed value filling, and improve the distance measurement accuracy of the map. When the distance measurement value of the target reflection valid point is greater than the target distance measurement value, the target distance measurement value is used to fill the reflection invalid point, which can reduce the misjudgment of obstacles such as walls as passable areas, thereby reducing misidentification and improving the reliability of the map. When the distance measurement value of the target reflection valid point is not greater than the target distance measurement value, the distance measurement value of the target reflection valid point is used to fill, which can ensure the authenticity and consistency of the data and reduce the data distortion problem caused by improper filling of the reflection invalid point. By adaptively filling the distance measurement value of the reflection invalid point, the noise and inaccurate information in the map can be effectively reduced, the generated map is clearer and more reliable, and the overall quality of the map is improved. More accurate and reliable map data enables the robot to more accurately perform environmental perception and path planning, reduce the risk of path deviation or collision caused by map errors, and improve the safety and efficiency of navigation. The above-mentioned adaptive filling method is suitable for complex environments such as narrow, open and bumpy environments. It can flexibly deal with the problem of invalid reflection points in different scenarios and ensure the generation of high-quality maps in various complex environments.

[0081] See also Figure 2 , Figure 2 Schematic diagram of filling the distance measurement value of the reflection invalid point provided by the embodiment of the present application. Figure 2 In the figure, the filling points are the reflection invalid points filled with the distance measurement values.

[0082] In a narrow, open, bumpy and complex environment, the generated map is prone to noise, and there are also problems such as the thickening of the point cloud of obstacles that affect the use of the map. The above embodiment makes adaptive processing for this, and fills the laser data in the laser preprocessing stage. The related method selects a circle of a fixed size around the robot, and all areas within the range are set as passable areas. Since the robot is usually a polygon, when the robot moves in a narrow passage or close to an object, it is easy to set the obstacle as a passable area, thereby affecting the quality of the map.

[0083] Different from the related methods, the above embodiment comprehensively utilizes laser data and performs the following preprocessing: assuming a circle of fixed size, whose diameter is the target ranging value, assuming it is 2m; for each laser frame involved in matching, count all continuous invalid reflection points, assuming that laser points i to i+20 are all invalid data and have no normal reflectivity. At this time, laser points i to i+20 are a group of invalid reflection points, as a set of invalid reflection points, i is a positive integer; fill the ranging value of each set of invalid reflection points according to the ranging value of the target reflection valid point, which is divided into two cases: if the ranging value of the target reflection valid point exceeds 2m, the ranging value of the invalid reflection point is only filled with the target ranging value (i.e., 2m); if the ranging value of the target reflection valid point is less than 2m, the ranging value of the invalid reflection point is filled according to the real ranging value of the target reflection valid point, such as Figure 2 As shown. After the above preprocessing, the problem caused by filling in the fixed size range is improved.

[0084] In some embodiments, the process of processing the first local map using the target laser frame and the laser frames thereafter may include: determining, in the first local map, undetermined obstacle points corresponding to the target laser frame and the laser frames thereafter; counting the number of occupancy of at least one undetermined obstacle point; and determining the undetermined obstacle point as an obstacle point when the number of occupancy of the undetermined obstacle point is greater than the target number.

[0085] The laser frame after the target laser frame refers to the laser frame collected by the laser sensor after the target laser frame. The undetermined obstacle point refers to the grid that has not been determined as a real obstacle point in the preliminary processing stage. The occupation count refers to the number of times it is identified as an undetermined obstacle point in multiple laser frames. The target count can be a preset count threshold. When the occupation count of an undetermined obstacle point exceeds this value, the undetermined obstacle point is determined to be a real obstacle point.

[0086] When identifying obstacle points, the relevant map generation method may cause misjudgment and recognition errors due to the noise of laser data or the complexity of the environment. The above embodiment adopts a delayed processing method to reduce misjudgment and improve the accuracy of obstacle point identification by counting the number of occupations of undetermined obstacle points, thereby improving the quality and reliability of the map. In the first local map, the undetermined obstacle points corresponding to the target laser frame and the laser frame thereafter are determined. These undetermined obstacle points are preliminarily identified as possible obstacle points. The number of occupations of each undetermined obstacle point identified as an undetermined obstacle point in multiple laser frames is counted. By recording the number of occurrences or frequencies of these undetermined obstacle points at different times and robot postures, it is determined whether they are actual obstacles. According to the comparison between the number of occupations and the target number, if the number of occupations of the undetermined obstacle point is greater than the target number, it is determined as an obstacle point. This process ensures that only when the same position is observed to exist for multiple times, it is marked as an obstacle point, thereby reducing the influence of noise and accidental errors. By counting the number of occupations of the undetermined obstacle points, the above embodiment can more accurately identify the actual obstacle points and reduce misjudgment and missed judgment. Multiple observations and statistical occupancy times can effectively filter out single noise data and accurately identify obstacle points, ensuring that the obstacle information in the map is more reliable, making the map more accurate and clear, and improving the overall quality of the map.

[0087] In some embodiments, the processing of the first local map using the target laser frame and the laser frames thereafter to obtain the second local map may include: storing the target laser frame and N laser frames thereafter in a sliding window, and processing the first local map using the target laser frame and N laser frames thereafter in the sliding window to obtain the second local map; N is a positive integer. The method further includes: before storing the N+1th laser frame after the target laser frame in the sliding window, taking out the target laser frame.

[0088] The sliding window is used to store a certain number of laser frame queues. During the map generation process, the data in the sliding window is continuously updated for continuous processing and analysis. In some embodiments, the sliding window can have a fixed length. The fixed length can be, for example, 5, 10, 20, etc.

[0089] When dealing with complex environments, related map generation methods often find it difficult to effectively filter noise and errors, resulting in low map accuracy and poor reliability. The above-mentioned embodiment adopts a delayed processing method, and improves the accuracy and quality of map generation and reduces noise and misjudgment by using a sliding window to store and process multiple laser frames. Specifically, the target laser frame and the N laser frames after it are stored in a sliding window, and these laser frames are processed through the sliding window. The first local map is processed using the target laser frame and the N laser frames after it in the sliding window to generate a second local map. This process improves the accuracy and consistency of the map by performing a comprehensive analysis of multiple laser frames. For example, based on the number of times an undetermined obstacle point occupies multiple laser frames, it is determined whether the undetermined obstacle point is a real obstacle point.

[0090] Assuming that the sliding window has a fixed length (assuming it is N+1), when the number of laser frames in the sliding window reaches the fixed length of the sliding window, before storing a new laser frame in the sliding window, the laser frame first stored in the sliding window needs to be removed from the sliding window. Among the target laser frame and the N laser frames after it, the first one stored in the sliding window is the target laser frame. Therefore, the target laser frame is first taken out so that the N+1th laser frame after the target laser frame is stored in the sliding window. The target laser frame taken out from the sliding window can be projected into the second local map to determine at least one matching invalid point in the target laser frame for calculating the traversable area.

[0091] In the above embodiment, before storing the N+1th laser frame after the target laser frame into the sliding window, the target laser frame is taken out so that N+1 laser frames are always kept in the sliding window, thereby performing continuous map updating and optimization. The sliding window allows for comprehensive processing of multiple laser frames. By matching and optimizing multiple frames of laser data, the noise and errors in a single laser frame are effectively filtered out, the number of misjudgments of invalid matching points is reduced, and the reliability of the map is improved. The sliding window mechanism ensures the continuity and real-time nature of data during map generation, so that the map can respond quickly to environmental changes and maintain the latest status. Through the sliding window mechanism and the comprehensive processing of multiple frames of data, the map generation process is simplified, the dependence on single-frame laser data is reduced, and the robustness of the algorithm is improved.

[0092] In some embodiments, the process of calculating the passable area based on the matching invalid points in the target laser frame may include: for at least one matching invalid point in the target laser frame, adding one to the number of penetrations of the grid between the matching invalid point and the laser origin, but not performing any operation on the number of occupancy of the grid where the matching invalid point is located; determining the passable area in the global map based on the number of occupancy and penetration of the grid in the global map.

[0093] A grid is a unit that represents a spatial position in the global map. Each grid represents a small area in the global map. The number of occupancy refers to the number of times a grid is occupied by an obstacle. The number of penetrations refers to the number of times the laser passes through the grid. The laser origin is the location of the laser sensor, that is, the starting point of the laser emission. The grid between the matching invalid point and the laser origin does not include the grid where the matching invalid point is located, nor does it include the grid where the laser origin is located.

[0094] The above embodiment classifies grids into obstacle points, passable areas, and unexplored areas according to the number of occupancy and penetration of the grids. As an example, grids with high occupancy times are marked as obstacle points, grids with high penetration times and low occupancy times are marked as passable areas, and grids with low penetration times and occupancy times are marked as unexplored areas. Based on the matching invalid points in the target laser frame, the passable area is calculated. For each matching invalid point, the number of penetrations of all grids between it and the laser origin is increased by one, but the number of occupancy of the grid where the matching invalid point is located is not changed. This process ensures that the matching invalid point will not be mistakenly identified as an obstacle, but the area on its path is marked as passable.

[0095] See also Figure 3 , Figure 3 It is a schematic diagram of a laser origin, an obstacle and a ground point provided in an embodiment of the present application.

[0096] For example, in practical applications, the initial pose of the target laser frame is used to match the target laser frame with the first local map to obtain the accurate pose (i.e., local pose) of the target laser frame. In order to verify which are the real obstacle points in the target laser frame, a delay strategy can be adopted to wait for the obstacle points in the target laser frame to have enough hit times in the first local map. Therefore, a sliding window method is introduced to keep the target laser frame in the sliding window for a period of time. The target laser frame is added to the sliding window, and the fixed length of the sliding window can be determined based on the distance between two adjacent laser frames and the size of the first local map. The distance between two adjacent laser frames can be related to the range of the environment, for example, it can be set to 1m, and the size of the first local map can be set to twice the effective laser ranging value (for example, 40m) + the moving distance of the laser frame of the number of targets (for example, 10) (the moving distance of 1 laser frame is, for example, 1m). When the data in the sliding window reaches an upper limit (for example, a fixed length of the sliding window), the environment in which the laser frame first stored in the sliding window is located has been fully observed, and the laser frame first stored in the sliding window is removed. At this time, the local map is used again to process the removed laser frame.

[0097] Specifically, when the target laser frame is removed from the sliding window, the local posture can be used to further process the laser points of the target laser frame that are not matched in the second local map. Assume that the fixed length of the sliding window is 10 frames, and laser frames k to k+9 are stored, k is a positive integer, and for the laser frame k that is about to remove the sliding window, it is projected into the second local map; a matching query is performed on the data of the laser frame k, and all the laser points that cannot be matched are counted as set A; for the data in set A, all are marked as invalid matching points, and the invalid matching points are not used to generate obstacle points in the map, but these invalid matching points can be used to calculate the passable area in the map. For example, for the invalid matching point j in the laser frame k, when generating the global map, the invalid matching point j is used to increase the number of penetrations from the laser origin to the invalid matching point j in the map, and the grid where the invalid matching point j is located is not calculated for occupation. Figure 3 As shown, due to reasons such as bumpy roads, there may be ground points in the laser points caused by hitting the ground. Generally speaking, as the local environment is gradually detected, in the updated second local map, the ground points will be marked as invalid matching points because they are difficult to match. In the above embodiment, in addition to not misjudging the ground points as obstacle points, the ground points can continue to play a role in the map generation process. Specifically, only the ground points are used to calculate the passable area, but the ground points are not used to calculate the obstacle points. For example, the number of penetrations of the grid between the laser origin and the ground point is increased by one, but no operation is performed on the number of occupations of the grid where the ground point is located, that is, the addition process is not performed. After this step, abnormal points such as hitting the ground in the bumpy road section can be effectively utilized and only used to generate the passable area, reducing the thickening of the obstacle contour.

[0098] After the filling step and the sliding window processing step, the noise points in the map generation process can be effectively reduced, and the map quality can be significantly improved by adaptively coping with narrow, open, bumpy and other environments. The above embodiment adopts an adaptive filling algorithm in narrow, open, bumpy and other scenes, and reasonably utilizes the invalid laser points after matching (i.e., matching invalid points), effectively improving the map quality and reducing the work of manually deleting noise points in the later stage.

[0099] The embodiment of the present application also provides a map generation device, which is applied to a robot working in a target area, and the device includes a posture calculation module, a map processing module, a matching module and a map generation module. The posture calculation module is used to project the target laser frame into a first local map using the initial posture corresponding to the target laser frame, so as to calculate the local posture of the target laser frame in the first local map; the laser frame is obtained by scanning using the corresponding laser sensor of the robot. The map processing module is used to process the first local map using the target laser frame and the laser frames thereafter to obtain a second local map. The matching module is used to project the target laser frame into a second local map using the local posture of the target laser frame in the first local map, so as to determine at least one invalid matching point in the target laser frame; the invalid matching point is a laser point in the target laser frame that does not meet the target matching condition. The map generation module is used to calculate the traversable area based on the invalid matching points in the target laser frame, so as to generate a global map of the target area.

[0100] In some embodiments, the device may further include a filling module. The filling module is used to count the continuous reflection invalid points in the target laser frame before projecting the target laser frame into the first local map using the corresponding initial posture of the target laser frame to obtain one or more reflection invalid point sets; the reflection invalid points are laser points in the target laser frame that do not meet the target reflection condition; one of the two reflection valid points adjacent to the reflection invalid point set is determined as the target reflection valid point; the reflection valid point is a laser point in the target laser frame that meets the target reflection condition; according to the numerical relationship between the ranging value of the target reflection valid point of the reflection invalid point set and the target ranging value, fill in the ranging value of at least one of the reflection invalid points, so as to project the filled target laser frame into the first local map.

[0101] In some embodiments, the filling module can determine one of the two reflection valid points adjacent to the reflection invalid point set as the target reflection valid point in the following manner: for the two reflection valid points adjacent to the reflection invalid point set, respectively calculate the difference between the ranging values ​​of the two reflection valid points and the target ranging value, and determine the reflection valid point corresponding to the smaller difference as the target reflection valid point of the reflection invalid point set.

[0102] In some embodiments, the filling module can fill the ranging value of at least one of the reflection invalid points according to the numerical size relationship between the ranging value of the target reflection valid point and the target ranging value of the reflection invalid point set in the following manner: when the ranging value of the target reflection valid point is greater than the target ranging value, the target ranging value is used to fill the ranging value of at least one of the reflection invalid points; or, when the ranging value of the target reflection valid point is not greater than the target ranging value, the ranging value of the target reflection valid point is used to fill the ranging value of at least one of the reflection invalid points.

[0103] In some embodiments, the map processing module may process the first local map using the target laser frame and the laser frames thereafter in the following manner: in the first local map, determining the undetermined obstacle points corresponding to the target laser frame and the laser frames thereafter; counting the number of occupancy of at least one undetermined obstacle point; and determining the undetermined obstacle point as an obstacle point when the number of occupancy of the undetermined obstacle point is greater than the target number.

[0104] In some embodiments, the map processing module may process the first local map using the target laser frame and the laser frames thereafter to obtain a second local map in the following manner: the target laser frame and N laser frames thereafter are stored in a sliding window, and the target laser frame in the sliding window and N laser frames thereafter are used to process the first local map to obtain a second local map; N is a positive integer. The map processing module is further configured to retrieve the target laser frame before storing the N+1th laser frame after the target laser frame in the sliding window.

[0105] In some embodiments, the map generation module may calculate the passable area based on the matching invalid points in the target laser frame in the following manner: for at least one matching invalid point in the target laser frame, the number of penetrations of the grid between the matching invalid point and the laser origin is increased by one, but no operation is performed on the number of occupancy of the grid where the matching invalid point is located; and the passable area in the global map is determined according to the number of occupancy and penetration of the grid in the global map.

[0106] In some embodiments, the grids in the global map may be classified into obstacle points, passable areas, and unexplored areas according to the number of occupancy and penetration.

[0107] In some embodiments, the target area may have one or more environmental characteristics of narrow, open, and bumpy.

[0108] See also Figure 4 , Figure 4It is a structural block diagram of a robot provided in an embodiment of the present application.

[0109] An embodiment of the present application also provides a robot, comprising a control module and a laser sensor, wherein the control module is used to execute any of the above methods to generate a global map of the target area; and the laser sensor is used to scan and obtain a laser frame.

[0110] In some embodiments, the laser sensor may be a 2D laser sensor. In other embodiments, the laser sensor may be a 3D laser sensor.

[0111] In some embodiments, the robot may be a multi-jointed robot.

[0112] In some embodiments, the robot may further include one or more of an angle encoder, a torque sensor, a camera, and a PIR sensor.

[0113] An embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, any of the above methods is implemented.

[0114] An embodiment of the present application further provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, any of the above methods is implemented.

[0115] The computer program product may be a portable compact disk read-only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the computer program product of the present application is not limited thereto, and the computer program product may be any combination of one or more computer readable media.

[0116] An embodiment of the present application further provides a computer device, which includes a memory and a processor, wherein the memory stores a computer program, and the processor implements any of the above methods when executing the computer program.

[0117] See also Figure 5 , Figure 5 It is a structural block diagram of a computer device provided in an embodiment of the present application.

[0118] The embodiments of the present application do not limit the computer device, which may be, for example, a local computer device, a cloud computer device, a distributed computer device, etc.

[0119] The computer device may include: a memory 110, a processor 120, and a communication interface 130. The memory 110, the processor 120, and the communication interface 130 are connected via an internal connection path.

[0120] The memory 110 is used to store computer programs. In some implementations, the computer programs may include codes for implementing the methods of the embodiments of the present application.

[0121] The processor 120 is used to execute the computer program stored in the memory 110 to control the communication interface 130 to receive input data and information and output data such as operation results. In some implementations, when the solution of the embodiment of the present application is implemented by software or firmware, the computer program for implementing the solution of the embodiment of the present application can be stored in the processor 120 and executed by the processor 120.

[0122] The memory 110 may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (Programmable ROM, PROM), an erasable programmable read-only memory (Erasable PROM, EPROM), an electrically erasable programmable read-only memory (EEPROM) or a flash memory. The volatile memory may be a random access memory (RAM). It should be noted that the memory 110 described herein is intended to include, but is not limited to, any memory of these and other suitable types. As an example, the memory 110 includes a random access memory (RAM), a cache memory and a read-only memory (ROM). Among them, the memory 110 stores a computer program, and the computer program can be executed by the processor 120 so that the processor 120 implements the steps of any of the above methods.

[0123] The processor 120 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor, or the processor 120 may be any conventional processor, etc.

[0124] In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in the processor 120 or an instruction in the form of software. The method disclosed in conjunction with the embodiment of the present application can be directly embodied as a hardware processor for execution, or a combination of hardware and software modules in the processor 120 for execution. The software module can be located in a mature storage medium in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory 110, and the processor 120 reads the information in the memory 110 and completes the steps of the above method in conjunction with its hardware. To avoid repetition, it is not described in detail here.

[0125] In some implementations, in addition to the hardware units described above, the computer device may also include software modules, where the software modules may be, for example, an operating system, a basic input output system (BIOS), application software, etc.

[0126] The operating system is used to manage the hardware and / or software resources of computer devices and is the core and cornerstone of computer devices. The operating system needs to handle basic tasks such as managing and configuring memory, determining the priority of system resource supply and demand, controlling input and output devices, operating networks, and managing file systems. In order to facilitate user operations, most operating systems will provide an operating interface for users to interact with the system.

[0127] BIOS is used to run hardware initialization during the power-on boot phase and provide runtime services for the operating system and application programs. In some implementations, BIOS can also monitor and display processor temperature and execute functions such as adjusting temperature protection strategies.

[0128] Application software is also called application program, which can be understood as software written for a specific application purpose of the user. It is one of the main categories of computer software. For example, application software can be a program used to achieve power control, temperature management, etc.

[0129] It should be noted that although some embodiments of the present application take mobile robots as examples, the present application can be applied to other bionic robots, such as AGVs, drones, etc., and the present application is not limited to this.

[0130] It should be understood that the specific examples in this specification are only intended to help those skilled in the art to better understand the implementation methods of the present application, rather than to limit the scope of protection of the present application.

[0131] It is understood that in the various implementations of this specification, the size of the sequence number of each process does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of this application.

[0132] It can be understood that the various implementation modes described in this specification can be implemented individually or in combination, and this application is not limited to this.

[0133] Unless otherwise specified, all technical and scientific terms used in this specification have the same meaning as those generally understood by those skilled in the art of the technical field of this specification. The terms used in this specification are only for the purpose of describing specific embodiments and are not intended to limit the scope of this specification. The term "and / or" used in this specification includes any and all combinations of one or more related listed items. The singular forms of "a", "above", and "the" used in this specification and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings.

[0134] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this specification.

[0135] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of each embodiment described above can refer to the corresponding process in other embodiments and will not be repeated here.

[0136] In the several embodiments provided in this specification, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0137] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the technical solution of the present application.

[0138] In addition, each functional unit in each embodiment of the present specification may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0139] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this specification, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of this specification. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, etc., various media that can store program codes.

[0140] The above are only specific implementations of this specification, but the protection scope of this application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in this specification, which should be included in the protection scope of this specification. Therefore, the protection scope of this application should be based on the protection scope of the claims.

Claims

1. A map generation method, characterized in that: Applied to a robot working in a target area, the method comprises: Using the initial pose corresponding to the target laser frame, the target laser frame is projected into the first local map to calculate the local pose of the target laser frame in the first local map; the laser frame is obtained by scanning using the corresponding laser sensor of the robot; Processing the first local map using the target laser frame and subsequent laser frames to obtain a second local map; Using the local pose of the target laser frame in the first local map, the target laser frame is projected into the second local map to determine at least one invalid matching point in the target laser frame; the invalid matching point is a laser point in the target laser frame that does not meet the target matching condition; A traversable area is calculated based on the matched invalid points in the target laser frame to generate a global map of the target area.

2. The map generation method according to claim 1, characterized in that: Before projecting the target laser frame into the first local map using the initial pose corresponding to the target laser frame, the method further includes: Counting continuous reflection invalid points in the target laser frame to obtain one or more reflection invalid point sets; the reflection invalid points are laser points in the target laser frame that do not meet the target reflection condition; Determine one of the two effective reflection points adjacent to the set of invalid reflection points as a target effective reflection point; the effective reflection point is a laser point in the target laser frame that satisfies the target reflection condition; According to the numerical relationship between the ranging value of the target reflection valid point of the reflection invalid point set and the target ranging value, the ranging value of at least one of the reflection invalid points is filled so that the filled target laser frame is projected into the first local map.

3. The map generation method according to claim 2, characterized in that: The step of determining one of the two effective reflection points adjacent to the set of invalid reflection points as a target effective reflection point comprises: For two reflection effective points adjacent to the reflection invalid point set, the differences between the ranging values ​​of the two reflection effective points and the target ranging value are calculated respectively, and the reflection effective point corresponding to the smaller difference is determined as the target reflection effective point of the reflection invalid point set.

4. The map generation method according to claim 2, characterized in that: Filling the ranging value of at least one of the invalid reflection points according to the numerical relationship between the ranging value of the target reflection valid point of the invalid reflection point set and the target ranging value comprises: In the case where the distance measurement value of the target reflection valid point is greater than the target distance measurement value, the target distance measurement value is used to fill the distance measurement value of at least one of the reflection invalid points; or In a case where the distance measurement value of the target reflection effective point is not greater than the target distance measurement value, the distance measurement value of at least one of the reflection invalid points is filled with the distance measurement value of the target reflection effective point.

5. The map generation method according to claim 1, characterized in that: The process of processing the first local map using the target laser frame and subsequent laser frames includes: In the first local map, determining undetermined obstacle points corresponding to the target laser frame and the laser frames thereafter; Count the number of times at least one undetermined obstacle point is occupied; When the occupation number of the undetermined obstacle point is greater than the target number, the undetermined obstacle point is determined as an obstacle point.

6. The map generation method according to claim 1, characterized in that: The using the target laser frame and the subsequent laser frames to process the first local map to obtain a second local map includes: storing the target laser frame and N subsequent laser frames in a sliding window, and using the target laser frame and N subsequent laser frames in the sliding window to process the first local map to obtain a second local map; N is a positive integer; The method further includes: before storing the N+1th laser frame after the target laser frame in the sliding window, taking out the target laser frame.

7. The map generation method according to claim 1, characterized in that: The process of calculating the passable area based on the matching invalid points in the target laser frame includes: For at least one invalid matching point in the target laser frame, the number of penetrations of the grid between the invalid matching point and the laser origin is increased by one, but no operation is performed on the number of occupancy of the grid where the invalid matching point is located; A passable area in the global map is determined according to the number of occupancy and penetration of the grid in the global map.

8. The map generation method according to claim 1, characterized in that: The target area has one or more environmental features of narrow, open and bumpy.

9. A robot, characterized in that: The robot comprises a control module and a laser sensor, wherein the control module is used to execute the method according to any one of claims 1 to 8 to generate a global map of the target area; and the laser sensor is used to scan and obtain a laser frame.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.

11. A computer device, characterized in that: The computer device comprises a memory and a processor, the memory stores a computer program, and the processor implements the method according to any one of claims 1 to 8 when executing the computer program.

12. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.

Citation Information

Cited By

  • Map processing method and device and storage medium

    CN119349366A