IP Library Granted Patent US 12,524,728
Granted Patent B2
US 12,524,728 · App. 17/650,289 · Granted Jan 13, 2026

Systems and methods for defining serviceable areas

Inventors: Shubhashree Venkatesh (Fremont, CA); Noe Brito (Cupertino, CA); Yee-Ning Cheng (Sunnyvale, CA); Madhav Chhura (Whittier, CA); Sebastian Dovenor (Pittsburgh, PA); John Drake (Cranbury, NJ); Jonathan Pan (Campbell, CA); Jason Parraga (Fremont, CA); Scott Plant (San Jose, CA)
Assignee: Volkswagen Group of America Investments, LLC
G06Q10/083B60W50/0097B60W60/0011B60W60/00253B60W60/00256G01C21/36G01C21/3841G01C21/3856G01C21/387G06F16/285G06Q10/06311G08G1/20H04L9/3213H04L63/0807H04L63/0823H04L63/101H04L63/102H04L63/105H04L63/107B60W2552/00B60W2554/00B60W2556/40B60W2556/45
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,524,728
App. No.
17/650,289
Granted
Jan 13, 2026
Kind
B2
Abstract

Methods and systems for obtaining serviceable areas for a robotic system in a metropolitan area are described. A computing device obtains information about places where (i) the system can route to and from in the area and/or (ii) the system can stop in the area. The computing device uses the information to generate clusters of places where the robotic system can route or stop in the metropolitan area. The computing device creates a geometric shape for each cluster, wherein each shape which has a boundary defined by outermost places contained in the cluster. The computing device uses the geometric shapes to define the serviceable areas for the robotic system within the metropolitan area. The computing device uses the serviceable areas to generate a map displaying at least one geographic area representing a portion of the metropolitan area where a concentrated number of the places exist.

Claims (67)

1 . A method for obtaining serviceable areas for a robotic system in a metropolitan area, comprising:

prior to generating a route for the robotic system in the metropolitan area, obtaining a map of the areas in the metropolitan area that are serviceable by the robotic system by:

obtaining, by a computing device, information including at least one of (i) a list of possible first places where the robotic system can route to and from in the metropolitan area, and (ii) a list of possible second places where the robotic system can stop in the metropolitan area;

determining whether there are any possible first or second places that should be removed from the list by using at least one of predicted high traffic area information and tenant permissions;

modifying the information by removing at least one possible first or second place from the list;

using, by the computing device, the modified information to generate clusters of places where the robotic system can route or stop in the metropolitan area, wherein at least one of said clusters comprises ones of the first and second places that have been grouped together based on a required minimum number of places of a same type as the first places and a required minimum number of places of a same type as the second places;

creating, by the computing device, a geometric shape associated with each said cluster, wherein each geometric shape has a boundary defined by outermost places contained in the cluster;

defining the serviceable areas for the robotic system within the metropolitan area by correlating coordinates of the geometric shape with map coordinates, identifying a map area indicating where the geometric shape resides relative to the metropolitan area, and considering the map area as being one of the serviceable areas; and

using, by the computing device, the serviceable areas to generate a map having a plurality of objects overlaid on geographic areas that each represent a portion of the metropolitan area where a concentrated number of the places exist;

identifying neighbor clusters between which a route exists for the robotic system;

selecting a particular route from a plurality of possible routes for the robotic system that exist between the neighbor clusters; and

updating the map to include the particular route between ones of the plurality of objects overlaid thereon that are associated with the neighbor clusters;

wherein:

the method further comprises classifying each of the first and second places as a core place, a border place or an outlier place;

the clusters comprise core places and border places;

each of the plurality of objects comprises a semi-transparent shape overlaid on the map;

the map includes first visual indicators for first and second places classified as core places and border places that reside under at least a portion of the overlaid semi-transparent shape, and includes different second visual indicators of ones of the first and second places classified as outlier places which reside outside of areas of the map overlaid by the semi-transparent shape.

2 . The method according to claim 1 , further comprising causing, by the computing device, the robotic system to be controlled based on contents of the map.

3 . The method according to claim 2 , wherein the robotic system comprises an autonomous vehicle.

