CN108804824A - A kind of landform recognition methods - Google Patents

A kind of landform recognition methods Download PDF

Info

Publication number
CN108804824A
CN108804824A CN201810599159.8A CN201810599159A CN108804824A CN 108804824 A CN108804824 A CN 108804824A CN 201810599159 A CN201810599159 A CN 201810599159A CN 108804824 A CN108804824 A CN 108804824A
Authority
CN
China
Prior art keywords
sample
landform
data frame
obtains
sample set
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
CN201810599159.8A
Other languages
Chinese (zh)
Other versions
CN108804824B (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.)
Guangdong Yingjing Innovation Technology Co.,Ltd.
Original Assignee
Anhui Wei Aumann Robot Co Ltd
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 Anhui Wei Aumann Robot Co Ltd filed Critical Anhui Wei Aumann Robot Co Ltd
Priority to CN201810599159.8A priority Critical patent/CN108804824B/en
Publication of CN108804824A publication Critical patent/CN108804824A/en
Application granted granted Critical
Publication of CN108804824B publication Critical patent/CN108804824B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/20Design optimisation, verification or simulation
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C7/00Tracing profiles
    • G01C7/02Tracing profiles of land surfaces

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Multimedia (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Computer Hardware Design (AREA)
  • Evolutionary Computation (AREA)
  • Geometry (AREA)
  • General Engineering & Computer Science (AREA)
  • Manipulator (AREA)

Abstract

The invention discloses a kind of landform recognition methods, including off-line training part and online classification part.The advantages of the technical program, is as follows:1) classification of landform is carried out based on the analysis of joint pressure data, is not easily susceptible to the influence of external environmental interference, there is stronger environmental suitability;2) it is based on time domain and carries out feature extraction, there is higher operation efficiency;3) sample that the sample acquired offline obtains is simplified, has obtained representing sample set, contribute to the calculating time for reducing subsequent classification algorithm;4) it by the analysis of the landform prediction data to history, can find out by the sample of mistake classification, and then on-line amending grader is to promote its performance.

Description

