CN108960738B - Laser radar data clustering method under warehouse channel environment - Google Patents

Laser radar data clustering method under warehouse channel environment Download PDF

Info

Publication number
CN108960738B
CN108960738B CN201810784967.1A CN201810784967A CN108960738B CN 108960738 B CN108960738 B CN 108960738B CN 201810784967 A CN201810784967 A CN 201810784967A CN 108960738 B CN108960738 B CN 108960738B
Authority
CN
China
Prior art keywords
data point
point
data
laser radar
neighborhood
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.)
Active
Application number
CN201810784967.1A
Other languages
Chinese (zh)
Other versions
CN108960738A (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.)
Chongqing University
Original Assignee
Chongqing University
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 Chongqing University filed Critical Chongqing University
Priority to CN201810784967.1A priority Critical patent/CN108960738B/en
Publication of CN108960738A publication Critical patent/CN108960738A/en
Application granted granted Critical
Publication of CN108960738B publication Critical patent/CN108960738B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087Inventory or stock management, e.g. order filling, procurement or balancing against orders

Landscapes

  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Engineering & Computer Science (AREA)
  • Marketing (AREA)
  • Quality & Reliability (AREA)
  • Finance (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Accounting & Taxation (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Optical Radar Systems And Details Thereof (AREA)

Abstract

The invention discloses a laser radar data clustering method under a warehouse channel environment, which comprises the following steps: 1. initializing core point number m and neighborhood size sigma; 2. marking all data points in the set of measurement data points as an unvisited state; 3. selecting a data point p with an unvisited state according to the sequence, and marking the state of the point as visited; 4. calculating whether m core points are contained in the neighborhood sigma of the data point p, if so, turning to the next step, otherwise, marking the data point p as a noise point, and turning to the step 2; 5. setting the size of the threshold value sigma to be twice of the return value of the radar divergence model; 6. judging whether the next data point q in the sequence is in the neighborhood of the data point p, if not, turning to the step 2, otherwise, marking the data point q as visited, if the data point q is a core point, namely the neighborhood of the data q contains m data points, updating the threshold, adding the data point q into the cluster C, and turning to the step 5.

Description

Laser radar data clustering method under warehouse channel environment
Technical Field
The invention belongs to the field of environment modeling of mobile robots, and particularly discloses a laser radar data clustering method in a warehouse channel environment.
Background
The warehouse channel environment with the goods bags placed on two sides is a common scene in a warehouse. In the environment, the basis of robot positioning and navigation is to establish an environment model of a channel scene, a goods package is used as a necessary component in the environment model, and the accuracy of the model directly influences the accuracy of the environment model. The clustering algorithm is used as a primary step for extracting the goods package model, and the accuracy of model extraction is directly influenced by the clustering result. Therefore, the method has important significance in accurately clustering the laser radar data in the warehouse channel environment.
There is a fixed drift angle between the measured data points of the lidar, but the actual distance between the data points also depends on the distance between the sensor and the obstacle. In the warehouse passage environment, the laser radar has different measurement distances for different measurement angle distances of the same obstacle, which also causes different dispersion degrees of the laser radar data points. The different degrees of scatter of the data points of the same type cause clustering to become difficult to achieve in the warehouse aisle environment.
In the existing clustering algorithm research, the density clustering represented by K-means clustering and DBSCAN is most widely applied. The K-means clustering is most widely applied, but the incidence relation between adjacent data points of the laser radar is ignored by the K-means clustering algorithm, and the clustering number needs to be specified in advance by the algorithm. The DBCSCAN algorithm partitions data points using a fixed threshold, and this clustering approach is prone to erroneous partitioning of data point partitions due to the characteristics of the warehouse channel environment.
In summary, the current clustering algorithm is difficult to be applied to data clustering of the laser radar in the channel environment due to lack of consideration on the channel environment and the characteristics of the laser radar. Therefore, in order to overcome the defects of the current algorithm in the warehouse channel environment, it is necessary to provide a laser radar data clustering algorithm for the warehouse channel.
Disclosure of Invention
In view of the above, in order to solve the above problems, the present invention provides a laser radar data clustering method in a warehouse channel environment. The method is easy to implement, strong in adaptability and capable of stably and accurately clustering the laser radar data points in the channel environment.
In order to achieve the above and other objects, the present invention provides a method for clustering lidar data in a warehouse channel environment, comprising the steps of:
step 1, initializing core point number m and neighborhood size sigma;
step 2, the measured data point set P is { P ═ P1,p2,...,pnSorting according to the measuring angles from 0 degree to 180 degrees or the order of the angles from small to large, and marking all data points in the measuring data point set as an unaccessed state;
step 3, one data point p with an unvisited state is selected in sequence, the state of the point is marked as visited, if no data point with the unvisited state exists in the measured data point set at the moment, the algorithm is terminated, and clustering is completed;
step 4, calculating whether m core points are contained in the neighborhood sigma of the data point p, if so, turning to the next step, otherwise, marking the data point p as a noise point, and turning to the step 2;
step 5, creating a cluster C of data points p, adding the data points p into the cluster C, calculating the size of a current threshold according to a radar divergence model, and setting the size of the threshold sigma to be twice of a return value of the radar divergence model, wherein sigma is 2 · f (phi, theta);
and 6, judging whether the next data point q in the sequence is in the neighborhood of the data point p, if not, turning to the step 2, otherwise, marking the data point q as visited, if the data point q is a core point, namely m data points are contained in the neighborhood of the data point q, updating a threshold, wherein the new threshold is twice of the return value of the laser radar divergence model at the position q, namely sigma is 2 · f (phi, theta), and in addition, adding the data q into the cluster C, and turning to the step 5.
Preferably, the first and second electrodes are formed of a metal,
Figure BDA0001733511240000021
φiis the angle phi between the ith beam of laser radar and the horizontal directioni+1The angle between the (i + 1) th beam of laser radar and the horizontal direction is shown, theta is the included angle between the barrier and the vertical direction, and d is the distance between the horizontal line at the position where the laser radar is located and the intersection point of the barrier.
Due to the adoption of the technical scheme, the invention has the following advantages:
the method provides a laser radar measurement divergence model according to a laser radar principle and channel environment characteristics;
the invention provides a clustering method of self-adaptive threshold values by dynamically determining clustering division threshold values according to a measurement divergence model.
The clustering method provided by the invention has higher operation efficiency in a warehouse channel environment, and improves the accuracy of a clustering algorithm result.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the means of the instrumentalities and combinations particularly pointed out hereinafter.
Drawings
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail with reference to the accompanying drawings:
FIG. 1 is a divergence model schematic diagram 1;
FIG. 2 is a divergence model diagram of FIG. 2;
FIG. 3 is a flow chart of the present invention.
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention.
It should be noted that the drawings provided in the present embodiment are only for illustrating the basic idea of the present invention, and the components related to the present invention are only shown in the drawings rather than drawn according to the number, shape and size of the components in actual implementation, and the type, quantity and proportion of the components in actual implementation may be changed freely, and the layout of the components may be more complicated.
The invention provides a laser radar data clustering method under a warehouse channel environment, which comprises the following specific steps:
firstly, a laser radar divergence measurement model is established, as shown in fig. 1 and 2, XOY represents a current global coordinate system, in the XOY coordinate system, the position of a laser radar is assumed to be C, an obstacle is AB, an included angle between the obstacle and the vertical direction is theta, and an angle between the ith beam of light of the laser radar and the horizontal direction is theta
Figure BDA0001733511240000035
Angle between the (i + 1) th beam and horizontal directionIs composed of
Figure BDA0001733511240000036
The horizontal line of the position of the laser radar intersects with the barrier at a point B, the length of BC is recorded as d,
according to fig. 1, the currently measured distances CA and BA may be described as follows.
Figure BDA0001733511240000031
Figure BDA0001733511240000032
The distance of adjacent laser beams on an obstacle, i.e., the divergence between laser ranging points, can be described as follows.
Figure BDA0001733511240000033
Similarly, the divergence model under the scenario shown in fig. 2 can also be described, and by combining the two scenarios, the radar divergence model can be described as follows:
Figure BDA0001733511240000034
the clustering method based on the measurement divergence variable threshold comprises the following steps:
recording the data set collected by the laser radar as Z ═ Z1,z2,...,znAnd each datum corresponds to a datum of one direction of the laser radar, and the datum represents the measured distance in the direction. Converting the distance data into a data point set under a rectangular coordinate system, and recording the data point set as P ═ P1,p2,...,pn}. The constant m is set to the minimum number of points around the core point, while σ is defined as the threshold value for each point neighborhood, which is dynamically determined from the divergence model. As shown in fig. 3, the threshold-variable clustering method considering the divergence model includes the following specific steps:
step 1, initializing core point number m and neighborhood size sigma as default values;
step 2, measuring the numberData point set P ═ P1,p2,...,pnSequencing according to the measurement angle from 0 degree to 180 degrees or sequencing the angles from small to large, and marking all data points in the point set as an unaccessed state;
step 3, one data point p with an unvisited state is selected in sequence, the state of the point is marked as visited, if no data point with the unvisited state exists in the time point set, the algorithm is terminated, and clustering is completed;
step 4, calculating whether m points are included in the neighborhood sigma of the measured data point p, if so, turning to the next step, otherwise, marking the data point p as a noise point, and turning to the step 2;
step 5, creating a cluster C of the measurement data points p, adding the measurement data points p into the cluster C, calculating the size of the current threshold according to the measurement divergence model, and setting the size of the threshold sigma to be twice of the model return value, as shown in the following formula:
σ=2·f(φ,θ)
and 6, judging whether the next data point q in the sequence is in the neighborhood of the data point p, if not, turning to the step 2, otherwise, marking the data point q as visited, if the data point q is a core point, namely the neighborhood of the data point q contains m data points, updating the threshold, adding the data point q into the cluster C, and turning to the step 5.
Finally, the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting, although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions, and all of them should be covered in the protection scope of the present invention.

Claims (1)

1. A laser radar data clustering method under a warehouse channel environment is characterized by comprising the following steps:
step 1, initializing core point number m and neighborhood size sigma;
step 2, the measured data point set P is { P ═ P1,p2,...,pnSorting according to the measuring angles from 0 degree to 180 degrees or the order of the angles from small to large, and marking all data points in the measuring data point set as an unaccessed state;
step 3, one data point p with an unvisited state is selected in sequence, the state of the point is marked as visited, if no data point with the unvisited state exists in the measured data point set at the moment, the algorithm is terminated, and clustering is completed;
step 4, calculating whether m core points are contained in the neighborhood sigma of the data point p, if so, turning to the next step, otherwise, marking the data point p as a noise point, and turning to the step 2;
step 5, creating a cluster C of data points p, adding the data points p into the cluster C, calculating the size of a current threshold according to a radar divergence model, and setting the size of the threshold sigma to be twice of a return value of the radar divergence model, wherein sigma is 2 · f (phi, theta);
step 6, judging whether the next data point q in the sequence is in the neighborhood of the data point p, if not, turning to the step 2, otherwise, marking the data point q as visited, if the data point q is a core point, namely m data points are contained in the neighborhood of the data point q, updating a threshold, wherein the size of the new threshold is twice of a return value of the laser radar divergence model at the position q, namely sigma is 2 · f (phi, theta), and adding the data point q into a cluster C, and turning to the step 5;
Figure FDA0003373475010000011
φiis the angle phi between the ith beam of laser radar and the horizontal directioni+1The angle between the (i + 1) th beam of laser radar and the horizontal direction is shown, theta is the included angle between the barrier and the vertical direction, and d is the distance between the horizontal line at the position where the laser radar is located and the intersection point of the barrier.
CN201810784967.1A 2018-07-17 2018-07-17 Laser radar data clustering method under warehouse channel environment Active CN108960738B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810784967.1A CN108960738B (en) 2018-07-17 2018-07-17 Laser radar data clustering method under warehouse channel environment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810784967.1A CN108960738B (en) 2018-07-17 2018-07-17 Laser radar data clustering method under warehouse channel environment

Publications (2)

Publication Number Publication Date
CN108960738A CN108960738A (en) 2018-12-07
CN108960738B true CN108960738B (en) 2022-02-15

Family

ID=64495659

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810784967.1A Active CN108960738B (en) 2018-07-17 2018-07-17 Laser radar data clustering method under warehouse channel environment

Country Status (1)

Country Link
CN (1) CN108960738B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109948979B (en) * 2019-03-14 2021-05-11 广州蓝胖子机器人有限公司 Inventory detection method, equipment and storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105866790A (en) * 2016-04-07 2016-08-17 重庆大学 Laser radar barrier identification method and system taking laser emission intensity into consideration
CN106919955A (en) * 2017-03-07 2017-07-04 江苏大学 A kind of two points of K mean algorithms based on density criteria for classifying

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105866790A (en) * 2016-04-07 2016-08-17 重庆大学 Laser radar barrier identification method and system taking laser emission intensity into consideration
CN106919955A (en) * 2017-03-07 2017-07-04 江苏大学 A kind of two points of K mean algorithms based on density criteria for classifying

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Adaptive KLD sampling based Monte Carlo localization;Sun Dihua等;《 2018 Chinese Control And Decision Conference (CCDC)》;20180709;第4154-4159页 *
基于优化DBSCAN算法的智能车载激光雷达数据处理技术研究;包瑞胜等;《中国交通信息化》;20170315(第03期);第135-140页 *
基于四线激光雷达的道路信息提取与目标检测;段建民等;《激光杂志》;20170625;第38卷(第06期);第32-37页 *

Also Published As

Publication number Publication date
CN108960738A (en) 2018-12-07

Similar Documents

Publication Publication Date Title
CN110645974B (en) Mobile robot indoor map construction method fusing multiple sensors
KR102125959B1 (en) Method and apparatus for determining a matching relationship between point cloud data
CN109270545B (en) Positioning true value verification method, device, equipment and storage medium
CN110675307A (en) Implementation method of 3D sparse point cloud to 2D grid map based on VSLAM
CN111563450B (en) Data processing method, device, equipment and storage medium
WO2019062649A1 (en) Adaptive region division method and system
CN111179274B (en) Map ground segmentation method, device, computer equipment and storage medium
US11067694B2 (en) Locating method and device, storage medium, and electronic device
CN109813310A (en) Underground working apparatus localization method, device, system and storage medium
CN105606102A (en) Grid model based PDR indoor positioning method and system
CN108638062A (en) Robot localization method, apparatus, positioning device and storage medium
CN114593739B (en) Vehicle global positioning method and device based on visual detection and reference line matching
CN108960738B (en) Laser radar data clustering method under warehouse channel environment
WO2022078342A1 (en) Dynamic occupancy grid estimation method and apparatus
CN114594772A (en) Robot, path planning method, device and storage medium
CN112731337B (en) Map construction method, device and equipment
WO2022099620A1 (en) Three-dimensional point cloud segmentation method and apparatus, and mobile platform
CN110794434B (en) Pose determination method, device, equipment and storage medium
CN115061499B (en) Unmanned aerial vehicle control method and unmanned aerial vehicle control device
CN113313629B (en) Automatic intersection identification method and system and model storage method and system thereof
Tas et al. High-definition map update framework for intelligent autonomous transfer vehicles
CN115453549A (en) Method for extracting environment right-angle point coordinate angle based on two-dimensional laser radar
CN117516558A (en) Road network generation method, device, computer equipment and computer readable storage medium
CN111414804B (en) Identification frame determining method, identification frame determining device, computer equipment, vehicle and storage medium
Li et al. Advanced mapping using planar features segmented from 3d point clouds

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
GR01 Patent grant
GR01 Patent grant