IP Library Granted Patent US 12,201,250
Granted Patent B2
US 12,201,250 · App. 17/601,026 · Granted Jan 21, 2025

Method and apparatus for constructing map of working region for robot, robot, and medium

Inventors: Erqi Wu (Beijing, CN); Yansheng Niu (Beijing, CN); Shuai Liu (Beijing, CN)
Assignee: BEIJING ROBOROCK INNOVATION TECHNOLOGY CO., LTD.
A47L11/4011G01S17/931G05D1/024G05D1/0248G05D1/0274G06T7/13A47L2201/04G06T2207/30261
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,201,250
App. No.
17/601,026
Granted
Jan 21, 2025
Kind
B2
Abstract

A robot ( 100 ) working area map construction method and apparatus, a robot ( 100 ), and a medium, wherein the robot ( 100 ) working area map construction method comprises scanning in real time an obstacle in a driving path and recording position parameters of the obstacle (S 102 ); obtaining in real time image information of the obstacle in the driving path (S 104 ); according to the position parameters and the image information, determining working area-based reference information of the obstacle (S 106 ); and dividing the working area into a plurality of sub-areas on the basis of the reference information (S 108 ). By means of radar scanning and image capture by a camera for double insurance, the robot ( 100 ) working area map construction method significantly improves recognition accuracy for room doors and avoids room division confusion caused by the incorrect recognition of doors.

Claims (64)

1. A method for dividing a working region for a robot, wherein the method comprises:

scanning an obstacle in a driving path and recording a location parameter of the obstacle, wherein the location parameter comprises a coordinate parameter of an edge of the obstacle, and obtaining a first array based on the coordinate parameter;

obtaining image information of the obstacle in the driving path, wherein the image information comprises a plurality of images of the edge, and obtaining a second array based on the plurality of images of the edge;

determining reference information of the obstacle in the working region based on the location parameter and the image information; and

dividing the working region into a plurality of subregions based on the reference information,

wherein said determining comprises:

comparing the first array and the second array; and

determining, in response to a difference between the first array and the second array falling within a range, the edge of the obstacle as a reference location of the working region.

2. The method according to claim 1 , wherein the scanning an obstacle in a driving path and recording a location parameter of the obstacle comprises:

scanning the obstacle in the driving path by using a lidar, and determining whether a scanned location is the edge of the obstacle;

when determining that the scanned location is the edge of the obstacle, repeatedly scanning the edge for a plurality of times; and

recording the coordinate parameter of the edge of the obstacle in each scan.

3. The method according to claim 2 , further comprising:

selecting coordinate parameters satisfying an adjacent value from multiple sets of the coordinate parameter;

aggregating the selected coordinate parameters; and

storing the aggregated coordinate parameters in the first array.

4. The method according to claim 3 , wherein the obtaining image information of the obstacle in the driving path comprises:

determining whether the scanned location is the edge of the obstacle; and

obtaining the plurality of images of the edge by using a camera from at least one of different locations and different angles when determining that the scanned location is the edge of the obstacle.

5. The method according to claim 4 , further comprising:

extracting characteristic lines from image information obtained based on the plurality of images of the edge;

categorizing characteristic lines with similar angles and similar locations into a same group;

when a number of the characteristic lines in the same group exceeds a threshold, determining the scanned location as a marked location; and

recording a location coordinate of the marked location and storing the location coordinate in a second array.

6. The method according to claim 1 , wherein the dividing the working region into a plurality of subregions based on the reference information comprises:

dividing the working region into the plurality of subregions by using the reference information as an entrance to each subregion; and

marking the plurality of subregions.

7. The method according to claim 6 , wherein the marking comprises marking each subregion with a different color or a different name.

8. A robot for dividing a working region, comprising a processor and a memory, the memory stores computer program instructions that can be executed by the processor, and the processor, when executing the computer program instructions, is configured to:

scan an obstacle in a driving path, and record a location parameter of the obstacle, wherein the location parameter comprises a coordinate parameter of an edge of the obstacle, and obtain a first array based on the coordinate parameter;

obtain image information of the obstacle in the driving path, wherein the image information comprises a plurality of images of the edge, and obtain a second array based on the plurality of images of the edge;

determine reference information of the obstacle in the working region based on the location parameter and the image information; and

divide the working region into a plurality of subregions based on the reference information,

wherein the processor is specification configured to:

compare the first array and the second array; and

determine, in response to a difference between the first array and the second array falling within a range, the edge of the obstacle as a reference location of the working region.

9. The robot according to claim 8 , wherein the processor is further configured to:

scan the obstacle in the driving path by using a lidar, and determine whether a scanned location is the edge of the obstacle;

when determining that the scanned location is the edge of the obstacle, repeatedly scan the edge for a plurality of times; and

record the coordinate parameter of the edge of the obstacle in each scan.

10. The robot according to claim 9 , wherein the processor is further configured to:

select coordinate parameters satisfying an adjacent value from multiple sets of the coordinate parameter;

aggregate the selected coordinate parameters; and

store the aggregated coordinate parameters in the first array.

11. The robot according to claim 10 , wherein the processor is further configured to:

determine whether the scanned location is the edge of the obstacle; and

obtain the plurality of images of the edge by using a camera from at least one of different locations and different angles when determining that the scanned location is the edge of the obstacle.

12. The robot according to claim 11 , wherein the processor is further configured to:

extract characteristic lines from image information obtained based on the plurality of images of the edge;

categorize characteristic lines with similar angles and similar locations into a same group;

when a number of the characteristic lines in the same group exceeds a threshold, determine the scanned location as a marked location; and

record a location coordinate of the marked location and store the location coordinate in a second array.

13. The robot according to claim 8 , wherein the processor is further configured to:

divide the working region into the plurality of subregions by using the reference information as an entrance to each subregion; and

mark the plurality of subregions.

14. The robot according to claim 13 , wherein the processor is further configured to mark each subregion with a different color or a different name.

15. A non-transitory computer-readable storage medium, configured to store computer program instructions, wherein the computer program instructions are invoked and executed by a processor to implement a method for dividing a working region for a robot, and the method comprises:

scanning an obstacle in a driving path, and recording a location parameter of the obstacle, wherein the location parameter comprises a coordinate parameter of an edge of the obstacle, and obtaining a first array based on the coordinate parameter;

obtaining image information of the obstacle in the driving path, wherein the image information comprises a plurality of images of the edge, and obtaining a second array based on the plurality of images of the edge;

determining reference information of the obstacle in the working region based on the location parameter and the image information; and

dividing the working region into a plurality of subregions based on the reference information,

wherein said determining comprises:

comparing the first array and the second array; and

