CN108319270A - A kind of automatic dust absorption machine people's optimum path planning method based on historical data analysis - Google Patents

A kind of automatic dust absorption machine people's optimum path planning method based on historical data analysis Download PDF

Info

Publication number
CN108319270A
CN108319270A CN201810228764.4A CN201810228764A CN108319270A CN 108319270 A CN108319270 A CN 108319270A CN 201810228764 A CN201810228764 A CN 201810228764A CN 108319270 A CN108319270 A CN 108319270A
Authority
CN
China
Prior art keywords
data link
link table
dust absorption
automatic dust
machine people
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
CN201810228764.4A
Other languages
Chinese (zh)
Other versions
CN108319270B (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.)
Bai Di
Original Assignee
Hangzhou Jingyi Intelligent Science and Technology 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 Hangzhou Jingyi Intelligent Science and Technology Co Ltd filed Critical Hangzhou Jingyi Intelligent Science and Technology Co Ltd
Priority to CN201810228764.4A priority Critical patent/CN108319270B/en
Publication of CN108319270A publication Critical patent/CN108319270A/en
Application granted granted Critical
Publication of CN108319270B publication Critical patent/CN108319270B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05DSYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
    • G05D1/00Control of position, course or altitude of land, water, air, or space vehicles, e.g. automatic pilot
    • G05D1/02Control of position or course in two dimensions
    • G05D1/021Control of position or course in two dimensions specially adapted to land vehicles
    • G05D1/0231Control of position or course in two dimensions specially adapted to land vehicles using optical position detecting means
    • G05D1/0242Control of position or course in two dimensions specially adapted to land vehicles using optical position detecting means using non-visible light signals, e.g. IR or UV signals
    • 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/34Route searching; Route guidance
    • G01C21/3446Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05DSYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
    • G05D1/00Control of position, course or altitude of land, water, air, or space vehicles, e.g. automatic pilot
    • G05D1/02Control of position or course in two dimensions
    • G05D1/021Control of position or course in two dimensions specially adapted to land vehicles
    • G05D1/0212Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory
    • G05D1/0223Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory involving speed control of the vehicle
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05DSYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
    • G05D1/00Control of position, course or altitude of land, water, air, or space vehicles, e.g. automatic pilot
    • G05D1/02Control of position or course in two dimensions
    • G05D1/021Control of position or course in two dimensions specially adapted to land vehicles
    • G05D1/0255Control of position or course in two dimensions specially adapted to land vehicles using acoustic signals, e.g. ultra-sonic singals
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05DSYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
    • G05D1/00Control of position, course or altitude of land, water, air, or space vehicles, e.g. automatic pilot
    • G05D1/02Control of position or course in two dimensions
    • G05D1/021Control of position or course in two dimensions specially adapted to land vehicles
    • G05D1/0257Control of position or course in two dimensions specially adapted to land vehicles using a radar

Abstract

Disclose a kind of automatic dust absorption machine people's optimum path planning method based on historical data analysis, the automatic dust absorption machine people includes two driving wheels, two driving motors being connect with the driving wheel, encoder is installed on the driving motor, with mounted on the obstacle detector of the automatic dust absorption machine people front, driving motor, encoder and the obstacle detector is connect with controller, optimum path planning method is set inside the controller, and the optimum path planning method includes five steps:(1) setting data link table L0;(2) when the automatic dust absorption machine people described in detects barrier, current position coordinates, deposit data link table L are recorded0;(3) data link table L is sought0Central point O and profile line segment Sj(m, n), and it is stored in data link table L1;(4), retention data chained list L1In between central point O the profile line segment without any location point;(5), data link table L is calculated1In longest profile line segment, and as next cleaning direction.

Description

