CN112762937A - 2D laser sequence point cloud registration method based on occupancy grid - Google Patents

2D laser sequence point cloud registration method based on occupancy grid Download PDF

Info

Publication number
CN112762937A
CN112762937A CN202011550771.XA CN202011550771A CN112762937A CN 112762937 A CN112762937 A CN 112762937A CN 202011550771 A CN202011550771 A CN 202011550771A CN 112762937 A CN112762937 A CN 112762937A
Authority
CN
China
Prior art keywords
points
laser
point cloud
time
girdmap
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202011550771.XA
Other languages
Chinese (zh)
Other versions
CN112762937B (en
Inventor
陈智君
伍永健
郝奇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wuhu Robot Technology Research Institute of Harbin Institute of Technology
Original Assignee
Wuhu Robot Technology Research Institute of Harbin Institute of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Wuhu Robot Technology Research Institute of Harbin Institute of Technology filed Critical Wuhu Robot Technology Research Institute of Harbin Institute of Technology
Priority to CN202011550771.XA priority Critical patent/CN112762937B/en
Publication of CN112762937A publication Critical patent/CN112762937A/en
Application granted granted Critical
Publication of CN112762937B publication Critical patent/CN112762937B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/20Instruments for performing navigational calculations
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/28Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
    • G01C21/30Map- or contour-matching
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01SRADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S17/00Systems using the reflection or reradiation of electromagnetic waves other than radio waves, e.g. lidar systems
    • G01S17/02Systems using the reflection of electromagnetic waves other than radio waves
    • G01S17/06Systems determining position data of a target
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01SRADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S17/00Systems using the reflection or reradiation of electromagnetic waves other than radio waves, e.g. lidar systems
    • G01S17/88Lidar systems specially adapted for specific applications
    • G01S17/89Lidar systems specially adapted for specific applications for mapping or imaging
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00Image analysis
    • G06T7/30Determination of transform parameters for the alignment of images, i.e. image registration

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Automation & Control Theory (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Theoretical Computer Science (AREA)
  • Optical Radar Systems And Details Thereof (AREA)

Abstract

The invention discloses a 2D laser sequence point cloud registration method based on an occupied grid, which comprises the following steps: s1 points based on two adjacent frames of laser pointst‑1And pointstGenerating corresponding grid map girdmapt‑1And girdmapt(ii) a S2, traversing all candidate poses in the whole search window according to the displacement step length and the angle step length, projecting the laser frame point cloud at the T moment to a grid map based on the candidate poses, and projecting the candidate pose T (theta, T) with the highest scorex,ty) As an initial pose; s3, generating t-1 moment based on initial poseTransformation matrix T '(theta', T ') from point cloud to point cloud at time T'x,t′y) Based on a transformation matrix T ' (θ ', T 'x,t′y) The laser frame point clouds points at the time ttOccupancy grid map girdmap projected to time t-1t‑1In the method, the laser frame point clouds points at the time of t-1 are addedt‑1Occupation grid map girdmap projected to time ttPerforming the following steps; s4, points of sequence pointtAnd pointst‑1And constructing an objective function by all the laser points, and taking the pose corresponding to the lowest cost of the objective function as the pose of the current time t. The method has low requirements on the number and the quality of point clouds, high computing speed and high matching precision.

Description