determining, in response to a difference between the first array and the second array falling within a range, the edge of the obstacle as a reference location of the working region.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 6, 2022
From: BEIJING ROBOROCK TECHNOLOGY CO., LTD.
To: BEIJING ROBOROCK INNOVATION TECHNOLOGY CO., LTD.
Reel/Frame 059836/0414 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 4, 2021
From: WU, ERQI; NIU, YANSHENG; LIU, SHUAI
To: BEIJING ROBOROCK TECHNOLOGY CO., LTD.
Reel/Frame 057695/0980 →
Priority Claims (1)
CN 201910261018.X · Apr 2, 2019 · national
Continuity (1)
Related Publication 20220167820A1 · Jun 2, 2022
References Cited (61)
US 6847435B2 · Honda · 2005 [cited by examiner]
US 7187452B2 · Jupp · 2007 [cited by examiner]
US 7796782B1 · Motamedi · 2010 [cited by examiner]
US 9096206B2 · Linkenbach · 2015 [cited by examiner]
US 10930015B2 · Raag · 2021 [cited by examiner]
US 11069082B1 · Ebrahimi Afrouzi · 2021 [cited by examiner]
US 11281916B2 · Heenan · 2022 [cited by examiner]
US 20030066949A1 · Mueller · 2003 [cited by examiner]
US 20050280802A1 · Liu · 2005 [cited by examiner]
US 20100235129A1 · Sharma et al. · 2010 [cited by applicant]
US 20120083982A1 · Bonefas · 2012 [cited by examiner]
US 20120143372A1 · Roh · 2012 [cited by applicant]
US 20130058527A1 · Peynot et al. · 2013 [cited by applicant]
US 20150223659A1 · Han et al. · 2015 [cited by applicant]
US 20160100522A1 · Yamauchi · 2016 [cited by examiner]
US 20170122749A1 · Urano et al. · 2017 [cited by applicant]
US 20180178772A1 · Foitzik · 2018 [cited by examiner]
US 20180178773A1 · Foitzik · 2018 [cited by examiner]
US 20180334155A1 · Feigel · 2018 [cited by examiner]
US 20180364870A1 · Mei · 2018 [cited by applicant]
US 20190025838A1 · Artes · 2019 [cited by examiner]
US 20190188498A1 · Revilloud · 2019 [cited by examiner]
US 20190248396A1 · Khosla · 2019 [cited by examiner]
US 20190295291A1 · Raag · 2019 [cited by examiner]
US 20200145588A1 · Kasuya · 2020 [cited by examiner]
US 20200368486A1 · Hansmann · 2020 [cited by examiner]
US 20210053543A1 · Seol · 2021 [cited by examiner]
US 20210357661A1 · Heenan · 2021 [cited by examiner]
US 20220081873A1 · Huissoon · 2022 [cited by examiner]
US 20220342421A1 · Kearns · 2022 [cited by examiner]
CN 1782668A · 2006 [cited by applicant]
CN 101480795A · 2009 [cited by applicant]
CN 102018481A · 2011 [cited by applicant]
CN 102254190A · 2011 [cited by applicant]
CN 1104470685A · 2015 [cited by applicant]
CN 104825101A · 2015 [cited by applicant]
CN 106175606A · 2016 [cited by applicant]
CN 106239517A · 2016 [cited by applicant]
CN 106595682A · 2017 [cited by applicant]
CN 106737653A · 2017 [cited by applicant]
CN 106863305A · 2017 [cited by applicant]
CN 106983449A · 2017 [cited by applicant]
CN 107330925A · 2017 [cited by applicant]
CN 107817509A · 2018 [cited by applicant]
CN 108303092A · 2018 [cited by applicant]
CN 108509972A · 2018 [cited by applicant]
CN 108873880A · 2018 [cited by applicant]
CN 108885453A · 2018 [cited by applicant]
CN 109188459A · 2019 [cited by applicant]
CN 109947109A · 2019 [cited by applicant]
CN 109947109B · 2022 [cited by applicant]
GB 2552251A · 2018 [cited by examiner]
KR 1020090048104A · 2009 [cited by applicant]
WO 2019053062A1 · 2019 [cited by applicant]
WO WO2022185232A1 · 2022 [cited by examiner]
Office Action issued in corresponding European Patent Application No. 20784889.6 dated Oct. 23, 2023. [cited by applicant]
Extended European Search report dated Nov. 29, 2022, issued in corresponding European Patent Application No. 20784889.6. [cited by applicant]
International Search Report issued in corresponding International Patent Application No. PCT/CN2020/083000 dated Jun. 30, 2020. [cited by applicant]
Wang et al., “Obstacles Detection Based on Laser Ranging Radar and Machine Vision,” China Academic Journal Electronic Electronic Publishing House, 25-29 (2012) (see English abstract). [cited by applicant]
Chi et al., “Research on SI Multaneous Localization and Mapping of Mobile Robot,” Robot, 26 (1): 92-96 (2004) (see English abstract). [cited by applicant]
Notification to Grant Patent Right issued in counterpart Chinese Patent Application No. 201910261018.X dated Mar. 14, 2022. [cited by applicant]