IP Library › Granted Patent US 12,560,939
Granted Patent B2
US 12,560,939 · App. 18/232,595 · Granted Feb 24, 2026

Driving robot generating driving map and controlling method thereof

Inventors: Taeyoon Lee (Suwon-si, KR); Kuyoung Choi (Suwon-si, KR); Hyunjoong Lee (Suwon-si, KR)
Assignee: SAMSUNG ELECTRONICS CO., LTD.
G05D1/0274G05D1/0246G06T7/50G06T2207/10028
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,560,939
App. No.
18/232,595
Filed
Aug 10, 2023
Granted
Feb 24, 2026
Kind
B2
Art Unit
3664
USPC
701/25
Abstract

A driving robot includes: a camera including a depth camera; and at least one processor configured to: control the camera to acquire depth data in one or more areas where the driving robot moves, identify, from the acquired depth data, a plurality of scan data sets corresponding to a plurality of predetermined height levels, identify, based on the plurality of scan data sets, a plurality of feature scores corresponding to the plurality of scan data sets, and generate at least one area map corresponding to at least one scan data set among the plurality of scan data sets, wherein a feature score, among the plurality of feature scores, corresponding to the at least one scan data set is greater than or equal to a predetermined critical value.

Claims (70)

1 . A driving robot comprising:

a camera comprising a depth camera; and

at least one processor configured to:

control the camera to acquire, in one or more areas where the driving robot moves, depth data comprising a plurality of scan data sets, wherein each of the plurality of scan data sets corresponds to a predetermined height level among a plurality of predetermined height levels,

identify, based on the plurality of scan data sets, a plurality of feature scores corresponding to the plurality of scan data sets, and

generate at least one area map corresponding to at least one scan data set among the plurality of scan data sets, wherein a feature score, among the plurality of feature scores, corresponding to the at least one scan data set is greater than or equal to a predetermined critical value.

2 . The driving robot of claim 1 , wherein the at least one processor is further configured to:

identify as a main area map a first scan data set among the plurality of scan data sets corresponding to a highest identified feature score among the plurality of feature scores, and

based on identification of one or more feature scores, among the plurality of feature scores, greater than the predetermined critical value, identify as a sub-area map each scan data set of the plurality of scan data sets, other than the first scan data set, having a corresponding feature score, among the plurality of feature scores, greater than the predetermined critical value.

3 . The driving robot of claim 2 , wherein the at least one processor is further configured to downscale each identified sub-area map.

4 . The driving robot of claim 1 , wherein the at least one processor is further configured to identify the plurality of feature scores based on at least one of a number of angles, an angle size, a number of lines, and a sharpness of the depth data.

5 . The driving robot of claim 1 , wherein the one or more areas where the driving robot moves collectively form an entire area, and

wherein the at least one processor is further configured to:

identify, within the plurality of scan data sets, one or more area scan data sets corresponding to each of the one or more areas within the entire area,

identify, for each of the one or more area scan data sets, a plurality of area feature scores corresponding to each of the plurality of predetermined height levels,

identify, based on the plurality of area feature scores, a plurality of area-wide feature scores corresponding to the plurality of predetermined height levels in the entire area,

identify a first predetermined height level, among the plurality of predetermined height levels, corresponding to a highest area-wide feature score among the plurality of area-wide feature scores, and

generate a map of the entire area based on each scan data set of the plurality of scan data sets corresponding to the first predetermined height level.

6 . The driving robot of claim 5 , wherein the at least one processor is further configured to:

set a weight for the at least one area map based on the feature score of the at least one area map, and

identify a position and a direction of the driving robot based on the at least one area map having the set weight and the plurality of scan data sets.

7 . The driving robot of claim 1 , wherein the one or more areas where the driving robot moves collectively form an entire area, and

wherein the at least one processor is further configured to:

identify a height level among the plurality of predetermined height levels as a reference height level, and

generate a map of the entire area based on scan data sets, among the plurality of scan data sets, corresponding to the reference height level identified in each of the one or more areas.

8 . The driving robot of claim 7 , wherein the at least one processor is further configured to identify as the reference height level a height level among the plurality of predetermined height levels corresponding to a highest feature score among the plurality of feature scores identified in an area of the one or more areas where the driving robot is initially positioned.