A kind of landform recognition methods
Technical field
The present invention relates to robotic technology fields, more particularly to a kind of landform recognition methods.
Background technology
Wheeled robot is often subject to the influence of barrier, therefore it will often detour to arrive at the destination.And leg foot formula Robot can easily cross over groove, gap, step or sand ground in the non-structured landform movement of coarse and height Etc. complicated landforms.But the stability of standing of leg legged type robot is a critical problem.In order to realize that walking robot exists High stability walking under static and dynamic needs to consider such as roughness, friction coefficient, small geometry harm terrain parameter. It is identified based on real-time landform, leg legged type robot can optimize paces pattern and leg gesture stability algorithm, and then improve steady It is qualitative.
In the present invention, we devise a kind of landform recognition methods, including off-line training portion for leg legged type robot Divide and online classification part.The advantages of the technical program, is as follows:1) classification of landform is carried out based on the analysis of joint pressure data, It is not easily susceptible to the influence of external environmental interference, there is stronger environmental suitability;2) be based on time domain carry out feature extraction, have compared with High operation efficiency;3) sample that the sample acquired offline obtains is simplified, has obtained representing sample set, has helped to reduce The calculating time of subsequent classification algorithm;4) it by the analysis of the landform prediction data to history, can find out by mistake classification Sample, and then on-line amending grader is to promote its performance.
Invention content
To solve the above problems, the present invention proposes a kind of landform recognition methods, include the following steps:
Off-line training part:
1. installing 4 pressure sensors in the leg joint of leg legged type robot, control robot is identified in expectation It walks in landform, and collects pressure sensor signal, the sample frequency of sensor is N hertz, obtains each sensor reading Time series ri, it sums to the reading of 4 pressure sensors on each sampled point, the time series r after being merged.
2. the time series r that pair the 1st step obtains carries out data segmentation as unit of time T, the number of μ data frame is obtained According to frame set f={ a1,a2,a3,…,aμ, each element in f is a data frame, each data frame packet contains l=NT A data.
3. the data frame set f that pair the 2nd step obtains carries out feature extraction and normalizes, the sample set of μ sample is obtained Close Σ, each sample S in sample set Σt∈ Σ are by 6 feature descriptions, wherein t=1,2 ..., μ, then each sample It is a vector of 6 dimension sample spaces,It is StIn an element, subscript i=1,2 ..., 6;It is special The extracting mode of sign is as follows:
4. the sample set Σ that pair the 3rd step obtains is marked, sample set omega={ (S is obtained1,Y1),(S2,Y2),… (Sμ,Yμ), wherein Yt∈ C, t=1,2 ..., μ indicates sample StCorresponding label, YtThat is real terrain, μ indicate sample in Ω Quantity;Landform set C={ c1,c2,…,cm, m indicates the quantity of landform.
5. calculating represents sample set
Extraction represents sample set Φ from the sample set Ω that the 4th step obtains, as follows:
5.1 initialization represent sample set Φ, and it is empty set to enable Φ;Generate sample set copy
5.2 fromOne sample E of middle taking-up, and fromMiddle deletion sample;
5.3 one new representative sample example collection R of generation are added in Φ, wherein R=E;
5.4 ifFor empty set, then step 5.6 is skipped to;Otherwise, fromOne sample E of middle taking-up, and fromMiddle deletion should Sample;Then R is calculated+, meet ρ (R+, E) and=min { ρ (Ri,E),Ri∈ Φ }, wherein ρ indicates the sample and R of EiCenter of a sample Euclidean distance, RiCenter of a sample be RiIn the corresponding sample of all samples mean value;
If 5.5 ρ (R+,E)>The label and R of σ or E+Label is different, then skips to step 5.3;Otherwise, E is added to R+ In, then skip to step 5.4;
5.6 algorithms stop, and obtain representing sample set Φ.
Online classification part:
6. acquiring k-th of data frame ak
7. extracting feature from the data frame that the 6th step obtains and normalizing and obtain sample Sk
8. the sample S that pair the 7th step obtainskLandform prediction is carried out using k-nearest neighbor model, uses Euler's distance first, The calculating distance S of the Ω obtained in 4th stepkK nearest sample set N (Sk);Then N (S are foundk) in most most landform, The landform x of as k-th predictionk;The toposequence X predictedk={ x1.x2,…,xk}。
9. classifier result amendment
The X that 8th step is obtainedk={ x1.x2,…,xkBe modified, modification method is as follows:
Wherein, cj∈C;II is indicative function, works as xi=cjWhen, II=1, otherwise II=0;τ>0 indicates length of window, is Positive integer;It can obtain modified toposequence
10. grader amendment
9th step is obtainedIt is analyzed, ifThen utilize sampleIt corrects Sample set Φ is represented, method is as follows:
Calculate R+, meet ρ (R+, E) and=min { ρ (Ri,E),Ri∈ Φ }, if ρ (R+,E)>The label and R of σ or E+Mark Label are different, generate a new representative sample example collection R and are added in Φ, otherwise E is added to R by wherein R=E+In.
Compared with prior art, the present invention advantage is:1) classification of landform is carried out based on the analysis of joint pressure data, It is not easily susceptible to the influence of external environmental interference, there is stronger environmental suitability;2) be based on time domain carry out feature extraction, have compared with High operation efficiency;3) sample that the sample acquired offline obtains is simplified, has obtained representing sample set, has helped to reduce The calculating time of subsequent classification algorithm;4) it by the analysis of the landform prediction data to history, can find out by mistake classification Sample, and then on-line amending grader is to promote its performance.
Description of the drawings
Fig. 1 is the placement location schematic diagram of pressure sensor in the present invention
Fig. 2 is the distribution schematic diagram of pressure sensor in the present invention
Specific implementation mode
In order to make the purpose , technical scheme and advantage of the present invention be clearer, below in conjunction with attached drawing and specific implementation The present invention is described in detail for example.
As shown in Figure 1, the present invention is divided into off-line training part and online classification part, specific implementation step is as follows:
Off-line training part:
1. installing 4 pressure sensors, specific mounting means institute as shown in Figure 1, Figure 2 in the leg joint of leg legged type robot Show;Control robot walks on it is expected identified landform, and collects pressure sensor signal, and the sample frequency of sensor is N hertz, obtain the time series r of each sensor readingi, it sums to the reading of 4 pressure sensors on each sampled point, Time series r after being merged.
2. the time series r that pair the 1st step obtains carries out data segmentation as unit of time T, the number of μ data frame is obtained According to frame set f={ a1,a2,a3,…,aμ, each element in f is a data frame, each data frame packet contains l=NT A data.
3. the data frame set f that pair the 2nd step obtains carries out feature extraction and normalizes, the sample set of μ sample is obtained Close Σ, each sample S in sample set Σt∈ Σ are by 6 feature descriptions, wherein t=1,2 ..., μ, then each sample It is a vector of 6 dimension sample spaces,It is StIn an element, subscript i=1,2 ..., 6;It is special The extracting mode of sign is as follows:
4. the sample set Σ that pair the 3rd step obtains is marked, sample set omega={ (S is obtained1,Y1),(S2,Y2),… (Sμ,Yμ), wherein Yt∈ C, t=1,2 ..., μ indicates sample StCorresponding label, YtThat is real terrain, μ indicate sample in Ω Quantity;Landform set C={ c1,c2,…,cm, m indicates the quantity of landform.
5. calculating represents sample set
Extraction represents sample set Φ from the sample set Ω that the 4th step obtains, as follows:
5.1 initialization represent sample set Φ, and it is empty set to enable Φ;Generate sample set copy
5.2 fromOne sample E of middle taking-up, and fromMiddle deletion sample;
5.3 one new representative sample example collection R of generation are added in Φ, wherein R=E;
5.4 ifFor empty set, then step 5.6 is skipped to;Otherwise, fromOne sample E of middle taking-up, and fromMiddle deletion should Sample;Then R is calculated+, meet ρ (R+, E) and=min { ρ (Ri,E),Ri∈ Φ }, wherein ρ indicates the sample and R of EiCenter of a sample Euclidean distance, RiCenter of a sample be RiIn the corresponding sample of all samples mean value;
If 5.5 ρ (R+,E)>The label and R of σ or E+Label is different, then skips to step 5.3;Otherwise, E is added to R+ In, then skip to step 5.4;
5.6 algorithms stop, and obtain representing sample set Φ.
Online classification part:
6. acquiring k-th of data frame ak
7. extracting feature from the data frame that the 6th step obtains and normalizing and obtain sample Sk
8. the sample S that pair the 7th step obtainskLandform prediction is carried out using k-nearest neighbor model, uses Euler's distance first, The calculating distance S of the Ω obtained in 4th stepkK nearest sample set N (Sk);Then N (S are foundk) in most most landform, The landform x of as k-th predictionk;The toposequence X predictedk={ x1.x2,…,xk}。
9. classifier result amendment
The X that 8th step is obtainedk={ x1.x2,…,xkBe modified, modification method is as follows:
Wherein, cj∈C;II is indicative function, works as xi=cjWhen, II=1, otherwise II=0;τ>0 indicates length of window, is Positive integer;It can obtain modified toposequence
10. grader amendment
9th step is obtainedIt is analyzed, ifThen utilize sampleCorrect generation Table sample set Φ, method are as follows:
Calculate R+, meet ρ (R+, E) and=min { ρ (Ri,E),Ri∈ Φ }, if ρ (R+,E)>The label and R of σ or E+Mark Label are different, generate a new representative sample example collection R and are added in Φ, otherwise E is added to R by wherein R=E+In.
In order to verify the present invention, we are separately operable using legged mobile robot in 6 kinds of common landform, and acquire joint Pressure sensor signal.Each landform about 10 minutes data of record.Sample rate is 10Hz, therefore the sound of each landform Sequence length is 6000 sampled points.We carried out truncated data with 2 seconds, obtained 1800 samples in total, and each sample is one Data frame, including 20 pressure datas.These data are handled using MATLAB softwares and obtain grader on the desktop Model, and carry out cross validation with test set.Error rate before amendment is 28.9%, is 18.3% after amendment, it is seen that this Invention is effective.

Claims (2)

1. a kind of landform recognition methods, it is characterised in that comprise the steps of:
Off-line training part:
The first step installs 4 pressure sensors in the leg joint of leg legged type robot, and control robot is identified in expectation It walks in landform, and collects pressure sensor signal, the sample frequency of sensor is N hertz, obtains each sensor reading Time series ri, it sums to the reading of 4 pressure sensors on each sampled point, the time series r after being merged;
Second step, the time series r obtained to the first step carry out data segmentation as unit of time T, obtain μ data frame Data frame set f={ a1,a2,a3,…,aμ, each element in f is a data frame, each data frame packet contains l=N T data;
Third walks, and carries out feature extraction to the data frame set f that second step obtains and normalizes, obtains the sample of μ sample Each sample S in set Σ, sample set Σt∈ Σ are by 6 feature descriptions, wherein t=1,2 ..., μ, then each sample It is a vector of 6 dimension sample spaces,It is StIn an element, subscript i=1,2 ..., 6;
4th step, the sample set Σ obtained to third step are marked, and obtain sample set omega={ (S1,Y1),(S2,Y2),… (Sμ,Yμ), wherein Yt∈ C, t=1,2 ..., μ indicates sample StCorresponding label, YtThat is real terrain, μ indicate sample in Ω Quantity, landform set C={ c1,c2,…,cm, m indicates the quantity of landform;
5th step, calculating represent sample set
Extraction represents sample set Φ from the sample set Ω that the 4th step obtains, as follows:
5.1 initialization represent sample set Φ, and it is empty set to enable Φ;Generate sample set copy
5.2 fromOne sample E of middle taking-up, and fromMiddle deletion sample;
5.3 one new representative sample example collection R of generation are added in Φ, wherein R=E;
5.4 ifFor empty set, then step 5.6 is skipped to;Otherwise, fromOne sample E of middle taking-up, and fromMiddle deletion sample; Then R is calculated+, meet ρ (R+, E) and=min { ρ (Ri,E),Ri∈ Φ }, wherein ρ indicates the sample and R of EiCenter of a sample Europe Formula distance, RiCenter of a sample be RiIn the corresponding sample of all samples mean value;
If 5.5 ρ (R+,E)>The label and R of σ or E+Label is different, then skips to step 5.3;Otherwise, E is added to R+In, Then step 5.4 is skipped to;
5.6 algorithms stop, and obtain representing sample set Φ;
Online classification part:
6th step acquires k-th of data frame ak
7th step, extracts feature from the data frame that the 6th step obtains and normalization obtains sample Sk
8th step, the sample S that the 7th step is obtainedkLandform prediction is carried out using k-nearest neighbor model, uses Euler's distance first, The calculating distance S of the Ω obtained in 4th stepkK nearest sample set N (Sk);Then N (S are foundk) in most most landform, The landform x of as k-th predictionk;The toposequence X predictedk={ x1.x2,…,xk};
9th step, classifier result amendment
The X that 9th step is obtainedk={ x1.x2,…,xkBe modified, modification method is as follows:
Wherein, cj∈C;For indicative function, work as xi=cjWhen,Otherwiseτ>0 indicates length of window, is positive integer; It can obtain modified toposequence
Tenth step, grader amendment
9th step is obtainedIt is analyzed, ifThen utilize sampleIt corrects and represents Sample set Φ, method are as follows:
Calculate R+, meet ρ (R+, E) and=min { ρ (Ri,E),Ri∈ Φ }, if ρ (R+,E)>The label and R of σ or E+Label is not Together, it generates a new representative sample example collection R to be added in Φ, otherwise E is added to R by wherein R=E+In.
2. a kind of landform recognition methods according to claim 1, it is characterised in that:Third walks special with the extraction in the 7th step Sign method is as follows:
CN201810599159.8A 2018-06-12 2018-06-12 Terrain recognition method Active CN108804824B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810599159.8A CN108804824B (en) 2018-06-12 2018-06-12 Terrain recognition method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810599159.8A CN108804824B (en) 2018-06-12 2018-06-12 Terrain recognition method

Publications (2)

Publication Number Publication Date
CN108804824A true CN108804824A (en) 2018-11-13
CN108804824B CN108804824B (en) 2020-04-24

Family

ID=64085150

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810599159.8A Active CN108804824B (en) 2018-06-12 2018-06-12 Terrain recognition method

Country Status (1)

Country Link
CN (1) CN108804824B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114474053A (en) * 2021-12-30 2022-05-13 暨南大学 Robot terrain recognition and speed control method and system

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050225724A1 (en) * 2004-03-31 2005-10-13 Nidek Co., Ltd. Corneal topography analysis system
CN101701818A (en) * 2009-11-05 2010-05-05 上海交通大学 Method for detecting long-distance barrier
CN101813475A (en) * 2010-04-24 2010-08-25 上海交通大学 Method for adaptively detecting remote obstacle
JP2017122713A (en) * 2015-01-04 2017-07-13 高橋 正人 Direction information acquisition device, direction information acquisition program, and direction information acquisition method
WO2018089543A1 (en) * 2016-11-08 2018-05-17 Massachusetts Institute Of Technology Kinetic sensing, signal generation, feature extraction, and pattern recognition for control of autonomous wearable leg devices

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050225724A1 (en) * 2004-03-31 2005-10-13 Nidek Co., Ltd. Corneal topography analysis system
CN101701818A (en) * 2009-11-05 2010-05-05 上海交通大学 Method for detecting long-distance barrier
CN101813475A (en) * 2010-04-24 2010-08-25 上海交通大学 Method for adaptively detecting remote obstacle
JP2017122713A (en) * 2015-01-04 2017-07-13 高橋 正人 Direction information acquisition device, direction information acquisition program, and direction information acquisition method
WO2018089543A1 (en) * 2016-11-08 2018-05-17 Massachusetts Institute Of Technology Kinetic sensing, signal generation, feature extraction, and pattern recognition for control of autonomous wearable leg devices

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
李强,薛开,徐贺,潘文林,王天龙: "《基于振动采用支持向量机方法的移动机器人地形分类》", 《机器人》 *
袁 夏, 赵春霞, 张浩峰, 蔡云飞: "《基于点云数据的自然地形分类算法》", 《南京理工大学学报》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114474053A (en) * 2021-12-30 2022-05-13 暨南大学 Robot terrain recognition and speed control method and system
CN114474053B (en) * 2021-12-30 2023-01-17 暨南大学 Robot terrain recognition and speed control method and system

Also Published As

Publication number Publication date
CN108804824B (en) 2020-04-24

Similar Documents

Publication Publication Date Title
US11205098B1 (en) Single-stage small-sample-object detection method based on decoupled metric
Lei et al. New crack detection method for bridge inspection using UAV incorporating image processing
Li et al. An effective data augmentation strategy for CNN-based pest localization and recognition in the field
CN109961009B (en) Pedestrian detection method, system, device and storage medium based on deep learning
Ahn et al. Application of low-cost accelerometers for measuring the operational efficiency of a construction equipment fleet
CN110348441B (en) Value-added tax invoice identification method and device, computer equipment and storage medium
JP2010262625A (en) Artificial vision system and method for knowledge-based selective visual analysis
US9736374B2 (en) Video/vision based access control method and system for parking occupancy determination, which is robust against camera shake
KR20190088094A (en) Model learning system and method by automatic learning and data generation
CN109858414A (en) A kind of invoice piecemeal detection method
CN112231033A (en) Software interface element matching method and device combining RPA and AI
CN113254354A (en) Test case recommendation method and device, readable storage medium and electronic equipment
CN111191201A (en) User identification method, device and equipment based on data buried points and storage medium
US8417038B2 (en) Image processing apparatus, processing method therefor, and non-transitory computer-readable storage medium
CN110672102B (en) Visual auxiliary robot initialization positioning method, robot and readable storage medium
CN115061769A (en) Self-iteration RPA interface element matching method and system for supporting cross-resolution
CN108804824A (en) A kind of landform recognition methods
CN113239227A (en) Image data structuring method and device, electronic equipment and computer readable medium
CN105469099B (en) Pavement crack detection and identification method based on sparse representation classification
US11494918B2 (en) Moving state analysis device, moving state analysis method, and program
Wagner et al. IndustrialEdgeML-End-to-end edge-based computer vision systemfor Industry 5.0
CN116362782A (en) User interest point identification method and system based on big data analysis
CN115565072A (en) Road garbage recognition and positioning method and device, electronic equipment and medium
Aman et al. A model for detecting cost-prone classes based on Mahalanobis-Taguchi method
CN114862787A (en) Myocardial image detection device, myocardial image detection system, and storage medium

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
TA01 Transfer of patent application right

Effective date of registration: 20200330

Address after: 516400 Yingke robot industrial park, ecological technology city, Haifeng County, Shanwei City, Guangdong Province

Applicant after: Guangdong Yingke robot industry Co., Ltd

Address before: 230601 Anhui Hefei economic and Technological Development Zone, Shizhu road 339, Venus commercial city two phase 2005

Applicant before: ANHUI WEIAOMAN ROBOT Co.,Ltd.

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20210305

Address after: 516400 Yingjing Zhihui Park, phase IV, ecological science and Technology City, Chengdong Town, Haifeng County, Shanwei City, Guangdong Province

Patentee after: Guangdong Yingjing Innovation Technology Co.,Ltd.

Address before: 516400 Yingke robot industrial park, Haifeng County, Shanwei City, Guangdong Province

Patentee before: Guangdong Yingke robot industry Co.,Ltd.

TR01 Transfer of patent right