An Adaptive Compression Method for 3D Maps of Quadruped Robots in Complex Terrain

By filtering, dynamic programming, and RANSAC plane fitting on the 3D point cloud map, a 2D map suitable for complex environments is generated, which solves the problems of map distortion and obstacle recognition errors, and improves the navigation and path planning capabilities of the quadruped robot.

CN121708231BActive Publication Date: 2026-11-17SOUTHWEST JIAOTONG UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202511588896.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2025-11-03
Publication Date
2026-11-17
Estimated Expiration
2045-11-03

AI Technical Summary

Technical Problem

Existing technologies, when compressing 3D maps into 2D maps in complex environments, are prone to problems such as map distortion, obstacle recognition errors, and insufficient continuity of 2D maps.

Method used

By acquiring a 3D point cloud map, extracting the Z-axis height information of keyframes, performing filtering and smoothing, dynamically programming to divide the keyframes into compressed units with consistent internal heights, using the RANSAC plane fitting method to identify ground points, setting the compression height range, and performing orthophoto projection to generate 2D local sub-maps, which are finally stitched together to generate a global 2D map.

Benefits of technology

It enables the generation of continuous and reliable two-dimensional maps in complex environments, improving the accuracy and reliability of navigation systems and making it suitable for autonomous positioning and path planning of quadruped robots in industrial environments.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121708231B_ABST
    Figure CN121708231B_ABST
Patent Text Reader

Abstract

This application discloses an adaptive compression method for 3D maps of quadruped robots in complex terrain, comprising: extracting Z-axis height information of each keyframe in a 3D point cloud map to obtain an original height sequence; filtering and smoothing the original height sequence; dividing the keyframes into multiple compression units based on the smoothed height sequence; for each compression unit, identifying initial ground points using the RANSAC plane fitting method, removing non-ground points by combining normal vector constraints and height thresholds, and determining a reference ground height based on optimized ground points; setting a compression height range based on the reference ground height, and using the 3D point cloud within this compression height range as the set of points to be projected; performing orthographic projection on the set of points to be projected to generate a 2D local sub-map; and stitching together the 2D local sub-maps to generate a global 2D occupied grid map. This invention flattens a complex 3D space into a 2D map by segmenting it while maintaining local topological relationships and navigation usability.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of mapping and navigation for inspection robots, and more specifically, to an adaptive compression method for 3D maps of quadruped robots in complex terrain. Background Technology

[0002] In the field of autonomous mapping and navigation for quadruped robots, 3D point cloud maps are widely used for environmental modeling in complex scenarios due to their ability to fully represent the spatial structure and height information of the environment. However, in specific path planning and navigation processes, most quadruped robots still rely on 2D occupancy grid maps. This 2D representation has advantages in computational efficiency and path search, but there is a dimensional difference compared to 3D maps, requiring the 3D data to be compressed or converted into 2D data before it can be used. Traditional methods typically obtain 2D maps by directly projecting the point cloud onto a horizontal plane or by slicing it at a fixed Z-axis height.

[0003] However, in real-world scenarios with flat terrain, even without significant elevation changes, 3D SLAM systems will experience Z-axis divergence due to accumulated errors after prolonged operation. This drift causes false height differences in the vertical direction of point clouds on the same plane, resulting in severe distortion when compressing and generating 2D grid maps. Specifically, the ground is stretched into a wavy shape, height errors are mistakenly identified as obstacles or holes, and the final 2D map fails to accurately reflect the true terrain features. This problem not only disrupts the geometric consistency of the map but also leads to deviations in path planning and obstacle avoidance judgments in the navigation system, affecting the positioning accuracy and navigation reliability of quadruped robots in flat environments.

[0004] Currently, the fixed-height tiling method is commonly used to convert 3D maps into 2D maps. The basic idea is to crop or project point cloud data within a preset Z-axis height range, retaining only points near that height layer, thus generating a 2D occupancy grid map. This method is simple to implement, has low computational overhead, and can quickly obtain a 2D representation, making it widely used in flat areas or single-layer environments. For example, in robot indoor navigation or regular road scenarios, setting an appropriate tiling height can effectively reflect the distribution of ground obstacles, generating a 2D grid map that can be directly used for path planning. The disadvantages of fixed-height slicing: When there are potholes, undulations or slight differences in elevation on the ground, fixed-height slicing will misclassify these areas as obstacles or blank areas; and even if the ground is relatively flat, the 3D SLAM system may cause the point cloud that was originally on the same plane to be incorrectly layered or distorted due to the gradual divergence of the Z-axis during the long mapping process.