2D laser sequence point cloud registration method based on occupancy grid
Technical Field
The invention belongs to the technical field of positioning, and particularly relates to a 2D laser sequence point cloud registration method based on an occupation grid.
Background
As mobile robots are applied more and more widely in the fields of service and warehouse logistics, the autonomous positioning navigation technology is more and more important. The technologies mainly applied at present are magnetic navigation, two-dimensional code navigation and laser navigation, wherein the magnetic navigation is suitable for the environment with a relatively fixed working track, and an electromagnetic wire or a magnetic strip needs to be laid on a path. Although the two-dimensional code navigation has a free track, a large number of two-dimensional codes need to be pasted on the path, and regular maintenance is needed. The laser navigation positioning is accurate, the path is flexible and changeable, other positioning facilities are not needed, and the method is suitable for various field environments, so that the method becomes a mainstream positioning navigation mode of the mobile robot.
In positioning and navigation applications based on 2d laser radar, the motion amount of a mobile robot is generally calculated by using adjacent frame point cloud registration to obtain the pose of the robot or assist the robot in positioning. The existing 2d laser radar point cloud registration scheme is mainly an NDT point cloud registration method, wherein a reference frame point cloud is rasterized, a normal distribution PDF parameter is calculated, and a least square optimization problem is established through probability score of a target point cloud on a grid.
Firstly, dividing the space occupied by reference frame point cloud into grids or voxels with specified sizes, and calculating the multi-dimensional normal distribution parameter PDF of each grid; secondly, calculating a probability distribution model of the grid, and calculating the center (each axis mean value) of a contained point in the grid and a covariance matrix; then, projecting the point cloud to be registered under a reference coordinate system (the coordinate system of the reference point cloud is usually the previous frame), calculating the probability of each conversion point falling in the corresponding grid according to the normal distribution parameters, and calculating the sum of the probabilities of the corresponding point cloud falling in the corresponding grid; and finally, optimizing the objective function according to a Newton optimization algorithm, namely searching a transformation parameter to enable the value of the final score to be maximum, and repeating iteration until convergence. This solution has two disadvantages:
1) for the structured point cloud, the NDT does not assume the Gaussian distribution of a grid, and the effect is not good;
2) the accuracy of rigid body transformation between two frames of point clouds obtained by calculation is not enough.
Disclosure of Invention
The invention provides a grid-occupied-based 2D laser sequence point cloud registration method, aiming at improving the problems.
The invention is realized in such a way that a 2D laser sequence point cloud registration method based on an occupied grid specifically comprises the following steps:
s1 points based on two adjacent frames of laser pointst-1And pointstGenerating corresponding grid map girdmapt-1And girdmapt
S2, traversing all candidate poses in the whole search window according to the displacement step length and the angle step length, and projecting the laser frame point cloud at the moment t to a girdmap of a grid map based on the candidate posest-1The candidate pose T (theta, T) with the highest scorex,ty) As an initial pose;
s3, generating a transformation matrix T '(theta', T ') from the point cloud at the T-1 moment to the point cloud at the T moment based on the initial pose'x,t′y) Based on a transformation matrix T ' (θ ', T 'x,t′y) The laser frame point clouds points at the time ttOccupancy grid map girdmap projected to time t-1t-1In the method, the laser frame point clouds points at the time of t-1 are addedt-1Occupation grid map girdmap projected to time ttPerforming the following steps;
s4, points of sequence pointtAnd pointst-1All the laser points construct an objective function, and the minimum of the objective function is determinedAnd taking the corresponding cost pose as the pose at the current time t.
Further, the objective function is specifically as follows:
Figure BDA0002857678710000021
Si(xi) representing laser point clouds pointst-1And pointstTransforming the ith laser point to the grid map coordinate system, M (S)i(ξ)) represents the probability that the ith laser point is occupied at the location on the corresponding grid map.
Further, before step S1, the method further includes:
point cloud filtering: and removing outliers in the point cloud by using a statistical probability filter, and reducing the density of the point cloud on the basis of ensuring the microscopic characteristics of the point cloud by using a voxel filter.
The grid-occupied-based 2D laser sequence point cloud registration method has the following beneficial effects:
1) the requirements on the number and the quality of point clouds are low, the computing speed is high, and the matching precision is high;
2) the rough pose of the registration of the adjacent point clouds can be quickly found through correlation matching, the calculated amount is small, the calculating speed is high, and an initial value is provided for subsequent fine matching. The nonlinear optimization matching can obtain a high-precision matching result through continuous iteration through a unified matching cost function. Compared with an ICP (inductively coupled plasma) matching algorithm, the method can obtain a better matching result without providing an initial value, the matching precision of the algorithm is higher compared with an NDT (normalized data aided test) matching algorithm, and compared with the two algorithms, the algorithm has the advantages of lower required point cloud number and higher adaptability to different devices under the condition of the same precision.
Drawings
Fig. 1 is a flowchart of a grid-occupied-based 2D laser sequence point cloud registration method according to an embodiment of the present invention.
Detailed Description
The following detailed description of the embodiments of the present invention will be given in order to provide those skilled in the art with a more complete, accurate and thorough understanding of the inventive concept and technical solutions of the present invention.
The invention aims to solve the problem of how to efficiently and accurately calculate the motion amount of the mobile robot by using the sequence 2d laser point cloud in the positioning and navigation process of the mobile robot, thereby realizing or assisting the mobile robot to calculate the position of the mobile robot. The sequence point cloud refers to laser point cloud scanned by a radar in sequence, and the method aims at adjacent frame matching of the sequence point cloud. Knowing the points of neighboring pointst-1And pointstWherein pointst-1Points of the laser frame at time t-1tThe laser frame point cloud is the time t, wherein the time t is the current time, and the time t-1 is the last time.
Fig. 1 is a flowchart of a 2D laser sequence point cloud registration method based on an occupancy grid according to an embodiment of the present invention, where the method specifically includes the following steps:
step 1) point cloud filtering: the original laser point cloud has some obvious outliers, which easily causes mismatching, so that the outliers in the point cloud are removed by using a statistical probability filter. In addition, the radar sampling rate is generally very high, thousands of points exist in one frame of laser point cloud, the calculation time is consumed in the point cloud matching process, the voxel filter is used, the density of the point cloud is reduced on the basis of ensuring the microscopic characteristics of the point cloud, and the matching efficiency is improved.
Step 2) generating a grid probability map: let the position of the laser point cloud be (0,0,0), and for each scanning beam, the starting point of one beam is known
Figure BDA0002857678710000041
And an end point
Figure BDA0002857678710000042
k is the number of grids the beam passes through, and the probability of the beam passing through the grids can be updated by using the log-of-superiority integration method. To pair
Figure BDA0002857678710000043
The occupied grid is updated, and the slave is updated
Figure BDA0002857678710000044
To
Figure BDA0002857678710000045
The grids passed by are freely updated. The freely updated value oddsFree is set to 0.4 and the updated value oddsoc is taken to 0.6. Given that the occupation probability of the current grid is p, the odds value of the current grid is odds ═ log (p/(1-p)), if the current grid is updated freely, odds is made odds + oddsFree, if the current grid is updated, odds is made odds + oddsoc, and the occupation probability of the updated grid is p ═ exp (odds))/(exp (odds)) + 1). Respectively using two adjacent frames of laser point clouds pointst-1And pointstGenerating corresponding grid map girdmapt-1And girdmapt
Step 3) correlation scan matching
In order to avoid the situation that the fine matching based on the optimization falls into a local extreme value and causes a wrong matching result, an initial value needs to be calculated by using the correlation scanning matching, and the matching process is as follows:
a) generating a search window with a specified size by taking the pose at the time t-1 as a center, and calculating a linear _ search _ window of a displacement search window v/q and an angular search window angularjsearch _ window ω/q according to the maximum linear velocity v, the maximum angular velocity ω and the laser radar frequency q of the robot;
b) calculating a search step length, wherein the displacement search step length is a grid, and an angle search step length calculation formula is as follows:
angular_step=acos(1-r2/(2,max_d2))
wherein r is the resolution of the grid map, and max _ d is the farthest point distance of the current point cloud;
c) traversing all candidate poses in the whole search window according to the displacement step length and the angle step length, projecting the laser frame point cloud at the T moment into a grid map under each candidate pose, accumulating and calculating the occupation probability of a projection grid to obtain the score of the current candidate pose, and calculating the candidate pose T (theta, T) with the highest scorex,ty) And (5) taking the pose as an initial pose to enter the next calculation.
Step 4) matching based on optimization:
obtaining filtered adjacent laser frame point clouds points in the step 1)t-1And pointstStep 2) obtaining a girdmap of the occupied grid map generated by the adjacent frames of laser point cloudst-1And girdmaptCalculating to obtain the transformation T (theta, T) from the point cloud at the T-1 moment to the point cloud at the T moment in the step 3)x,ty) A transformation matrix T '(θ', T ') from the point cloud at time T to the point cloud at time T-1 can be calculated'x,t′y) Wherein
Figure BDA0002857678710000051
a) Based on a transformation matrix T ' (θ ', T 'x,t′y) Point clouds points at t momenttOccupancy grid map girdmap projected to time t-1t-1In the method, the point clouds points at the time of t-1 are putt-1Occupation grid map girdmap projected to time ttPerforming the following steps;
b) for sequence point clouds pointstAnd pointst-1All laser spots in (1) construct the following objective function:
Figure BDA0002857678710000052
Si(xi) representing laser point clouds pointst-1And pointstTransforming the ith laser point to the grid map coordinate system, M (S)i(ξ)) represents the probability that the ith laser point is occupied at the position on the corresponding grid map, thus transforming the pose calculation into a least squares solution problem;
c) calculating a score M (S) for each point using the bicubic differencei(xi)), and for M (S)i(xi)) calculating partial derivatives, converting the least square solution of pose calculation into an iterative pose incremental calculation problem, and taking the pose with the lowest least square cost as the position of the current time tPosture.
The grid-occupied-based 2D laser sequence point cloud registration method has the following beneficial effects:
1) the requirements on the number and the quality of point clouds are low, the computing speed is high, and the matching precision is high;
2) the rough pose of the registration of the adjacent point clouds can be quickly found through correlation matching, the calculated amount is small, the calculating speed is high, and an initial value is provided for subsequent fine matching. The nonlinear optimization matching can obtain a high-precision matching result through continuous iteration through a unified matching cost function. Compared with an ICP (inductively coupled plasma) matching algorithm, the method can obtain a better matching result without providing an initial value, the matching precision of the algorithm is higher compared with an NDT (normalized data aided test) matching algorithm, and compared with the two algorithms, the algorithm has the advantages of lower required point cloud number and higher adaptability to different devices under the condition of the same precision.
The invention is not limited by the above-mentioned manner, and various insubstantial modifications of the inventive concept and solution are possible, or the inventive concept and solution can be directly applied to other applications without modification.