4 . The method according to claim 3 , wherein the autonomous vehicle is caused to autonomously travel from a first place in the metropolitan area to a second different place in the metropolitan area.

5 . The method according to claim 1 , wherein the clusters are generated based on at least one of: a distance between two places where the robotic system can route or stop in the given metropolitan area, a minimum number of places required for a cluster, a minimum number of neighbor places for a given place where the robotic system can route or stop in the given metropolitan area, and a reachability of a place to all other neighboring places where the robotic system can route or stop in the given metropolitan area.

6 . The method according to claim 1 , wherein the clusters are generated using a density-based spatial clustering of applications with noise algorithm, a concave hull algorithm, or a convex hull algorithm.

7 . The method according to claim 1 , wherein the geometric shape is created using a Graham's scan algorithm.

8 . The method according to claim 1 , wherein said determining is further made by using at least one of road repair information, school zone information, pickup-drop off hour information, and environmental condition information.

9 . A system, comprising:

a processor;

a non-transitory computer-readable storage medium comprising programming instructions that are configured to cause the processor to implement a method for obtaining serviceable areas for a robotic system in a metropolitan area, wherein the programming instructions comprise instructions to:

prior to generating a route from the robotic system in the metropolitan area, obtain a map of serviceable areas in the metropolitan area that are serviceable by the robotic system by performing the following operations:

obtaining information including at least one of (i) a list of first places where the robotic system can route to and from in the metropolitan area and (ii) a list of second places where the robotic system can stop in the metropolitan area;

determining whether there are any possible first or second places that should be removed from the list by using at least one of predicted high traffic area information and tenant permissions;

modifying the information based on results of the determining;

using the modified information to generate clusters of places where the robotic system can route or stop in the metropolitan area, wherein at least one of said clusters comprises ones of the first and second places that have been grouped together based on a required minimum number of places of a same type as the first places and a required minimum number of places of a same type as the second places;

creating a geometric shape associated with each said cluster, wherein each geometric shape has a boundary defined by outermost places contained in the cluster;

defining the serviceable areas for the robotic system within the metropolitan area by correlating coordinates of the geometric shape with map coordinates, identifying a map area indicating where the geometric shape resides relative to the metropolitan area, and considering the map area as being one of the serviceable areas;

using the serviceable areas to generate a map displaying at least one geographic area representing a portion of the metropolitan area where a concentrated number of the places exist;

identify neighbor clusters between which a route exists for the robotic system;

select a particular route from a plurality of possible routes for the robotic system that exist between the neighbor clusters; and

update the map to include the particular route between ones of a plurality of objects overlaid thereon that are associated with the neighbor clusters:

wherein:

the method further comprises classifying each of the first and second places as a core place, a border place or an outlier place;

the clusters comprise core places and border places;

each of the plurality of objects comprises a semi-transparent shape overlaid on the map;

the map includes first visual indicators for first and second places classified as core places and border places that reside under at least a portion of the overlaid semi-transparent shape, and includes different second visual indicators of ones of the first and second places classified as outlier places which reside outside of areas of the map overlaid by the semi-transparent shape.

10 . The system according to claim 9 , wherein the programming instructions comprise instructions to cause the robotic system to be controlled based on contents of the map.

11 . The system according to claim 10 , wherein the robotic system comprises an autonomous vehicle.

12 . The system according to claim 11 , wherein the autonomous vehicle is caused to autonomously travel from a first place in the metropolitan area to a second different place in the metropolitan area.

13 . The system according to claim 9 , wherein the clusters are generated based on at least one of: a distance between two places where the robotic system can route stop in the given metropolitan area, a minimum number of places required for a cluster, a minimum number of neighbor places for a given place where the robotic system can route or stop in the given metropolitan area, and a reachability of a place to all other neighboring places where the robotic system can route or stop in the given metropolitan area.

14 . The system according to claim 9 , wherein the clusters are generated using a density-based spatial clustering of applications with noise algorithm, a concave hull algorithm, or a convex hull algorithm.

15 . The system according to claim 9 , wherein the geometric shape is created using a Graham's scan algorithm.