[0005] Another commonly used method is direct orthographic projection, which projects the entire 3D point cloud directly onto a horizontal plane along the Z-axis to obtain a top-down 2D view. The advantage of this method is that it completely preserves the horizontal positional relationships of objects in the scene, and therefore it is often used for rapid environmental modeling, visualization, and bird's-eye view generation. In this method, the 3D point cloud does not require complex segmentation or filtering; all points are directly mapped to the 2D plane according to their horizontal coordinates, making the overall implementation simple and efficient. Furthermore, for applications requiring intuitive observation of environmental structures, this method can quickly generate top-down images, assisting operators or systems in making preliminary judgments about the environmental distribution.

[0006] The disadvantages of direct orthographic projection: This method completely ignores height information, and all points at different heights will be superimposed on the same plane, which easily leads to information confusion. For example, columns and ceilings, obstacles on the ground and suspended objects in the air will be displayed overlapping, causing frequent errors in obstacle recognition in 2D maps; at the same time, non-horizontal terrain such as slopes will be compressed and exhibit large-scale geometric distortion, making them unusable as navigation data.

[0007] This application addresses the problems of map distortion, obstacle identification errors, and insufficient continuity in 2D maps caused by existing fixed-height tiling and direct projection methods in complex environments. It proposes a novel method for compressing 3D maps into 2D. This method no longer forces alignment of the global Z-axis. Instead, it iterates through the height changes of keyframes, aggregating keyframes with small Z-axis height variations into compression units. Within each unit, ground points are identified, a reference ground height is determined, and the compression range is set based on this height. This process ultimately generates a continuous and reliable 2D map, effectively improving the applicability and accuracy of 2D maps in complex environments. Summary of the Invention

[0008] To address the aforementioned issues, this application provides an adaptive compression method for 3D maps of quadruped robots in complex terrain. This method aims to solve the problems that existing fixed-height slicing and direct projection methods are prone to causing map distortion, obstacle recognition errors, and insufficient continuity of 2D maps in complex environments.

[0009] The first aspect of this invention provides an adaptive compression method for three-dimensional maps of a quadruped robot in complex terrain, comprising: Obtain a 3D point cloud map, extract the Z-axis height information of each keyframe in the 3D point cloud map, and obtain the original height sequence; The original height sequence is filtered and smoothed to obtain a smoothed height sequence. Based on the smooth height sequence, the keyframe is divided into multiple compressed units with consistent internal height using a dynamic programming method. For each compression unit, initial ground points are identified using the RANSAC plane fitting method. Non-ground points are then eliminated by combining normal vector constraints and height thresholds to obtain optimized ground points. The reference ground height for each compression unit is then determined based on these optimized ground points. Based on the reference ground height, a compression height range is set, and the three-dimensional point cloud within this compression height range is used as the set of points to be projected. Orthographic projection is performed on the set of points to be projected to generate a two-dimensional local subgraph corresponding to each compression unit; The various two-dimensional local sub-maps are stitched together to generate a global two-dimensional occupied grid map.

[0010] In one optional implementation, the step of using a one-dimensional Kalman filter to filter and smooth the original height sequence specifically includes: The state vector of a Kalman filter is defined as follows:

[0011] in, For state vectors, For a high rate of change, For the first Frame height; The state transition model of Kalman filtering adopts a constant velocity model.

[0012] In one optional implementation, the keyframe is divided into multiple compression units with consistent internal height using a dynamic programming method, specifically including: The intra-segment cost function for the interval [j, i] is defined as follows:

[0013] in, For from the first Frame to the The average height value of all keyframes between frames. For the interval [ Within [the area], the height of all keyframes is relative to the average height. The sum of squared errors, For the first Frame height; If the interval [ If the height difference between ] satisfies the following formula, then the allowed interval is [ As the same compression unit:

[0014] in, In the interval The maximum height difference between internal keyframes. For the first Frame to the The maximum height among all keyframe height values ​​in the frame. For the first Frame to the The minimum height among all keyframe height values ​​in the frame. The allowed height envelope threshold within the segment; The recurrence relation for dynamic programming is:

[0015] in, For the future The minimum total cost after dividing a frame into several segments. This is the cumulative cost of the previous stage. For interval The sum of squared fitting errors within the range, This is the penalty parameter.

[0016] In one optional implementation, the normal vector constraint is to ensure that the angle between the normal vector of the RANSAC fitting plane and the Z-axis is less than a preset maximum angle threshold. The height threshold is used to discard three-dimensional points whose height deviates from a preset range as non-ground points.

[0017] In one optional implementation, an adaptive threshold method is used to set the compression height range, specifically including: Calculate the set of height differences between the three-dimensional point cloud within the compression unit and the reference ground; Based on the set of height differences, quantiles are used to define the lower and upper limits of the compression range:

[0018]

[0019] in, Set of height differences The Quantiles The set of height differences Quantiles The lower limit height of the compression range. This represents the upper limit height of the compression range; Compression conditions are:

[0020] in, For the first point cloud The height difference of each point relative to the reference ground; The three-dimensional point cloud that meets the above compression height range is taken as the point set to be projected.

[0021] In one optional implementation, the stitching of the various two-dimensional local sub-images includes translation adjustment and weighted fusion: Translate and align adjacent subgraphs at the boundaries:

[0022] in, Let Δ be the two-dimensional coordinates of a point in the second compression unit. This refers to the translation compensation amount in a two-dimensional coordinate system. For regions with overlapping boundaries In such cases, a weighted average is used for fusion: Let the occupancy probabilities of points at the same location in adjacent subgraphs be respectively and The result after fusion is:

[0023] in, This represents the probability value of the merged entity in the global 2D map. for In the child Figure 1 The probability of occupancy in for In the child Figure 2 The probability of occupancy in.

[0024] In an optional implementation, the stitching further includes a global optimization and correction step, specifically including: Using the set of key points formed by stitching together all two-dimensional local subgraphs as the optimization variable, the following error minimization function is constructed:

[0025] in, This is the global splicing error function. , In the unit respectively With unit The coordinate vector of the key point at the corresponding position in the middle. For the set of adjacent unit pairs, For the unit To unit Boundary alignment transformation; Based on minimizing the error function, the positions of all key points are globally optimized.

[0026] A second aspect of this invention provides an adaptive compression device for three-dimensional maps of a quadruped robot in complex terrain, the device comprising: The sequence extraction module is used to acquire a 3D point cloud map, extract the Z-axis height information of each keyframe in the 3D point cloud map, and obtain the original height sequence. The sequence preprocessing module is used to filter and smooth the original height sequence to obtain a smoothed height sequence. An adaptive partitioning module is used to divide the keyframe into multiple compressed units with consistent internal height based on the smooth height sequence using a dynamic programming method. The reference plane determination module is used to identify initial ground points for each compression unit using the RANSAC plane fitting method, and to remove non-ground points by combining normal vector constraints and height thresholds to obtain optimized ground points. The reference ground height for each compression unit is then determined based on the optimized ground points. The compression range calculation module is used to set a compression height range based on the reference ground height, and to take the three-dimensional point cloud within the compression height range as the set of points to be projected. The projection compression module is used to perform orthophoto projection on the set of points to be projected, and generate a two-dimensional local subgraph corresponding to each compression unit. The map fusion module is used to stitch together various two-dimensional local sub-maps to generate a global two-dimensional occupied grid map.

[0027] A third aspect of the present invention provides an electronic device, characterized in that it includes: a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement an adaptive compression method for three-dimensional maps of a quadruped robot in complex terrain.

[0028] A fourth aspect of this invention provides a computer-readable storage medium, characterized in that a computer program is stored on the computer-readable storage medium, and the computer program, when executed by a processor, is a method for adaptive compression of three-dimensional maps of a quadruped robot in complex terrain.

[0029] This application has at least the following advantages or beneficial effects: This invention achieves a significant reduction in map dimensionality and data complexity by segmenting and compressing 3D maps in complex industrial environments such as factories and workshops, while maintaining the overall geometric topology. This avoids the severe distortion and information loss caused by traditional fixed-height slicing methods. Preprocessing filtering and smoothing ensure stable height data, while dynamic programming-based keyframe aggregation improves the rationality of cell partitioning. RANSAC plane fitting and normal vector constraints enable robust identification of ground planes in complex scenarios. Fixed or adaptive threshold settings for the compression range ensure that the map filters out irrelevant height disturbances while maintaining slope continuity. Finally, boundary translation, weighted fusion, and global optimization in the cross-group merging stage guarantee the continuity and consistency of the 2D map. This method not only generates 2D occupancy grid maps suitable for quadruped robot navigation and obstacle avoidance but also allows for the reasonable marking of 3D tall obstacles within the 2D map, thereby enhancing the quadruped robot's autonomous localization, path planning, and safe operation capabilities in industrial environments. Attached Figure Description

[0030] To more clearly illustrate the technical solutions of the embodiments of this application, the drawings used in the description of the embodiments of this application will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0031] Figure 1 This is a flowchart of an embodiment of a method for adaptive compression of 3D maps for quadruped robots in complex terrain, as proposed in this application. Figure 2 This is a schematic diagram of the overall structure of a quadruped inspection robot proposed in one embodiment of this application; Figure 3 This is a schematic diagram of the original 3D environment map generated by SLAM according to an embodiment of this application; Figure 4 This is a comparison diagram of the results of the fixed slicing method proposed in an embodiment of this application and the compression method of the present invention; Figure 5 This is a schematic diagram of the two-dimensional raster map result generated by the present invention according to an embodiment of this application; Figure 6 This is a structural diagram of a three-dimensional map adaptive compression device for a quadruped robot in complex terrain, as proposed in one embodiment of this application. Figure 7 This is a schematic diagram of an electronic device according to this application. Detailed Implementation

[0032] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0033] Please refer to Figure 1 , Figure 1 This is a flowchart illustrating an adaptive 3D map compression method for a quadruped robot in complex terrain, as proposed in one embodiment of this application. Figure 1 As shown, an adaptive compression method for 3D maps of a quadruped robot in complex terrain includes: S110: Obtain a 3D point cloud map, extract the Z-axis height information of each keyframe in the 3D point cloud map, and obtain the original height sequence; S120: Filter and smooth the original height sequence to obtain a smoothed height sequence; In this embodiment, the 3D environment map generated by the SLAM system is first preprocessed. In this stage, the system traverses all keyframes, unifies the coordinate system, and extracts the Z-axis height value for each frame. Since workshop environments often involve ground vibrations, equipment operation-induced jitter, and sensor positioning errors, this stage also requires filtering and smoothing of the height sequence, achieved using a one-dimensional Kalman filter method.