9 . A method of controlling a driving robot, the method comprising:

acquiring, in one or more areas where the driving robot moves, depth data comprising a plurality of scan data sets, wherein each of the plurality of scan data sets corresponds to a predetermined height level among a plurality of predetermined height levels;

identifying, based on the plurality of scan data sets, a plurality of feature scores corresponding to the plurality of scan data sets; and

generating at least one area map corresponding to at least one scan data set among the plurality of scan data sets, wherein a feature score, among the plurality of feature scores, corresponding to the at least one scan data set is greater than or equal to a predetermined critical value.

10 . The method of claim 9 , wherein the generating the at least one area map further comprises:

identifying as a main area map a first scan data set among the plurality of scan data sets corresponding to a highest identified feature score among the plurality of feature scores, and

based on identifying one or more feature scores among the plurality of feature scores greater than the predetermined critical value, identifying as a sub-area map each scan data set of the plurality of scan data sets, other than the first scan data set, having a corresponding feature score, among the plurality of feature scores, greater than the predetermined critical value.

11 . The method of claim 10 , further comprising:

downscaling each identified sub-area map.

12 . The method of claim 9 , wherein the identifying of the plurality of feature scores further comprises identifying the plurality of feature scores based on at least one of a number of angles, an angle size, a number of lines, and a sharpness of the depth data.

13 . The method of claim 9 , wherein the one or more areas where the driving robot moves collectively form an entire area, and

wherein the method further comprises:

identifying, within the plurality of scan data sets, one or more area scan data sets corresponding to each of the one or more areas within the entire area,

identifying, for each of the one or more area scan data sets, a plurality of area feature scores corresponding to each of the plurality of predetermined height levels,

identifying, based on the plurality of area feature scores, a plurality of area-wide feature scores corresponding to the plurality of predetermined height levels in the entire area,

identifying a first predetermined height level among the plurality of predetermined height levels corresponding to a highest area-wide feature score among the plurality of area-wide feature scores, and

generating a map of the entire area based on each scan data set of the plurality of scan data sets corresponding to the first predetermined height level.

14 . The method of claim 13 , further comprising:

setting a weight for the at least one area map based on the feature score of the at least one area map; and

identifying a position and a direction of the driving robot based on the at least one area map having the set weight and the plurality of scan data sets.

15 . The method of claim 9 , wherein the one or more areas where the driving robot moves collectively form an entire area, and

wherein the method further comprises:

identifying a height level among the plurality of predetermined height levels as a reference height level, and

generating a map of the entire area based on scan data sets among the plurality of scan data sets corresponding to the reference height level identified in each of the one or more areas.

16 . The method of claim 15 , further comprising:

identifying as the reference height level a height level among the plurality of predetermined height levels corresponding to a highest feature score among the plurality of feature scores identified in an area of the one or more areas where the driving robot is initially positioned.

17 . A non-transitory computer-readable storage medium having instructions stored therein, which when executed by a processor cause the processor to execute a method of controlling a driving robot, the method comprising:

acquiring, in one or more areas where the driving robot moves, depth data comprising a plurality of scan data sets, wherein each of the plurality of scan data sets corresponds to a predetermined height level among a plurality of predetermined height levels;

identifying, based on the plurality of scan data sets, a plurality of feature scores corresponding to the plurality of scan data sets; and

generating at least one area map corresponding to at least one scan data set among the plurality of scan data sets, wherein a feature score, among the plurality of feature scores, corresponding to the at least one scan data set is greater than or equal to a predetermined critical value.

18 . The non-transitory computer-readable medium of claim 17 , wherein the method further comprises:

identifying as a main area map a first scan data set among the plurality of scan data sets corresponding to a highest identified feature score among the plurality of feature scores, and

based on identifying one or more feature scores among the plurality of feature scores greater than the predetermined critical value, identifying as a sub-area map each scan data set of the plurality of scan data sets, other than the first scan data set, having a corresponding feature score, among the plurality of feature scores, greater than the predetermined critical value.

19 . The non-transitory computer-readable medium of claim 17 , wherein the one or more areas where the driving robot moves collectively form an entire area, and