16 . The system according to claim 9 , wherein the determining is further made by using at least one of road repair information, school zone information, pickup-drop off hour information, and environmental condition information.

17 . A computer program product comprising a memory and programming instructions that are configured to cause a processor to:

prior to generating a route for a robotic system, obtain a map of areas in a metropolitan area that are serviceable by the robotic system by:

obtaining information specifying first places where a robotic system can route to and from in a metropolitan area and second places where the robotic system can stop in the metropolitan area;

determining whether there are any possible first or second places that should be removed from the list by using at least one of predicted high traffic area information and tenant permissions;

modifying the information based on results of the determining;

using the modified information to generate clusters of places where the robotic system can route or stop in the metropolitan area, wherein at least one of said clusters comprises ones of the first and second places that have been grouped together based on a required minimum number of places of a same type as the first places and a required minimum number of places of a same type as the second places;

creating a geometric shape for each said cluster, wherein each geometric shape has a boundary defined by outermost places contained in the cluster;

defining serviceable areas for the robotic system within the metropolitan area by correlating coordinates of the geometric shape with map coordinates, identifying a map area indicating where the geometric shape resides relative to the metropolitan area, and considering the map area as being one of the serviceable areas;

using the serviceable areas to generate a map displaying at least one geographic area representing a portion of the metropolitan area where a concentrated number of the places exist;

identifying neighbor clusters between which a route exists for the robotic system;

selecting a particular route from a plurality of possible routes for the robotic system that exist between the neighbor clusters; and

updating the map to include the particular route between ones of a plurality of objects overlaid thereon that are associated with the neighbor clusters;

wherein:

the method further comprises classifying each of the first and second places as a core place, a border place or an outlier place;

the clusters comprise core places and border places;

each of the plurality of objects comprises a semi-transparent shape overlaid on the map;