Claims (3)

1. A2D laser sequence point cloud registration method based on an occupied grid is characterized by comprising the following steps:
s1 points based on two adjacent frames of laser pointst-1And pointstGenerating corresponding grid map girdmapt-1And girdmapt
S2, traversing all candidate poses in the whole search window according to the displacement step length and the angle step length, and projecting the laser frame point cloud at the moment t to a girdmap of a grid map based on the candidate posest-1The candidate pose T (theta, T) with the highest scorex,ty) As an initial pose;
s3, generating a transformation matrix T '(theta', T ') from the point cloud at the T-1 moment to the point cloud at the T moment based on the initial pose'x,t′y) Based on a transformation matrix T ' (θ ', T 'x,t′y) Laser at time tPoints of frame pointtOccupancy grid map girdmap projected to time t-1t-1In the method, the laser frame point clouds points at the time of t-1 are addedt-1Occupation grid map girdmap projected to time ttPerforming the following steps;
s4, points of sequence pointtAnd pointst-1And constructing an objective function by all the laser points, and taking the pose corresponding to the lowest cost of the objective function as the pose of the current time t.
2. The grid-occupancy-based 2D laser sequence point cloud registration method of claim 1, wherein the objective function is specifically as follows:
Figure FDA0002857678700000011
Si(xi) representing laser point clouds pointst-1And pointstTransforming the ith laser point to the grid map coordinate system, M (S)i(ξ)) represents the probability that the ith laser point is occupied at the location on the corresponding grid map.
3. The grid-occupancy-based 2D laser sequence point cloud registration method of claim 1, further comprising, prior to step S1:
point cloud filtering: and removing outliers in the point cloud by using a statistical probability filter, and reducing the density of the point cloud on the basis of ensuring the microscopic characteristics of the point cloud by using a voxel filter.
CN202011550771.XA 2020-12-24 2020-12-24 2D laser sequence point cloud registration method based on occupied grids Active CN112762937B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011550771.XA CN112762937B (en) 2020-12-24 2020-12-24 2D laser sequence point cloud registration method based on occupied grids

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011550771.XA CN112762937B (en) 2020-12-24 2020-12-24 2D laser sequence point cloud registration method based on occupied grids