A kind of automatic dust absorption machine people's optimum path planning method based on historical data analysis
Technical field
Automatic dust absorption machine people's optimum path planning method based on historical data analysis that the present invention relates to a kind of, belongs to intelligence It can household appliance control technology field.
Background technology
It with people's the accelerating rhythm of life, and requires life content more and more abundant, intelligent appliance is promoted to come into Our life.Wherein, automatic dust absorption machine people has given us prodigious help.The cleaning of family is very heavy, and Very frequently.Automatic dust absorption machine people can clean Domestic floor automatically.It utilizes self-contained rechargeable battery To various electric power supplies, wherein dust sucting motor forms enough vacuum inside automatic dust absorption machine people, will by bar shaped suction inlet Dust box inside the rubbish sucking on ground, and the free walker of automatic dust absorption machine people may be implemented in driving motor and driving wheel It walks.Automatic dust absorption machine people is achieved that the cleaning to ground by the walking process of itself.
Because current automatic dust absorption machine people does not have point-device positioning and planning ability also, therefore it cleans path Efficiency just become project very urgently to be resolved hurrily.Currently used strategy is random path, and automatic dust absorption machine people is on ground Face random walk, abandons any planing method, and this strategy leads to very low sweeping efficiency.In order to carry out speed control, automatically Dust-collecting robot all carries encoder on driving motor, relative movement distance and rotation angle can be calculated, to realize position Calculating is set, calculates error although existing, the factors such as mechanical clearance and skidding lead to cumulative errors, in limited time range Interior, location data also has and has certain utility value.So from the position data that recent automatic dust absorption machine people records, It is that can analyze the case where cleaning path, to provide foundation for next optimal cleaning path planning.
Invention content
Place that purpose of the invention is to overcome the shortcomings in the prior art, using the analysis to historical position data, The direction that most probable is not cleaned is obtained, to obtain optimal cleaning path, while not increasing any hardware cost.
The technical solution adopted by the present invention to solve the technical problems is:
A kind of automatic dust absorption machine people's optimum path planning method based on historical data analysis, the automatic dust absorption machine people Including two driving wheels, two driving motors being connect with the driving wheel, encoder is installed on the driving motor, is also wrapped A support wheel is included, with mounted on the obstacle detector of the automatic dust absorption machine people front, the driving motor, Encoder and obstacle detector are connect with controller, and the controller is by being respectively set the driving wheel described in two The free movement of the automatic dust absorption machine people is realized in speed and direction, and can be with according to the signal of the encoder The relative movement distance and direction of rotation for calculating the automatic dust absorption machine people can be calculated using initial position as coordinate origin The coordinate of current location(X, y), optimum path planning method, the optimum path planning side is arranged in the controller inside Method includes the following steps:
(1), setting data link table L0={Pi(xi,yi), wherein i=0,1,2......N-1, xiAnd yiFor coordinate value, N is data Chained list L0Length, data link table L0The coordinate of stop position after barrier is detected for the automatic dust absorption machine people described in the recent period Data;
(2), the automatic dust absorption machine people is advanced with rectilinear motion mode, and constantly detects barrier;Hinder when detecting When hindering object, the automatic dust absorption machine people stops, and records the coordinate of current location(X, y), deposit data link table L0, then Enter step 3;
(3), data link table L is sought0Central point O (xo, yo), data link table L is extracted centered on central point O0In contour line Section Sj(m, n), and it is stored in data link table L1, wherein m=0,1,2......N-1, n=0,1,2......N-1, j=0,1, And M 2......M-1,<N, the profile line segment Sj(m, n) represents data link table L0In point Pm(xm,ym) and Pn(xn,yn) The line segment of composition;
(4), central point O and data link table L1In profile line segment Sj(m, n) forms Delta Region, calculates OPmDeflection θ1=, OPnDeflection θ2=And data link table L0In point Pi(xi,yi) in The deflection θ that heart point O is formed3=If for data link table L0In all point Pi(xi,yi),SimultaneouslyIt all sets up, is then pointed out without any in the Delta Region It is existing, show profile line segment SjThe corresponding direction (m, n) do not have it is swept, then in data link table L1Retain profile line segment Sj(m, n);On the contrary, then in data link table L1Delete profile line segment Sj(m,n);
(5), data link table L is calculated1In profile line segment SjThe length W of (m, n)j=, Comparative silhouette line segment SjThe length W of (m, n)jSize, take the maximum profile line segment S of lengthmax(m, n), profile line segment Smax(m, N) direction angle alpha of opposite central point O=;It is following that the automatic dust absorption machine person, which selects direction angle alpha, Cleaning direction.
In step 2, the coordinate of current location(X, y)It is stored in data link table L0, in accordance with the following steps:
Enable Pi(xi,yi)=Pi-1(xi-1,yi-1), i=1,2,3.....N-1;
Then P0(x0,y0)=(x, y), complete chain table handling.
In step 3, data link table L0Central point O (xo, yo) Coordinate calculation method be:
Search for data link table L0The maximin of middle coordinate data:xmax, xmin, ymax, ymin
Calculate xo=, yo=
In step 3, the profile line segment S in data link table L0 is extracted centered on central point Oj(m, n), using following step Suddenly:
Calculate data link table L0In point Pi(xi,yi) and central point O (xo, yo) distance Di= , ask apart from maximum point PM(xM,yM);
With PM(xM,yM) it is vertex, calculate data link table L0In point Pi(xi,yi) and central point O (xo, yo) formed angle beta=, it is profile point to take the maximum point of angle beta, is denoted as PN(xN,yN), therefore formed Data S0(M, N), and it is stored in data link table L1
Again with PN(xN,yN) it is vertex, continuous hunting profile point, and be stored in data link table L1, until reentry point PM(xM,yM), knot Beam returns.
Implementing the positive effect of the present invention is:1, optimal cleaning path is selected, sweeping efficiency is improved;2, working method can It leans on, it is easy to accomplish, do not increase system cost.
Description of the drawings
Fig. 1 is the structural schematic diagram of automatic dust absorption machine people;
Fig. 2 is optimum path planning method one;
Fig. 3 is optimum path planning method two;
Fig. 4 is optimum path planning method three.
Specific implementation mode
In conjunction with attached drawing, the invention will be further described:
Referring to Fig.1, a kind of stochastic path planning method of automatic dust absorption machine people, the automatic dust absorption machine people include two Driving wheel 1, two driving motors 2 being connect with the driving wheel 1 install encoder on the driving motor 2, further include one A support wheel 3, the support wheel 3 play the role of support, are not used in driving.Wherein, the driving motor 2 and encoder with Controller connects.The controller realized by the way that speed and the direction of the driving wheel 1 described in two is respectively set it is described from The free movement of dynamic dust-collecting robot, and the automatic dust absorption machine people can be calculated according to the signal of the encoder Relative movement distance and direction of rotation can calculate the coordinate of current location using initial position as coordinate origin(X, y).Due to Mechanical clearance calculates the factors such as error and ground skidding, coordinate(X, y)There can be cumulative errors, that is to say, that with the time Passage, error can be increasing, but within a period of time, coordinate(X, y)Or there is utility value.
Further include the obstacle detector mounted on the automatic dust absorption machine people front, equally with the controller Connection.The obstacle detector may be used the sensors such as ultrasonic wave, infrared or laser radar or two kinds or The set of person's multiple sensors.
The automatic dust absorption machine people in the process of walking, has been carried out at the same time cleaning, therefore the selection of walking path The height for directly determining cleaning efficiency, is in very important status.
Optimum path planning method is set inside the controller, and the optimum path planning method includes following step Suddenly:
(1), setting data link table L0={Pi(xi,yi), wherein i=0,1,2......N-1, xiAnd yiFor coordinate value, N is data Chained list L0Length, data link table L0The coordinate of stop position after barrier is detected for the automatic dust absorption machine people described in the recent period Data;
Data link table L0Length N should not be too large, otherwise error cause greatly very much plan effect be deteriorated.
(2), the automatic dust absorption machine people is advanced with rectilinear motion mode, and constantly detects barrier;Work as detection When to barrier, the automatic dust absorption machine people stops, and records the coordinate of current location(X, y), deposit data link table L0, Subsequently into step 3;
In step 2, the coordinate of current location(X, y)It is stored in data link table L0, in accordance with the following steps:
Enable Pi(xi,yi)=Pi-1(xi-1,yi-1), i=1,2,3.....N-1;
Then P0(x0,y0)=(x, y), complete chain table handling.
(3), data link table L is sought0Central point O (xo, yo), data link table L is extracted centered on central point O0In wheel Profile section Sj(m, n), and it is stored in data link table L1, wherein m=0,1,2......N-1, n=0,1,2......N-1, j=0,1, And M 2......M-1,<N, the profile line segment Sj(m, n) represents data link table L0In point Pm(xm,ym) and Pn(xn,yn) The line segment of composition;
In step 3, data link table L0Central point O (xo, yo) Coordinate calculation method be:
Search for data link table L0The maximin of middle coordinate data:xmax, xmin, ymax, ymin
Calculate xo=, yo=
With reference to Fig. 2-3, in step 3, the profile line segment S in data link table L0 is extracted centered on central point Oj(m, n), Using following steps:
Calculate data link table L0In point Pi(xi,yi) and central point O (xo, yo) distance Di= , ask apart from maximum point PM(xM,yM);
With PM(xM,yM) it is vertex, calculate data link table L0In point Pi(xi,yi) and central point O (xo, yo) formed angle beta=, it is profile point to take the maximum point of angle beta, is denoted as PN(xN,yN), therefore formed Data S0(M, N), and it is stored in data link table L1
Again with PN(xN,yN) it is vertex, continuous hunting profile point, and be stored in data link table L1, until reentry point PM(xM,yM), knot Beam returns.
(4), central point O and data link table L1In profile line segment Sj(m, n) forms Delta Region, calculates OPmDeflection θ1 =, OPnDeflection θ2=And data link table L0In point Pi(xi,yi) in The deflection θ that heart point O is formed3=If for data link table L0In all point Pi(xi,yi),SimultaneouslyIt all sets up, then occurs without any point in the Delta Region, show Profile line segment SjThe corresponding direction (m, n) do not have it is swept, then in data link table L1Retain profile line segment Sj(m,n);On the contrary, Then in data link table L1Delete profile line segment Sj(m,n);
Referring again to Fig. 3, for data link table L0In all the points Pi(xi,yi) all meet conditionSimultaneously, then illustrate PiPositioned at triangle OPmPnExcept, profile line segment Sj(m, n) is with respect to central point O One direction not cleaned.
(5), data link table L is calculated1In profile line segment SjThe length W of (m, n)j=, Comparative silhouette line segment SjThe length W of (m, n)jSize, take the maximum profile line segment S of lengthmax(m, n), profile line segment Smax(m, N) direction angle alpha of opposite central point O=;It is next that the automatic dust absorption machine person, which selects direction angle alpha, Clean direction.
With reference to Fig. 4, in all directions not cleaned, the maximum direction of angle is chosen.
In conclusion automatic dust absorption machine people by the analysis to historical data, selects non-purging zone as connecing a step Cleaning direction reduce path to increase the probability into non-purging zone and repeat, should to effectively improve sweeping efficiency Scheme need not increase any hardware cost, and flexible working mode and it is reliable, it is easy to accomplish.Meanwhile the program is equally suitable The path planning of cradle is found together in automatic dust absorption machine people.

Claims (4)

1. a kind of automatic dust absorption machine people's optimum path planning method based on historical data analysis, the automatic dust absorption machine People includes two driving wheels, two driving motors being connect with the driving wheel, and encoder is installed on the driving motor, also Including a support wheel, with mounted on the obstacle detector of the automatic dust absorption machine people front, driving electricity Machine, encoder and obstacle detector are connect with controller, and the controller is by being respectively set the driving described in two The free movement of the automatic dust absorption machine people is realized in the speed of wheel and direction, and according to the signal of the encoder The relative movement distance and direction of rotation that the automatic dust absorption machine people can be calculated can using initial position as coordinate origin Calculate the coordinate of current location(X, y), it is characterised in that:Optimum path planning method is set inside the controller, it is described Optimum path planning method include the following steps:
(1), setting data link table L0={Pi(xi,yi), wherein i=0,1,2......N-1, xiAnd yiFor coordinate value, N is data Chained list L0Length, data link table L0The coordinate of stop position after barrier is detected for the automatic dust absorption machine people described in the recent period Data;
(2), the automatic dust absorption machine people is advanced with rectilinear motion mode, and constantly detects barrier;Hinder when detecting When hindering object, the automatic dust absorption machine people stops, and records the coordinate of current location(X, y), deposit data link table L0, then Enter step 3;
(3), data link table L is sought0Central point O (xo, yo), data link table L is extracted centered on central point O0In contour line Section Sj(m, n), and it is stored in data link table L1, wherein m=0,1,2......N-1, n=0,1,2......N-1, j=0,1, And M 2......M-1,<N, the profile line segment Sj(m, n) represents data link table L0In point Pm(xm,ym) and Pn(xn,yn) The line segment of composition;
(4), central point O and data link table L1In profile line segment Sj(m, n) forms Delta Region, calculates OPmDeflection θ1=, OPnDeflection θ2=And data link table L0In point Pi(xi,yi) and center The deflection θ that point O is formed3=If for data link table L0In all point Pi(xi,yi),SimultaneouslyIt all sets up, then occurs without any point in the Delta Region, Show profile line segment SjThe corresponding direction (m, n) do not have it is swept, then in data link table L1Retain profile line segment Sj(m,n);Phase Instead, then in data link table L1Delete profile line segment Sj(m,n);
(5), data link table L is calculated1In profile line segment SjThe length W of (m, n)j=, Comparative silhouette line segment SjThe length W of (m, n)jSize, take the maximum profile line segment S of lengthmax(m, n), profile line segment Smax(m, N) direction angle alpha of opposite central point O=;It is following that the automatic dust absorption machine person, which selects direction angle alpha, Cleaning direction.
2. a kind of automatic dust absorption machine people optimum path planning side based on historical data analysis according to claim 1 Method, it is characterised in that:In step 2, the coordinate of current location(X, y)It is stored in data link table L0, in accordance with the following steps:
Enable Pi(xi,yi)=Pi-1(xi-1,yi-1), i=1,2,3.....N-1;
Then P0(x0,y0)=(x, y), complete chain table handling.
3. a kind of automatic dust absorption machine people optimum path planning side based on historical data analysis according to claim 1 Method, it is characterised in that:In step 3, data link table L0Central point O (xo, yo) Coordinate calculation method be:
Search for data link table L0The maximin of middle coordinate data:xmax, xmin, ymax, ymin
Calculate xo=, yo=
4. a kind of automatic dust absorption machine people optimum path planning side based on historical data analysis according to claim 1 Method, it is characterised in that:In step 3, data link table L is extracted centered on central point O0In profile line segment Sj(m, n) is used Following steps:
Calculate data link table L0In point Pi(xi,yi) and central point O (xo, yo) distance Di= , ask apart from maximum point PM(xM,yM);
With PM(xM,yM) it is vertex, calculate data link table L0In point Pi(xi,yi) and central point O (xo, yo) formed angle beta=, it is profile point to take the maximum point of angle beta, is denoted as PN(xN,yN), therefore formed Data S0(M, N), and it is stored in data link table L1
Again with PN(xN,yN) it is vertex, continuous hunting profile point, and be stored in data link table L1, until reentry point PM(xM,yM), terminate It returns.
CN201810228764.4A 2018-03-20 2018-03-20 Automatic dust collection robot optimal path planning method based on historical data analysis Active CN108319270B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810228764.4A CN108319270B (en) 2018-03-20 2018-03-20 Automatic dust collection robot optimal path planning method based on historical data analysis

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810228764.4A CN108319270B (en) 2018-03-20 2018-03-20 Automatic dust collection robot optimal path planning method based on historical data analysis

Publications (2)

Publication Number Publication Date
CN108319270A true CN108319270A (en) 2018-07-24
CN108319270B CN108319270B (en) 2021-01-01

Family

ID=62898077

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810228764.4A Active CN108319270B (en) 2018-03-20 2018-03-20 Automatic dust collection robot optimal path planning method based on historical data analysis

Country Status (1)

Country Link
CN (1) CN108319270B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110867925A (en) * 2019-11-29 2020-03-06 小狗电器互联网科技(北京)股份有限公司 Recharging method, recharging equipment and recharging storage medium
CN110989588A (en) * 2019-11-29 2020-04-10 小狗电器互联网科技(北京)股份有限公司 Robot and recharging system

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6823230B1 (en) * 2000-09-07 2004-11-23 Honeywell International Inc. Tool path planning process for component by layered manufacture
CN101077578A (en) * 2007-07-03 2007-11-28 北京控制工程研究所 Mobile Robot local paths planning method on the basis of binary environmental information
CN101738195A (en) * 2009-12-24 2010-06-16 厦门大学 Method for planning path for mobile robot based on environmental modeling and self-adapting window
CN103148804A (en) * 2013-03-04 2013-06-12 清华大学 Indoor unknown structure identification method based on laser scanning
CN103251358A (en) * 2012-02-16 2013-08-21 恩斯迈电子(深圳)有限公司 Control method of sweeping robot
CN104615138A (en) * 2015-01-14 2015-05-13 上海物景智能科技有限公司 Dynamic indoor region coverage division method and device for mobile robot
CN105651286A (en) * 2016-02-26 2016-06-08 中国科学院宁波材料技术与工程研究所 Visual navigation method and system of mobile robot as well as warehouse system
CN106767819A (en) * 2016-12-07 2017-05-31 北京建筑大学 A kind of indoor navigation data construction method and navigation system based on BIM

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6823230B1 (en) * 2000-09-07 2004-11-23 Honeywell International Inc. Tool path planning process for component by layered manufacture
CN101077578A (en) * 2007-07-03 2007-11-28 北京控制工程研究所 Mobile Robot local paths planning method on the basis of binary environmental information
CN101738195A (en) * 2009-12-24 2010-06-16 厦门大学 Method for planning path for mobile robot based on environmental modeling and self-adapting window
CN103251358A (en) * 2012-02-16 2013-08-21 恩斯迈电子(深圳)有限公司 Control method of sweeping robot
CN103148804A (en) * 2013-03-04 2013-06-12 清华大学 Indoor unknown structure identification method based on laser scanning
CN104615138A (en) * 2015-01-14 2015-05-13 上海物景智能科技有限公司 Dynamic indoor region coverage division method and device for mobile robot
CN105651286A (en) * 2016-02-26 2016-06-08 中国科学院宁波材料技术与工程研究所 Visual navigation method and system of mobile robot as well as warehouse system
CN106767819A (en) * 2016-12-07 2017-05-31 北京建筑大学 A kind of indoor navigation data construction method and navigation system based on BIM

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
IBRAHIM A. HAMEED: ""Motion planning for autonomous landmine detection and clearance robots"", 《2016 INTERNATIONAL WORKSHOP ON RECENT ADVANCES IN ROBOTICS AND SENSOR TECHNOLOGY FOR HUMANITARIAN DEMINING AND COUNTER-IEDS (RST)》 *
YU LIU等: ""combined coverage path planning for autonomous cleaning robots in unstrucured environments"", 《PROCEEDINGS OF THE 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION》 *
周亚楠: ""家庭清扫机器人路径覆盖***的设计与实现"", 《信息科技辑》 *
朱世强等: ""自主吸尘机器人的研究现状"", 《机器人》 *
陈涛等: ""平面离散点集的边界搜索算法"", 《计算机仿真》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110867925A (en) * 2019-11-29 2020-03-06 小狗电器互联网科技(北京)股份有限公司 Recharging method, recharging equipment and recharging storage medium
CN110989588A (en) * 2019-11-29 2020-04-10 小狗电器互联网科技(北京)股份有限公司 Robot and recharging system
CN110867925B (en) * 2019-11-29 2022-03-04 小狗电器互联网科技(北京)股份有限公司 Recharging method, recharging equipment and recharging storage medium

Also Published As

Publication number Publication date
CN108319270B (en) 2021-01-01

Similar Documents

Publication Publication Date Title
CN105881555B (en) Photovoltaic plant sweeping robot and its working method based on the direct dedusting of blower
CN108852184B (en) Non-blind area sweeping robot based on deep learning algorithm and sweeping control method thereof
CN107224249B (en) Cleaning operation execution method and device of cleaning equipment and readable storage medium
CN101714000A (en) Route planning method of automatic dust collector
US9268331B2 (en) Domestic robotic system and robot therefor
JP4173144B2 (en) Correction method of gyro sensor of robot cleaner
KR100690669B1 (en) Position-reconizing system for a self-moving robot
CN102063123B (en) Control method of performing rotational traveling of robot cleaner
CN108469819A (en) A kind of z font return path planing methods of automatic dust absorption machine people
US10797636B2 (en) Waterless cleaning system and method for solar trackers using an autonomous robot
CN108345308A (en) A kind of best random walk selection method of automatic dust absorption machine people
JP2001525567A (en) Improvement of mobile robot and its control system
CN108065866A (en) A kind of automatic pointing sweeping machine and method
WO2019056998A1 (en) Autonomous mobile robot and pile-seeking method therefor, control apparatus and smart cleaning system
TW201915630A (en) Autonomous mobile robot and its pile seeking method, control device and intelligent cleaning system
CN108319270A (en) A kind of automatic dust absorption machine people&#39;s optimum path planning method based on historical data analysis
CN207655622U (en) Cleaning machine on a kind of plate
CN110925521A (en) Pipeline deashing robot
CN102981148A (en) Positioning system and method thereof
CN110840344B (en) Sweeping robot walking control system along line based on PID control algorithm and control method thereof
CN108536146A (en) The intelligent control method of localization for Mobile Robot recharging base based on path and RSSI
CN113729578B (en) Cleaning robot, motion state monitoring method thereof, server and storage medium
CN103584798A (en) Intelligent dust collector control system and intelligent dust collector cleaning method
CN102599862A (en) Dilemma identifying and solving method for automatic dust collector
CN108784524A (en) A kind of optimal route selection method of automatic dust absorption machine people

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
CB03 Change of inventor or designer information
CB03 Change of inventor or designer information

Inventor after: Bai Di

Inventor after: Liu Yu

Inventor before: Liu Yu

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20231008

Address after: Room 502, Unit 1, Building 1, No. 14 Lishan Road, Yiyuan County, Zibo City, Shandong Province, 256100

Patentee after: Bai Di

Address before: 310013 no.256, 6th floor, building 2, Huahong building, 248 Tianmushan Road, Xihu District, Hangzhou City, Zhejiang Province

Patentee before: HANGZHOU JINGYI INTELLIGENT SCIENCE & TECHNOLOGY Co.,Ltd.