the map includes first visual indicators for first and second places classified as core places and border places that reside under at least a portion of the overlaid semi-transparent shape, and includes different second visual indicators of ones of the first and second places classified as outlier places which reside outside of areas of the map overlaid by the semi-transparent shape.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 9, 2024
From: ARGO AI, LLC
To: VOLKSWAGEN GROUP OF AMERICA INVESTMENTS, LLC
Reel/Frame 069177/0099 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 10, 2022
From: VENKATESH, SHUBHASHREE; BRITO, NOE; CHENG, YEE-NING; CHHURA, MADHAV; DOVENOR, SEBASTIAN; DRAKE, JOHN; PAN, JONATHAN; PARRAGA, JASON; PLANT, SCOTT
To: ARGO AI, LLC
Reel/Frame 059222/0032 →
Continuity (3)
Provisional Application 63292140 · Dec 21, 2021
Provisional Application 63252431 · Oct 5, 2021
Related Publication 20230105230A1 · Apr 6, 2023
References Cited (109)
US 6850153B1 · Murakami et al. · 2005 [cited by applicant]
US 9194168B1 · Lu et al. · 2015 [cited by applicant]
US 10073449B1 · Sait · 2018 [cited by applicant]
US 10846646B1 · Lee · 2020 [cited by examiner]
US 11228613B2 · Chang et al. · 2022 [cited by applicant]
US 11397622B2 · Kiraly · 2022 [cited by applicant]
US 12115922B2 · Beiser et al. · 2024 [cited by applicant]
US 20030034873A1 · Chase · 2003 [cited by applicant]
US 20060218085A1 · Schuchardt · 2006 [cited by applicant]
US 20060265235A1 · Schuchardt · 2006 [cited by applicant]
US 20080097731A1 · Lanes · 2008 [cited by examiner]
US 20120078671A1 · Mohebbi et al. · 2012 [cited by applicant]
US 20140108080A1 · Mitchell · 2014 [cited by applicant]
US 20140156327A1 · Cai · 2014 [cited by applicant]
US 20150074013A1 · Schoonmaker et al. · 2015 [cited by applicant]
US 20150142518A1 · Farinha Gomes Felix · 2015 [cited by applicant]
US 20150294403A1 · Chu et al. · 2015 [cited by applicant]
US 20160214480A1 · Solyom et al. · 2016 [cited by applicant]
US 20160301698A1 · Katara et al. · 2016 [cited by applicant]
US 20160321665A1 · Thomas · 2016 [cited by applicant]
US 20170123421A1 · Kentley et al. · 2017 [cited by applicant]
US 20170132421A1 · Unitt · 2017 [cited by applicant]
US 20170339031A1 · Hu et al. · 2017 [cited by applicant]
US 20180003512A1 · Lynch · 2018 [cited by applicant]
US 20180004202A1 · Onaga et al. · 2018 [cited by applicant]
US 20180025304A1 · Fisher · 2018 [cited by applicant]
US 20180188042A1 · Chen · 2018 [cited by applicant]
US 20180211541A1 · Rakah et al. · 2018 [cited by applicant]
US 20180216942A1 · Wang · 2018 [cited by applicant]
US 20180232840A1 · Liu · 2018 [cited by examiner]
US 20180349844A1 · Bounasser · 2018 [cited by examiner]
US 20180356239A1 · Marco · 2018 [cited by applicant]
US 20180356837A1 · Lisewski · 2018 [cited by applicant]
US 20190009794A1 · Toyoda · 2019 [cited by applicant]
US 20190035282A1 · Feguson · 2019 [cited by applicant]
US 20190120640A1 · Ho et al. · 2019 [cited by applicant]
US 20190179336A1 · Colijn et al. · 2019 [cited by applicant]
US 20190222986A1 · Aitken · 2019 [cited by applicant]
US 20190228375A1 · Laury · 2019 [cited by examiner]
US 20190266897A1 · Turato · 2019 [cited by applicant]
US 20190318028A1 · Cao · 2019 [cited by examiner]
US 20200033847A1 · Way · 2020 [cited by applicant]
US 20200089221A1 · Bilous · 2020 [cited by applicant]
US 20200116509A1 · Sakaguchi · 2020 [cited by applicant]
US 20200116515A1 · Chadha et al. · 2020 [cited by applicant]
US 20200118075A1 · Yang · 2020 [cited by examiner]
US 20200128101A1 · Meng · 2020 [cited by applicant]
US 20200160709A1 · Ramot · 2020 [cited by applicant]
US 20200173789A1 · Kelleher · 2020 [cited by examiner]
US 20200173808A1 · Beaurepaire · 2020 [cited by examiner]
US 20200191589A1 · Tamai et al. · 2020 [cited by applicant]
US 20200209002A1 · Hou · 2020 [cited by examiner]
US 20200241869A1 · Niemiec · 2020 [cited by applicant]
US 20200249697A1 · Hayes et al. · 2020 [cited by applicant]
US 20200250617A1 · Ryan · 2020 [cited by examiner]
US 20200314089A1 · Iasynetskyi · 2020 [cited by applicant]
US 20200334637A1 · Turner · 2020 [cited by examiner]
US 20200344470A1 · Shen · 2020 [cited by applicant]
US 20200365015A1 · Nguyen · 2020 [cited by applicant]
US 20200372428A1 · Liu et al. · 2020 [cited by applicant]
US 20200380629A1 · Monteil et al. · 2020 [cited by applicant]
US 20200386558A1 · DeLizio · 2020 [cited by applicant]
US 20200396227A1 · Fan et al. · 2020 [cited by applicant]
US 20210033416A1 · Vladimerou · 2021 [cited by applicant]
US 20210035450A1 · Gao · 2021 [cited by applicant]
US 20210041241A1 · Mitra · 2021 [cited by examiner]
US 20210074163A1 · Robeson · 2021 [cited by applicant]
US 20210090025A1 · Bolton · 2021 [cited by examiner]
US 20210192405A1 · Bristow · 2021 [cited by applicant]
US 20210192962A1 · Bristow · 2021 [cited by applicant]
US 20210224413A1 · Gulas · 2021 [cited by applicant]
US 20210233390A1 · Georgiou · 2021 [cited by applicant]
US 20210241625A1 · Elisha · 2021 [cited by examiner]
US 20210309248A1 · Choe · 2021 [cited by applicant]
US 20220057810A1 · Ha · 2022 [cited by applicant]
US 20220058309A1 · Safira · 2022 [cited by applicant]
US 20220063662A1 · Sprunk · 2022 [cited by applicant]
US 20220292451A1 · Massey · 2022 [cited by applicant]
US 20220365530A1 · Foster · 2022 [cited by applicant]
US 20220412764A1 · Wu · 2022 [cited by applicant]
US 20230015884A1 · Cao · 2023 [cited by examiner]
US 20230085943A1 · Karri · 2023 [cited by applicant]
US 20230086061A1 · Srivastava et al. · 2023 [cited by applicant]
US 20230156464A1 · Faccin · 2023 [cited by applicant]
US 20230205181A1 · Kishikawa · 2023 [cited by applicant]
US 20230290966A1 · Arya et al. · 2023 [cited by applicant]
EP 3354070B1 · 2021 [cited by applicant]
KR 20160071202A · 2016 [cited by examiner]
WO 2019153082A1 · 2019 [cited by applicant]
WO 2019213415A1 · 2019 [cited by applicant]
WO 2020228949A1 · 2020 [cited by applicant]
WO 2022139904A1 · 2022 [cited by applicant]
Gonzalez, D. et al., A Review of Motion Planning Techniques for Automated Vehicles, ResearchGate, IEEE Transactions on Intelligent Transportation Systems, vol. 17, No. 4, Apr. 2016. [cited by applicant]
Yurtsever, E. et al., A Survey of Autonomous Driving: Common Practices and Emerging Technologies, IEEE Access, Apr. 2020. [cited by applicant]
Graham Scan Algorithm to find Convex Hull, OpenGenus IQ: Computing Expertise & Legacy, 2022, available at https://iq.opengenus.org/graham-scan-convex-hull/. [cited by applicant]
Amazon Resource Names (ARNs), 2022 Amazon Web Services, Inc., available at https://docs.aws.amazon.com/general/latest/gr/aws-arns-and-namespaces.html. [cited by applicant]
[Deprecated] Embedding Debezium Connectors, Debezium Documentation / Operations / Embedding Debezium, 2022 Debezium Community, available at https://debezium.io/documentation/reference/operations/embedded.html. [cited by applicant]
Chang. M. et al., Argoverse: 3D Tracking and Forecasting with Rich Maps, Nov. 6, 2019. [cited by applicant]
U.S. Appl. No. 17/650,283, filed Feb. 8, 2022, System and Method for Estimating Arrival Time of a Vehicle at a Destination. [cited by applicant]
U.S. Appl. No. 17/650,286, filed Feb. 8, 2022, System and Method for Generating a Planned Path for a Vehicle Using a Cloud Deployment System. [cited by applicant]
U.S. Appl. No. 17/650,288, filed Feb. 8, 2022, System and Method for Generating a Planned Path Using a Phantom Vehicle. [cited by applicant]
U.S. Appl. No. 17/650,281, filed Feb. 8, 2022, Systems and Methods for Managing Permissions and Authorizing Access to and Use of Services. [cited by applicant]
Distributed Multi-AUV Coordination in Naval Mine Countermeasure Missions Sanem Sariel, Tucker Balch and Jason Stack Jan. 30, 2006 (Jan. 30, 2006). [cited by applicant]
On-board Data Mining Steve Tanner, Cara Stein, and Sara J. Graves Jul. 30, 2009 (Jul. 30, 2009). [cited by applicant]
International Search Report and Written Opinion for PCT/US2023/063542 dated May 30, 2023, 13 pages. [cited by applicant]
International Search Report and Written Opinion for PCT/US2023/071441 dated Oct. 31, 2023, 9 pages. [cited by applicant]
Karamanis et al., Vehicle redistribution in ride-sourcing markets using convex minimum cost flows, 2021. [cited by applicant]
Ambadipudi et al., Gauging the disruptive power of robo-taxis in autonomous driving (Year: 2017). [cited by applicant]
Stocker et al., Shared auomated vehicles, Review of Business Models, 2017. [cited by applicant]