Publications (2)

Publication Number Publication Date
CN112762937A true CN112762937A (en) 2021-05-07
CN112762937B CN112762937B (en) 2023-11-21

Family

ID=75695541

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011550771.XA Active CN112762937B (en) 2020-12-24 2020-12-24 2D laser sequence point cloud registration method based on occupied grids

Country Status (1)

Country Link
CN (1) CN112762937B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113177974A (en) * 2021-05-19 2021-07-27 上海商汤临港智能科技有限公司 Point cloud registration method and device, electronic equipment and storage medium
CN113375683A (en) * 2021-06-10 2021-09-10 亿嘉和科技股份有限公司 Real-time updating method for robot environment map
CN113640822A (en) * 2021-07-07 2021-11-12 华南理工大学 High-precision map construction method based on non-map element filtering
CN113740864A (en) * 2021-08-24 2021-12-03 上海宇航系统工程研究所 Self-pose estimation method for soft landing tail segment of detector based on laser three-dimensional point cloud
CN114199281A (en) * 2021-12-13 2022-03-18 哈尔滨工业大学芜湖机器人产业技术研究院 Multi-sensor combined calibration method and system based on speed optimization

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170344015A1 (en) * 2016-05-24 2017-11-30 Baidu Online Network Technology (Beijing) Co., Ltd. Driverless vehicle, method, apparatus and system for positioning driverless vehicle
CN109974712A (en) * 2019-04-22 2019-07-05 广东亿嘉和科技有限公司 It is a kind of that drawing method is built based on the Intelligent Mobile Robot for scheming optimization
CN110221603A (en) * 2019-05-13 2019-09-10 浙江大学 A kind of long-distance barrier object detecting method based on the fusion of laser radar multiframe point cloud
CN111060888A (en) * 2019-12-31 2020-04-24 芜湖哈特机器人产业技术研究院有限公司 Mobile robot repositioning method fusing ICP and likelihood domain model

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170344015A1 (en) * 2016-05-24 2017-11-30 Baidu Online Network Technology (Beijing) Co., Ltd. Driverless vehicle, method, apparatus and system for positioning driverless vehicle
CN109974712A (en) * 2019-04-22 2019-07-05 广东亿嘉和科技有限公司 It is a kind of that drawing method is built based on the Intelligent Mobile Robot for scheming optimization
CN110221603A (en) * 2019-05-13 2019-09-10 浙江大学 A kind of long-distance barrier object detecting method based on the fusion of laser radar multiframe point cloud
CN111060888A (en) * 2019-12-31 2020-04-24 芜湖哈特机器人产业技术研究院有限公司 Mobile robot repositioning method fusing ICP and likelihood domain model

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
胡向勇;洪程智;吴世全;: "基于关键帧的点云建图方法", 热带地貌, no. 01 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113177974A (en) * 2021-05-19 2021-07-27 上海商汤临港智能科技有限公司 Point cloud registration method and device, electronic equipment and storage medium
CN113375683A (en) * 2021-06-10 2021-09-10 亿嘉和科技股份有限公司 Real-time updating method for robot environment map
CN113640822A (en) * 2021-07-07 2021-11-12 华南理工大学 High-precision map construction method based on non-map element filtering
CN113640822B (en) * 2021-07-07 2023-08-18 华南理工大学 High-precision map construction method based on non-map element filtering
CN113740864A (en) * 2021-08-24 2021-12-03 上海宇航系统工程研究所 Self-pose estimation method for soft landing tail segment of detector based on laser three-dimensional point cloud
CN113740864B (en) * 2021-08-24 2023-06-09 上海宇航系统工程研究所 Laser three-dimensional point cloud-based detector soft landing end-segment autonomous pose estimation method
CN114199281A (en) * 2021-12-13 2022-03-18 哈尔滨工业大学芜湖机器人产业技术研究院 Multi-sensor combined calibration method and system based on speed optimization