[0034] The process of filtering and smoothing the original height sequence using a one-dimensional Kalman filter specifically includes: S121: The state vector of the Kalman filter is defined as follows:

[0035] in, For state vectors, For a high rate of change, For the first Frame height; The state transition model of the Kalman filter adopts a constant velocity model:

[0036] in The time interval between adjacent keyframes. This is process noise; The observation equation is:

[0037] in, The height value measured by the sensor. To observe noise; S122: In the filtering recursion process, the state estimate at the current time is first obtained through the prediction equation, then the innovation is calculated by combining the observation equation, and updated using the Kalman gain.

[0038] in, For at any time The optimal state estimation vector obtained by combining the current observations is as follows. For the observation matrix, take only the height measurement. =

[10] .

[0039] Kalman gain matrix The calculation formula is:

[0040] in, To predict the covariance matrix, representing the uncertainty of the current prediction state, To observe the noise covariance, which reflects the magnitude of the sensor measurement error.

[0041] Through the above update process, the weights of predicted and observed values ​​can be dynamically balanced at each moment, achieving real-time smoothing and accurate estimation of height information.

[0042] S130: Based on the smooth height sequence, the keyframe is divided into multiple compressed units with consistent internal height using a dynamic programming method; In this embodiment, the factory workshop environment consists mostly of flat ground, but may contain discontinuous structures such as ramps, ditches, or elevated platforms. To avoid projection distortion caused by these abrupt height changes, this invention employs a dynamic programming strategy, promptly segmenting and compressing units when height changes exceed a set threshold. If the quadruped robot's trajectory crosses different floors or steps, and the height difference between consecutive keyframes exceeds a preset range (e.g., 0.5 to 0.8 meters), the system automatically terminates the current unit and starts a new unit to ensure that the height difference within each unit remains within a controllable range.