wherein the method further comprises:

identifying, within the plurality of scan data sets, one or more area scan data sets corresponding to each of the one or more areas within the entire area,

identifying, for each of the one or more area scan data sets, a plurality of area feature scores corresponding to each of the plurality of predetermined height levels,

identifying, based on the plurality of area feature scores, a plurality of area-wide feature scores corresponding to the plurality of predetermined height levels in the entire area,

identifying a first predetermined height level among the plurality of predetermined height levels corresponding to a highest area-wide feature score among the plurality of area-wide feature scores, and

generating a map of the entire area based on each scan data set of the plurality of scan data sets corresponding to the first predetermined height level.

20 . The non-transitory computer-readable medium of claim 17 , wherein an entire area comprises the one or more areas where the driving robot moves, and

wherein the method further comprises:

identifying a height level among the plurality of predetermined height levels as a reference height level, and

generating a map of the entire area based on scan data sets among the plurality of scan data sets corresponding to the reference height level identified in each of the one or more areas.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 10, 2023
From: LEE, TAEYOON; CHOI, KUYOUNG; LEE, HYUNJOONG
To: SAMSUNG ELECTRONICS CO., LTD.
Reel/Frame 064564/0705 →
Priority Claims (2)
KR 10-2022-0116603 · Sep 15, 2022 · national
KR 10-2022-0139575 · Oct 26, 2022 · national
Continuity (2)
Continuation PCTKR2023010556 · Jul 21, 2023
Related Publication 20240094740A1 · Mar 21, 2024
References Cited (33)
US 8023727B2 · Matsumoto et al. · 2011 [cited by applicant]
US 8705842B2 · Lee et al. · 2014 [cited by applicant]
US 9058521B2 · Yoon et al. · 2015 [cited by applicant]
US 10542859B2 · Lee et al. · 2020 [cited by applicant]
US 10591925B2 · Kim · 2020 [cited by applicant]
US 11449061B2 · Ebrahimi Afrouzi · 2022 [cited by examiner]
US 11520341B2 · Watanabe · 2022 [cited by applicant]
US 20090226113A1 · Matsumoto et al. · 2009 [cited by applicant]
US 20120106829A1 · Lee · 2012 [cited by examiner]
US 20180113467A1 · Kim · 2018 [cited by applicant]
US 20180210448A1 · Lee · 2018 [cited by examiner]
US 20210089040A1 · Ebrahimi Afrouzi et al. · 2021 [cited by applicant]
US 20210331754A1 · Whitman · 2021 [cited by applicant]
US 20230213944A1 · Baik et al. · 2023 [cited by applicant]
US 20250061599A1 · Sun · 2025 [cited by examiner]
CN 112270753A · 2021 [cited by applicant]
CN 110163915B · 2021 [cited by applicant]
EP 3257420A1 · 2017 [cited by examiner]
JP 2009217363A · 2009 [cited by applicant]
JP 2020184148A · 2020 [cited by applicant]
KR 1020120047137A · 2012 [cited by applicant]
KR 101739996B1 · 2017 [cited by applicant]
KR 1020170061373A · 2017 [cited by applicant]
KR 1020190020006A · 2019 [cited by applicant]
KR 102242653B1 · 2021 [cited by applicant]
KR 1020220039101A · 2022 [cited by applicant]
KR 102535719B1 · 2023 [cited by applicant]
WO 2020076418A1 · 2020 [cited by applicant]
WO 2022059937A1 · 2022 [cited by applicant]
International Search Report (PCT/ISA/210) issued Nov. 3, 2023 by the International Searching Authority in International Patent Application No. PCT/KR2023/010556. [cited by applicant]
Written Opinion (PCT/ISA/237) issued Nov. 3, 2023 by the International Searching Authority in International Patent Application No. PCT/KR2023/010556. [cited by applicant]
Communication dated Jun. 27, 2025, issued by the European Patent Office in European Application No. 23865705.0. [cited by applicant]
Wang et al., “Autonomous Mobile Robot Navigation in Uneven and Unstructured Indoor Environments”, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) Sep. 24, 2017, Vancouver, BC, Canada, pp.… [cited by applicant]