Also Published As

Publication number Publication date
CN112762937B (en) 2023-11-21

Similar Documents

Publication Publication Date Title
CN112762937B (en) 2D laser sequence point cloud registration method based on occupied grids
US11567502B2 (en) Autonomous exploration framework for indoor mobile robotics using reduced approximated generalized Voronoi graph
CN111429574B (en) Mobile robot positioning method and system based on three-dimensional point cloud and vision fusion
CN113409410B (en) Multi-feature fusion IGV positioning and mapping method based on 3D laser radar
CN112070770B (en) High-precision three-dimensional map and two-dimensional grid map synchronous construction method
CN109725327B (en) Method and system for building map by multiple machines
CN111060888B (en) Mobile robot repositioning method fusing ICP and likelihood domain model
CN110515094B (en) Robot point cloud map path planning method and system based on improved RRT
CN104778688A (en) Method and device for registering point cloud data
JP2023545279A (en) Fusion positioning method, apparatus, device, and computer readable storage medium
CN112859110B (en) Positioning navigation method based on three-dimensional laser radar
CN116109686A (en) Point cloud registration method, equipment and medium
CN115201849A (en) Indoor map building method based on vector map
CN112612034B (en) Pose matching method based on laser frame and probability map scanning
CN109636897B (en) Octmap optimization method based on improved RGB-D SLAM
CN117570968A (en) Map construction and maintenance method and device based on visual road sign and storage medium
CN117392268A (en) Laser scanning mapping method and system based on self-adaption combined CPD and ICP algorithm
CN112802089A (en) Point cloud skeleton line extraction method and system based on automatic estimation of bifurcation number
CN112710312B (en) Laser SLAM front end matching method integrating distance residual error and probability residual error
CN114563000B (en) Indoor and outdoor SLAM method based on improved laser radar odometer
CN113447026B (en) AMCL positioning method adapting to dynamic environment change
CN114202586A (en) 3D laser SLAM method and mobile robot based on octree chart and three-dimensional normal distribution optimization matching
CN113850304A (en) High-accuracy point cloud data classification segmentation improvement algorithm
Wang et al. A Review of Point Cloud Registration Methods Based on Laser SLAM
CN115290098B (en) Robot positioning method and system based on variable step length

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information

Address after: 241000 Office Building, National Industrial Robot Product Quality Supervision and Inspection Center Park, No. 17 Shenzhou Road, Jiujiang Economic and Technological Development Zone, Wuhu City, Anhui Province

Applicant after: Hart Robotics Industry Technology Research Institute in the Yangtze River Delta

Address before: 241000 office building of national industrial robot product quality supervision and inspection center, No.17 Shenzhou Road, Jiujiang Economic and Technological Development Zone, Wuhu City, Anhui Province

Applicant before: Wuhu Robot Industry Technology Research Institute of Harbin Institute of Technology

CB02 Change of applicant information
GR01 Patent grant
GR01 Patent grant