[0043] The keyframe is divided into multiple compression units with consistent internal height using a dynamic programming method, specifically including: S131: Let the first The timestamp of the frame is Assuming the height remains essentially constant within each segment, the average height of all keyframes in that segment is used to represent the overall height change of the segment. The segment cost function for the interval [j, i] is defined as follows:

[0044]

[0045] in, For from the first Frame to the The average height value of all keyframes between frames. For the interval [ Within [the area], the height of all keyframes is relative to the average height. The sum of squared errors, For the first Frame height; S132: To suppress excessive segmentation, a penalty parameter is applied to each newly created segment. Meanwhile, in order to keep the ground undulations controllable for each segment in the workshop environment, a criterion is introduced to determine whether the area can be approximately flattened into the same horizontal plane.

[0046] If the interval [ If the height difference between ] satisfies the following formula, then the allowed interval is [ As the same compression unit:

[0047] in, In the interval The maximum height difference between internal keyframes. For the first Frame to the The maximum height among all keyframe height values ​​in the frame. For the first Frame to the The minimum height among all keyframe height values ​​in the frame. The allowed height envelope threshold within the segment; The recurrence relation for dynamic programming is:

[0048] in, For the future The minimum total cost after dividing a frame into several segments. This is the cumulative cost of the previous stage. For interval The sum of squared fitting errors within the range, This is the penalty parameter.

[0049] S140: For each compression unit, the initial ground points are identified by the RANSAC plane fitting method. Non-ground points are eliminated by combining normal vector constraints and height thresholds to obtain optimized ground points. The reference ground height of each compression unit is determined based on the optimized ground points. In this embodiment, the factory and workshop environment contains numerous pillars, pipes, and mechanical equipment, all of which interfere with ground detection. Therefore, this invention employs a RANSAC-based plane fitting method as the core algorithm, combined with normal vector constraints and height thresholds to eliminate non-ground points. Specifically, RANSAC estimates candidate planes by randomly selecting a small number of points, then iteratively searches for a plane model containing the most ground points, using this plane as the reference ground for each element. Through these steps, the system can reliably estimate the reference ground height for each element.

[0050] S141: Randomly select three non-collinear points from the point cloud ( , , ), which are respectively , The plane normal vector is calculated by solving the following determinant. :

[0051] And from this, we can obtain the plane equation:

[0052] For any point ( , , Its distance to the plane is defined as:

[0053] like If the distance is less than or equal to ε, then the point is considered an in-plane point, where ε is a set distance threshold. By repeatedly sampling and evaluating in-plane points within the maximum number of iterations N, the plane model with the largest number of in-plane points is finally selected as the ground plane of the compression unit.

[0054] S142: Based on this, further combine normal vector constraints Ensure that the angle between the normal vector of the fitting plane and the Z-axis is less than a preset threshold. max The algorithm then incorporates a height threshold to eliminate unreasonable candidate planes. The resulting plane equations (A, B, C, D) are used to calculate the reference ground height of the unit, providing input for subsequent compression range calculations.

[0055] S150: Based on the reference ground height, set a compression height range, and take the three-dimensional point cloud within the compression height range as the point set to be projected; In this embodiment, an adaptive threshold method is used to set the compression height range, specifically including: S151: Calculate the set of height differences between the 3D point cloud within the compression unit and the reference ground level.

[0056] After obtaining the height difference of each point relative to the ground, set the allowable flattening height range [- ,+ When satisfied. At that time, the point is considered to be within the compressible region and mapped onto the reference ground:

[0057] in, The height of the reference plane at this horizontal position.

[0058] S152: For areas with significant slopes or undulations, an adaptive threshold method can be used, based on the set of height differences { ,..., Use quantiles to define the lower and upper limits of the compression range:

[0059]

[0060] in, Set of height differences The Quantiles The set of height differences Quantiles The lower limit height of the compression range. This represents the upper limit height of the compression range; Compression conditions are:

[0061] in, For the first point cloud The height difference of each point relative to the reference ground.

[0062] S153: After the compression range is determined, the system performs compression operations on the compression unit. Specifically, the point cloud data is orthographically projected, mapping the three-dimensional coordinates of each point to a two-dimensional plane, retaining only the position information of the horizontal plane, thereby generating the corresponding two-dimensional map.

[0063] S160: Perform orthophoto projection on the set of points to be projected to generate a two-dimensional local subgraph corresponding to each compression unit; S170: Stitch together the various two-dimensional local sub-maps to generate a global two-dimensional occupied grid map.

[0064] In this embodiment, since there may be slight differences in the reference height of each unit, alignment and transition processing are required when stitching the boundaries. The stitching of the various two-dimensional local sub-images includes translation adjustment and weighted fusion: S171: Let the reference ground heights of two adjacent units be respectively To and The difference is:

[0065] S172: Translation adjustment to align adjacent subgraphs at the boundary:

[0066] in, Let Δ be the two-dimensional coordinates of a point in the second compression unit. This refers to the translation compensation amount in a two-dimensional coordinate system. S173: For regions with overlapping boundaries In such cases, a weighted average is used for fusion: Let the occupancy probabilities of points at the same location in adjacent subgraphs be respectively and The result after fusion is: ,

[0067] in, This represents the probability value of the merged entity in the global 2D map. for In the child Figure 1 The probability of occupancy in for In the child Figure 2 The occupancy probability and weights satisfy the following conditions: + =1, and can be dynamically adjusted according to the distance from the point to the boundary.

[0068] Furthermore, the normal vector constraint ensures that the angle between the normal vector of the RANSAC-fitted plane and the Z-axis is less than a preset maximum angle threshold. The height threshold is used to discard three-dimensional points whose height deviates from a preset range as non-ground points.

[0069] Furthermore, the stitching also includes a global optimization and correction step, specifically including: Using the set of key points formed by stitching together all two-dimensional local subgraphs as the optimization variable, the following error minimization function is constructed:

[0070] in, This is the global splicing error function. , In the unit respectively With unit The coordinate vector of the key point at the corresponding position in the middle. For the set of adjacent unit pairs, For the unit To unit Boundary alignment transformation; Based on minimizing the error function, the positions of all key points are globally optimized.

[0071] In this embodiment, by minimizing E, uniform distribution of gaps and optimization of map continuity are achieved globally. After the above translation compensation, weighted fusion and global optimization, the final two-dimensional map retains the geometric accuracy of each unit and achieves overall coherence, which can be directly applied to quadruped robot path planning in factory and workshop environments.

[0072] Please refer to Figure 6 , Figure 6 This is a structural diagram of a 3D map adaptive compression device for a quadruped robot in complex terrain, proposed in one embodiment of this application. Figure 6 As shown in the figure, this disclosure also provides an adaptive compression device for three-dimensional maps of a quadruped robot in complex terrain. The device includes: a sequence extraction module 601, a sequence preprocessing module 602, an adaptive partitioning module 603, a reference plane determination module 604, a compression range calculation module 605, a projection compression module 606, and a map fusion module 607; wherein, The sequence extraction module 601 is used to acquire a 3D point cloud map, extract the Z-axis height information of each key frame in the 3D point cloud map, and obtain the original height sequence. The sequence preprocessing module 602 is used to filter and smooth the original height sequence to obtain a smooth height sequence. The adaptive partitioning module 603 is used to divide the keyframe into multiple compressed units with consistent internal height based on the smooth height sequence using a dynamic programming method. The reference plane determination module 604 is used to identify initial ground points for each compression unit using the RANSAC plane fitting method, eliminate non-ground points by combining normal vector constraints and height thresholds to obtain optimized ground points, and determine the reference ground height for each compression unit based on the optimized ground points. The compression range calculation module 605 is used to set a compression height range based on the reference ground height, and to take the three-dimensional point cloud within the compression height range as the set of points to be projected. The projection compression module 606 is used to perform orthophoto projection on the set of points to be projected, and generate a two-dimensional local sub-graph corresponding to each compression unit. The map fusion module 607 is used to stitch together various two-dimensional local sub-maps to generate a global two-dimensional occupied grid map.

[0073] This disclosure also provides an electronic device, please refer to... Figure 7 , Figure 7 This is a schematic diagram of an electronic device illustrated in an embodiment of this disclosure. For example... Figure 7 As shown, the electronic device 100 includes a memory 110 and a processor 120. The memory 110 and the processor 120 are connected via a bus for communication. The memory 110 stores a computer program that can run on the processor 120 to implement the steps in the adaptive compression method for three-dimensional maps of a quadruped robot in complex terrain disclosed in this embodiment.

[0074] The disclosed embodiments also provide a computer-readable storage medium that, when the instructions in the computer-readable storage medium are executed by a processor of a computer device, enables the computer device to perform steps in the adaptive compression method for three-dimensional maps of a quadruped robot in complex terrain as described in the embodiments of this disclosure.

[0075] Example 1, please refer to Figure 2 A quadrupedal inspection robot for indoor structured environments is equipped with LiDAR, a camera, an infrared gimbal, an industrial computer, and gas sensors. After the aforementioned translation compensation, weighted fusion, and global optimization, a final two-dimensional map is obtained. (Example:) Figure 5 As shown, it retains the geometric accuracy of each unit while achieving overall coherence, and can be directly applied to quadruped robot path planning in factory and workshop environments.

[0076] This application describes embodiments with reference to flowchart illustrations and / or block diagrams of methods, apparatuses, electronic devices, and computer program products according to embodiments of this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing terminal device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal device, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0077] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing terminal device to operate in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0078] These computer program instructions can also be loaded onto a computer or other programmable data processing terminal equipment, causing a series of operational steps to be performed on the computer or other programmable terminal equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable terminal equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0079] Although preferred embodiments of the present application have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments as well as all changes and modifications falling within the scope of the embodiments of the present application.

[0080] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. The same or similar parts between the various embodiments can be referred to each other.

[0081] Although preferred embodiments of the present application have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments as well as all changes and modifications falling within the scope of the embodiments of the present application.

[0082] Finally, it should be noted that in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or terminal device that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or terminal device. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or terminal device that includes said element.

[0083] The above provides a detailed description of the adaptive compression method for 3D maps of quadruped robots in complex terrain provided by this application. Specific examples have been used to illustrate the principles and implementation methods of this application. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A method for adaptive compression of three-dimensional maps of quadruped robots in complex terrain, characterized by, include: Obtain a 3D point cloud map, extract the Z-axis height information of each keyframe in the 3D point cloud map, and obtain the original height sequence; The original height sequence is filtered and smoothed to obtain a smoothed height sequence. Based on the smooth height sequence, the keyframe is divided into multiple compressed units with consistent internal height using a dynamic programming method. For each compression unit, initial ground points are identified using the RANSAC plane fitting method. Non-ground points are then eliminated by combining normal vector constraints and height thresholds to obtain optimized ground points. The reference ground height for each compression unit is then determined based on these optimized ground points. Based on the reference ground height, a compression height range is set, and the three-dimensional point cloud within this compression height range is used as the set of points to be projected. Orthographic projection is performed on the set of points to be projected to generate a two-dimensional local subgraph corresponding to each compression unit; The various two-dimensional local sub-maps are stitched together to generate a global two-dimensional occupied grid map; An adaptive threshold method is used to set the compression height range, specifically including: Calculate the set of height differences between the three-dimensional point cloud within the compression unit and the reference ground; After obtaining the height difference of each point to the ground, set the height range allowed to be flattened ]; when is satisfied, the point is considered to be in the compressible range and is mapped to the reference ground;​ Based on the set of height differences, quantiles are used to define the lower and upper limits of the compression range: wherein, is the set of height differences is the th quantile of the set of height differences, is the th quantile of the set of height differences, is the lower limit height of the compression range, is the upper limit height of the compression range; Compression conditions are: in, For the first point cloud The height difference of each point relative to the reference ground; The three-dimensional point cloud that meets the above compression height range is taken as the point set to be projected.

2. The adaptive compression method for three-dimensional maps of quadruped robots in complex terrain according to claim 1, characterized in that, The original height sequence is filtered and smoothed using a one-dimensional Kalman filter method, specifically including: The state vector of a Kalman filter is defined as follows: in, For state vectors, For a high rate of change, For the first Frame height; The state transition model of Kalman filtering adopts a constant velocity model.

3. The adaptive compression method for three-dimensional maps of quadruped robots in complex terrain according to claim 1, characterized in that, The keyframe is divided into multiple compression units with consistent internal height using a dynamic programming method, specifically including: The intra-segment cost function for the interval [j, i] is defined as follows: in, For from the first Frame to the The average height value of all keyframes between frames. For the interval [ Within [the area], the height of all keyframes is relative to the average height. The sum of squared errors, For the first Frame height; If the interval [ If the height difference between ] satisfies the following formula, then the allowed interval is [ As the same compression unit: in, In the interval The maximum height difference between internal keyframes. For the first Frame to the The maximum height among all keyframe height values ​​in the frame. For the first Frame to the The minimum height among all keyframe height values ​​in the frame. The allowed height envelope threshold within the segment; The recurrence relation for dynamic programming is: in, For the future The minimum total cost after dividing a frame into several segments. This is the cumulative cost of the previous stage. For interval The sum of squared fitting errors within the range, This is the penalty parameter.

4. The adaptive compression method for three-dimensional maps of quadruped robots in complex terrain according to claim 1, characterized in that, The normal vector constraint is to ensure that the angle between the normal vector of the RANSAC fitting plane and the Z-axis is less than a preset maximum angle threshold. The height threshold is used to discard three-dimensional points whose height deviates from a preset range as non-ground points.

5. The adaptive compression method for three-dimensional maps of quadruped robots in complex terrain according to claim 1, characterized in that, The process of stitching together the various two-dimensional local sub-images includes translation adjustment and weighted fusion: Translate and align adjacent subgraphs at the boundaries: in, Let Δ be the two-dimensional coordinates of a point in the second compression unit. This refers to the translation compensation amount in a two-dimensional coordinate system. For regions with overlapping boundaries In such cases, a weighted average is used for fusion: Let the occupancy probabilities of points at the same location in adjacent subgraphs be respectively and The result after fusion is: in, This represents the probability value of the merged entity in the global 2D map. for Occupancy probability in subgraph 1 for Occupancy probability in subgraph 2.

6. The adaptive compression method for three-dimensional maps of a quadruped robot in complex terrain according to claim 5, characterized in that, The splicing process also includes a global optimization and correction step, specifically including: Using the set of key points formed by stitching together all two-dimensional local subgraphs as the optimization variable, the following error minimization function is constructed: in, This is the global splicing error function. , In the unit respectively With unit The coordinate vector of the key point at the corresponding position in the middle. For the set of adjacent unit pairs, For the unit To unit Boundary alignment transformation; Based on minimizing the error function, the positions of all key points are globally optimized.

7. The adaptive compression device for three-dimensional maps of a quadruped robot in complex terrain according to any one of claims 1-6, characterized in that, The device includes: The sequence extraction module is used to acquire a 3D point cloud map, extract the Z-axis height information of each keyframe in the 3D point cloud map, and obtain the original height sequence. The sequence preprocessing module is used to filter and smooth the original height sequence to obtain a smoothed height sequence. An adaptive partitioning module is used to divide the keyframe into multiple compressed units with consistent internal height based on the smooth height sequence using a dynamic programming method. The reference plane determination module is used to identify initial ground points for each compression unit using the RANSAC plane fitting method, and to remove non-ground points by combining normal vector constraints and height thresholds to obtain optimized ground points. The reference ground height for each compression unit is then determined based on the optimized ground points. The compression range calculation module is used to set a compression height range based on the reference ground height, and to take the three-dimensional point cloud within the compression height range as the set of points to be projected. The projection compression module is used to perform orthophoto projection on the set of points to be projected, and generate a two-dimensional local subgraph corresponding to each compression unit. The map fusion module is used to stitch together various two-dimensional local sub-maps to generate a global two-dimensional occupied grid map.

8. An electronic device, characterized in that, include: A processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the program, implements the method for adaptive compression of three-dimensional maps of a quadruped robot in complex terrain as described in any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the adaptive compression method for three-dimensional maps of a quadruped robot in complex terrain as described in any one of claims 1 to 6.