IP Library Granted Patent US 12,222,723
Granted Patent B2
US 12,222,723 · App. 17/805,135 · Granted Feb 11, 2025

Directed exploration for navigation in dynamic environments

Inventor: Brian Masao Yamauchi (Boston, MA)
Assignee: Boston Dynamics, Inc.
G05D1/0214G01C21/3826G05D1/0274
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,222,723
App. No.
17/805,135
Granted
Feb 11, 2025
Kind
B2
Abstract

A computer-implemented method when executed by data processing hardware causes the data processing hardware to perform operations. The operations include receiving a navigation route for a mobile robot. The navigation route includes a sequence of waypoints connected by edges. Each edge corresponds to movement instructions that navigate the mobile robot between waypoints of the sequence of waypoints. While the mobile robot is traveling along the navigation route, the operations include determining that the mobile robot is unable to execute a respective movement instruction for a respective edge of the navigation route due to an obstacle obstructing the respective edge, generating an alternative path to navigate the mobile robot to an untraveled waypoint in the sequence of waypoints, and resuming travel by the mobile robot along the navigation route. The alternative path avoids the obstacle.

Claims (71)

1. A computer-implemented method comprising:

receiving, by data processing hardware of a legged robot, a navigation route of a topological map for the legged robot, the navigation route comprising a set of waypoints and a first waypoint edge connecting a first waypoint of the set of waypoints and a second waypoint of the set of waypoints;

identifying, by the data processing hardware, for a foot of the legged robot, a set of footfall placement locations based on the navigation route;

obtaining, by the data processing hardware, from a sensor of the legged robot, sensor data;

generating, by the data processing hardware, a local obstacle map based on the sensor data, wherein the local obstacle map is different from the topological map;

determining, by the data processing hardware, that an action to touch down the foot at a footfall placement location of the set of footfall placement locations is obstructed by an obstacle, wherein the footfall placement location corresponds to the first waypoint edge;

determining, by the data processing hardware, that the first waypoint edge of the navigation route is obstructed based on determining that the action is obstructed;

generating, by the data processing hardware, using the local obstacle map, a second waypoint edge connecting a position of the legged robot and a third waypoint based on determining that the first waypoint edge of the navigation route is obstructed, wherein the second waypoint edge generated using the local obstacle map avoids the obstacle and comprises a deviation from the navigation route; and

instructing, by the data processing hardware, the legged robot to navigate to the third waypoint via the second waypoint edge generated using the local obstacle map and back to the navigation route.

2. The method of claim 1 , wherein the local obstacle map comprises an occupancy grid, the occupancy grid comprising a plurality of cells, wherein each cell of the plurality of cells indicates a presence of one or more obstacles.

3. The method of claim 1 , further comprising:

identifying a subset of the set of waypoints are located in the local obstacle map; and

identifying the third waypoint from the subset of the set of waypoints based on identifying the subset of the set of waypoints are located in the local obstacle map, wherein generating the second waypoint edge is based on identifying the third waypoint.

4. The method of claim 1 , wherein the first waypoint edge of the navigation route and the second waypoint edge generated using the local obstacle map are generated using different maps.

5. The method of claim 1 , further comprising:

determining that the third waypoint is outside of a range of the local obstacle map;

generating a path in a direction towards the third waypoint based on determining that the third waypoint is outside of the range of the local obstacle map;

instructing the legged robot to navigate along the path to the position of the legged robot; and

generating an updated local obstacle map based on instructing the legged robot to navigate along the path, wherein generating the second waypoint edge comprises generating the second waypoint edge using the updated local obstacle map.

6. The method of claim 1 , wherein instructing the legged robot to navigate to the third waypoint via the second waypoint edge generated using the local obstacle map and back to the navigation route comprises:

instructing the legged robot to navigate to the third waypoint via the second waypoint edge generated using the local obstacle map; and

instructing the legged robot to navigate from the third waypoint to a fourth waypoint of the set of waypoints according to the navigation route.

7. The method of claim 1 , wherein the topological map represents an environment as a plurality of waypoints interconnected by a plurality of waypoint edges, wherein the topological map indicates a plurality of paths based on the plurality of waypoints and the plurality of waypoint edges, wherein each of the plurality of paths is at least partially obstructed by the obstacle.

8. The method of claim 1 , wherein one or more metric details of a map of an environment of the legged robot are removed to obtain the topological map.

9. The method of claim 1 , wherein the topological map and the local obstacle map correspond to different portions of an environment of the legged robot.

10. The method of claim 1 , further comprising:

instructing the legged robot to navigate through an environment and generate the topological map, wherein the topological map and the local obstacle map are generated based on different sensor data;

generating the set of waypoints based on a plurality of features identified by the legged robot; and

generating the navigation route based on the topological map and the set of waypoints.

11. The method of claim 1 , wherein the topological map indicates a first location of the obstacle and the local obstacle map indicates a second location of the obstacle, and wherein determining that the action is obstructed is based on determining the second location of the obstacle.

12. The method of claim 1 , wherein a third waypoint edge of the navigation route connects the second waypoint to the third waypoint and a fourth waypoint edge of the navigation route connects the third waypoint to a fourth waypoint, wherein instructing the legged robot to navigate to the third waypoint via the second waypoint edge generated using the local obstacle map and back to the navigation route comprises:

instructing the legged robot to navigate from the first waypoint to the third waypoint via the second waypoint edge generated using the local obstacle map; and

instructing the legged robot to navigate from the third waypoint to the fourth waypoint via the fourth waypoint edge of the navigation route.

13. The method of claim 1 , wherein the local obstacle map indicates one or more additional obstacles relative to the topological map, wherein the position of the legged robot and the third waypoint are unconnected in the navigation route and the topological map.

14. A legged robot comprising:

two or more legs; and

a navigation system configured to coordinate movement of the legged robot using the two or more legs, the navigation system comprising data processing hardware and memory hardware in communication with the data processing hardware, the memory hardware storing instructions that when executed on the data processing hardware cause the data processing hardware to:

receive a navigation route of a topological map, the navigation route comprising a set of waypoints and a first waypoint edge connecting a first waypoint of the set of waypoints and a second waypoint of the set of waypoints;

identify, for a foot of a leg of the two or more legs, a set of footfall placement locations based on the navigation route;

obtain, from a sensor of the legged robot, sensor data;

generate a local obstacle map based on the sensor data, wherein the local obstacle map is different from the topological map;

determine that an action to touch down the foot at a footfall placement location of the set of footfall placement locations is obstructed by an obstacle, wherein the footfall placement location corresponds to the first waypoint edge;

determine that the first waypoint edge of the navigation route is obstructed based on determining that the action is obstructed;

generate, using the local obstacle map, a second waypoint edge connecting a position of the legged robot and a third waypoint based on determining that the first waypoint edge of the navigation route is obstructed, wherein the second waypoint edge generated using the local obstacle map avoids the obstacle and comprises a deviation from the navigation route; and

instruct the legged robot to navigate to the third waypoint via the second waypoint edge generated using the local obstacle map and back to the navigation route.

15. The legged robot of claim 14 , wherein the local obstacle map comprises an occupancy grid, the occupancy grid comprising a plurality of cells, wherein each cell of the plurality of cells indicates a presence of one or more obstacles.

16. The legged robot of claim 14 , wherein execution of the instructions on the data processing hardware further causes the data processing hardware to:

identify a subset of the set of waypoints are located in the local obstacle map; and

identify the third waypoint from the subset of the set of waypoints based on identifying the subset of the set of waypoints are located in the local obstacle map, wherein generating the second waypoint edge is based on identifying the third waypoint.

17. The legged robot of claim 14 , wherein the first waypoint edge of the navigation route and the second waypoint edge generated using the local obstacle map are generated using different maps.

18. The legged robot of claim 14 , wherein execution of the instructions on the data processing hardware further causes the data processing hardware to:

determine that the third waypoint is outside of a range of the local obstacle map;

generate a path in a direction towards the third waypoint based on determining that the third waypoint is outside of the range of the local obstacle map;

instruct the legged robot to navigate along the path to the position of the legged robot; and

generate an updated local obstacle map based on instructing the legged robot to navigate along the path, wherein to generate the second waypoint edge, the execution of the instructions on the data processing hardware further causes the data processing hardware to generate the second waypoint edge using the updated local obstacle map.

19. The legged robot of claim 14 , wherein to instruct the legged robot to navigate to the third waypoint via the second waypoint edge generated using the local obstacle map and back to the navigation route, execution of the instructions on the data processing hardware further causes the data processing hardware to:

instruct the legged robot to navigate to the third waypoint via the second waypoint edge generated using the local obstacle map; and

instruct the legged robot to navigate from the third waypoint to a fourth waypoint of the set of waypoints according to the navigation route.

20. The legged robot of claim 14 , wherein the topological map represents an environment as a plurality of waypoints interconnected by a plurality of waypoint edges, wherein the topological map indicates a plurality of paths based on the plurality of waypoints and the plurality of waypoint edges, wherein each of the plurality of paths is at least partially obstructed by the obstacle.

21. The legged robot of claim 14 , wherein one or more metric details of a map of an environment of the legged robot are removed to obtain the topological map.

22. The legged robot of claim 14 , wherein the topological map and the local obstacle map correspond to different portions of an environment of the legged robot.

23. The legged robot of claim 14 , wherein execution of the instructions on the data processing hardware further causes the data processing hardware to:

instruct the legged robot to navigate through an environment and generate the topological map, wherein the topological map and the local obstacle map are generated based on different sensor data;

generate the set of waypoints based on a plurality of features identified by the legged robot; and

generate the navigation route based on the topological map and the set of waypoints.

24. The legged robot of claim 14 , wherein the topological map indicates a first location of the obstacle and the local obstacle map indicates a second location of the obstacle, and wherein to determine that the action is obstructed, execution of the instructions on the data processing hardware further causes the data processing hardware to:

determine that the action is obstructed based on determining the second location of the obstacle.

25. The legged robot of claim 14 , wherein a third waypoint edge of the navigation route connects the second waypoint to the third waypoint and a fourth waypoint edge of the navigation route connects the third waypoint to a fourth waypoint, wherein to instruct the legged robot to navigate to the third waypoint via the second waypoint edge generated using the local obstacle map and back to the navigation route, execution of the instructions on the data processing hardware further causes the data processing hardware to:

instruct the legged robot to navigate from the first waypoint to the third waypoint via the second waypoint edge generated using the local obstacle map; and

instruct the legged robot to navigate from the third waypoint to the fourth waypoint via the fourth waypoint edge of the navigation route.

26. The legged robot of claim 14 , wherein the local obstacle map indicates one or more additional obstacles relative to the topological map, wherein the position of the legged robot and the third waypoint are unconnected in the navigation route and the topological map.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 18, 2022
From: YAMAUCHI, BRIAN MASAO
To: BOSTON DYNAMICS, INC.
Reel/Frame 060848/0203 →
Continuity (2)
Provisional Application 63202289 · Jun 4, 2021
Related Publication 20220390950A1 · Dec 8, 2022
References Cited (228)
US 5111401A · Everett et al. · 1992 [cited by applicant]
US 5378969A · Haikawa · 1995 [cited by applicant]
US 7211980B1 · Bruemmer · 2007 [cited by examiner]
US 7865267B2 · Sabe et al. · 2011 [cited by applicant]
US 7912583B2 · Gutmann et al. · 2011 [cited by applicant]
US 8270730B2 · Watson · 2012 [cited by applicant]
US 8346391B1 · Anhalt et al. · 2013 [cited by applicant]
US 8401783B2 · Hyung et al. · 2013 [cited by applicant]
US 8548734B2 · Barbeau et al. · 2013 [cited by applicant]
US 8849494B1 · Herbach et al. · 2014 [cited by applicant]
US 8930058B1 · Quist et al. · 2015 [cited by applicant]
US 9352470B1 · da Silva et al. · 2016 [cited by applicant]
US 9561592B1 · Silva et al. · 2017 [cited by applicant]
US 9574883B2 · Watts et al. · 2017 [cited by applicant]
US 9586316B1 · Swilling · 2017 [cited by applicant]
US 9594377B1 · Perkins et al. · 2017 [cited by applicant]
US 9717387B1 · Szatmary et al. · 2017 [cited by applicant]
US 9844879B1 · Cousins et al. · 2017 [cited by applicant]
US 9896091B1 · Kurt · 2018 [cited by examiner]
US 9908240B1 · da Silva et al. · 2018 [cited by applicant]
US 9933781B1 · Bando et al. · 2018 [cited by applicant]
US 9969086B1 · Whitman · 2018 [cited by applicant]
US 9975245B1 · Whitman · 2018 [cited by applicant]
US 10081098B1 · Nelson et al. · 2018 [cited by applicant]
US 10081104B1 · Swilling · 2018 [cited by applicant]
US 10226870B1 · Silva et al. · 2019 [cited by applicant]
US 10639794B2 · Cousins et al. · 2020 [cited by applicant]
US 11175664B1 · Boyraz · 2021 [cited by examiner]
US 11268816B2 · Fay et al. · 2022 [cited by applicant]
US 11287826B2 · Whitman et al. · 2022 [cited by applicant]
US 11416003B2 · Whitman et al. · 2022 [cited by applicant]
US 11480974B2 · Lee · 2022 [cited by examiner]
US 11518029B2 · Cantor · 2022 [cited by examiner]
US 11656630B2 · Jonak et al. · 2023 [cited by applicant]
US 11747825B2 · Jonak et al. · 2023 [cited by applicant]
US 11774247B2 · Fay et al. · 2023 [cited by applicant]
US 20050131581A1 · Sabe et al. · 2005 [cited by applicant]
US 20060009876A1 · McNeil · 2006 [cited by examiner]
US 20060025888A1 · Gutmann et al. · 2006 [cited by applicant]
US 20060167621A1 · Dale · 2006 [cited by applicant]
US 20070233338A1 · Ariyur · 2007 [cited by examiner]
US 20070282564A1 · Sprague et al. · 2007 [cited by applicant]
US 20080009966A1 · Bruemmer · 2008 [cited by examiner]
US 20080027590A1 · Phillips et al. · 2008 [cited by applicant]
US 20080086241A1 · Phillips et al. · 2008 [cited by applicant]
US 20090125225A1 · Hussain et al. · 2009 [cited by applicant]
US 20100066587A1 · Yamauchi et al. · 2010 [cited by applicant]
US 20100172571A1 · Yoon et al. · 2010 [cited by applicant]
US 20110035087A1 · Kim · 2011 [cited by examiner]
US 20110172850A1 · Paz-Meidan et al. · 2011 [cited by applicant]
US 20110224901A1 · Aben et al. · 2011 [cited by applicant]
US 20120089295A1 · Ahn et al. · 2012 [cited by applicant]
US 20120182392A1 · Kearns et al. · 2012 [cited by applicant]
US 20120323432A1 · Wong et al. · 2012 [cited by applicant]
US 20130141247A1 · Ricci · 2013 [cited by applicant]
US 20130231779A1 · Purkayastha et al. · 2013 [cited by applicant]
US 20130325244A1 · Wang et al. · 2013 [cited by applicant]
US 20140188325A1 · Johnson et al. · 2014 [cited by applicant]
US 20150158182A1 · Farlow et al. · 2015 [cited by applicant]
US 20150355638A1 · Field et al. · 2015 [cited by applicant]
US 20160375901A1 · Di Cairano · 2016 [cited by examiner]
US 20170017236A1 · Song · 2017 [cited by examiner]
US 20170095383A1 · Li · 2017 [cited by examiner]
US 20170120448A1 · Lee · 2017 [cited by examiner]
US 20170131102A1 · Wirbel et al. · 2017 [cited by applicant]
US 20170203446A1 · Dooley et al. · 2017 [cited by applicant]
US 20180051991A1 · Hong · 2018 [cited by applicant]
US 20180161986A1 · Kee et al. · 2018 [cited by applicant]
US 20180173242A1 · Lalonde et al. · 2018 [cited by applicant]
US 20180328737A1 · Frey et al. · 2018 [cited by applicant]
US 20180348742A1 · Byme et al. · 2018 [cited by applicant]
US 20190056743A1 · Alesiani · 2019 [cited by examiner]
US 20190079523A1 · Zhu et al. · 2019 [cited by applicant]
US 20190080463A1 · Davison et al. · 2019 [cited by applicant]
US 20190138029A1 · Ryll et al. · 2019 [cited by applicant]
US 20190171911A1 · Greenberg · 2019 [cited by applicant]
US 20190187699A1 · Salour · 2019 [cited by examiner]
US 20190187703A1 · Millard et al. · 2019 [cited by applicant]
US 20190213896A1 · Gohi et al. · 2019 [cited by applicant]
US 20190318277A1 · Goldman et al. · 2019 [cited by applicant]
US 20190332114A1 · Moroniti et al. · 2019 [cited by applicant]
US 20200109954A1 · Li et al. · 2020 [cited by applicant]
US 20200117198A1 · Whitman et al. · 2020 [cited by applicant]
US 20200117214A1 · Jonak et al. · 2020 [cited by applicant]
US 20200164521A1 · Li · 2020 [cited by applicant]
US 20200174460A1 · Byme et al. · 2020 [cited by applicant]
US 20200192388A1 · Zhang · 2020 [cited by examiner]
US 20200198140A1 · Dupuis · 2020 [cited by examiner]
US 20200249033A1 · Gelhar · 2020 [cited by applicant]
US 20200258400A1 · Yuan et al. · 2020 [cited by applicant]
US 20200333790A1 · Kobayashi et al. · 2020 [cited by applicant]
US 20200386882A1 · Klein et al. · 2020 [cited by applicant]
US 20200409382A1 · Herman et al. · 2020 [cited by applicant]
US 20210041243A1 · Fay et al. · 2021 [cited by applicant]
US 20210041887A1 · Whitman et al. · 2021 [cited by applicant]
US 20210064055A1 · Jun · 2021 [cited by applicant]
US 20210141389A1 · Jonak et al. · 2021 [cited by applicant]
US 20210180961A1 · Oh · 2021 [cited by applicant]
US 20210311480A1 · Yang et al. · 2021 [cited by applicant]
US 20210323618A1 · Komoroski · 2021 [cited by applicant]
US 20210382491A1 · Murotani · 2021 [cited by examiner]
US 20220024034A1 · Wei · 2022 [cited by examiner]
US 20220063662A1 · Sprunk et al. · 2022 [cited by applicant]
US 20220083062A1 · Jaquez · 2022 [cited by examiner]
US 20220137637A1 · Baldini · 2022 [cited by examiner]
US 20220155078A1 · Fay et al. · 2022 [cited by applicant]
US 20220179420A1 · Whitman et al. · 2022 [cited by applicant]
US 20220244741A1 · Silva et al. · 2022 [cited by applicant]
US 20220276654A1 · Lee · 2022 [cited by examiner]
US 20220342421A1 · Kearns · 2022 [cited by examiner]
US 20220374024A1 · Whitman et al. · 2022 [cited by applicant]
US 20220388170A1 · Merewether · 2022 [cited by applicant]
US 20220390950A1 · Yamauchi · 2022 [cited by applicant]
US 20220390954A1 · Klingensmith · 2022 [cited by applicant]
US 20230309776A1 · Li · 2023 [cited by examiner]
US 20230359220A1 · Jonak et al. · 2023 [cited by applicant]
US 20230400307A1 · Fay et al. · 2023 [cited by applicant]
US 20230418297A1 · Komoroski et al. · 2023 [cited by applicant]
US 20240061436A1 · Tsuzaki · 2024 [cited by examiner]
US 20240165821A1 · Dabiri · 2024 [cited by examiner]
CA 2928262 · 2012 [cited by applicant]
CN 102037317A · 2011 [cited by applicant]
CN 203371557 · 2014 [cited by applicant]
CN 104075715A · 2014 [cited by applicant]
CN 104470685A · 2015 [cited by applicant]
CN 104536445A · 2015 [cited by applicant]
CN 106371445A · 2017 [cited by applicant]
CN 107301654A · 2017 [cited by applicant]
CN 107943038A · 2018 [cited by applicant]
CN 108052103 · 2018 [cited by applicant]
CN 108801269A · 2018 [cited by applicant]
CN 109029417A · 2018 [cited by applicant]
CN 109540142A · 2019 [cited by applicant]
CN 111604916 · 2020 [cited by applicant]
CN 211956515 · 2020 [cited by applicant]
CN 112034861 · 2020 [cited by applicant]
CN 113168184 · 2021 [cited by applicant]
CN 113633219 · 2021 [cited by applicant]
CN 114174766 · 2022 [cited by applicant]
CN 114503043 · 2022 [cited by applicant]
JP H02127180 · 1990 [cited by applicant]
JP H09134217 · 2003 [cited by applicant]
JP 2005088189 · 2005 [cited by applicant]
JP 2006011880 · 2006 [cited by applicant]
JP 2006239844 · 2006 [cited by applicant]
JP 2007041656 · 2007 [cited by applicant]
JP 2008072963 · 2008 [cited by applicant]
JP 2009223628 · 2009 [cited by applicant]
JP 2009271513 · 2009 [cited by applicant]
JP 2010253585 · 2010 [cited by applicant]
JP 2013250795 · 2013 [cited by applicant]
JP 2014123200 · 2014 [cited by applicant]
JP 2014151370 · 2014 [cited by applicant]
JP 2014151370A · 2014 [cited by applicant]
JP 2016081404 · 2016 [cited by applicant]
JP 2016103158 · 2016 [cited by applicant]
JP 2017182502 · 2017 [cited by applicant]
JP 2019500691A · 2019 [cited by applicant]
JP 2019021197 · 2019 [cited by applicant]
JP 2022504039 · 2022 [cited by applicant]
JP 2022543997 · 2022 [cited by applicant]
JP 7219812 · 2023 [cited by applicant]
JP 7259020 · 2023 [cited by applicant]
KR 101121763 · 2012 [cited by applicant]
KR 20120019893 · 2012 [cited by applicant]
KR 20130020107A · 2013 [cited by applicant]
KR 1020220078563 · 2022 [cited by applicant]
KR 20220083666 · 2022 [cited by applicant]
KR 102504729 · 2023 [cited by applicant]
KR 1020230035139 · 2023 [cited by applicant]
KR 102533690 · 2023 [cited by applicant]
KR 102492242 · 2023 [cited by applicant]
WO WO2007051972 · 2007 [cited by applicant]
WO WO2017090108 · 2017 [cited by applicant]
WO WO2018231616 · 2018 [cited by applicant]
WO WO2020076418 · 2020 [cited by applicant]
WO WO2020076422 · 2020 [cited by applicant]
WO WO2021025707 · 2021 [cited by applicant]
WO WO2021025708 · 2021 [cited by applicant]
WO WO2022164832 · 2022 [cited by applicant]
WO WO2022256811 · 2022 [cited by applicant]
WO WO2022256815 · 2022 [cited by applicant]
WO WO2022256821 · 2022 [cited by applicant]
WO WO2023249979A1 · 2023 [cited by applicant]
Kuipers et al. “A Robot Exploration and Mapping Strategy Based on a Semantic Hierarchy of Spatial Representations” Journal of Robotics & Autonomous Systems vol. 8, 1991, pp. 47-63. [cited by applicant]
Yamauchci et al. “Place Recognition in Dynamic Environments” Journal of Robotic Systems, Special Issue on Mobile Robots, vol. 14, No. 2, Feb. 1997, pp. 107-120. [cited by applicant]
Yamauchi et al. “Spatial Learning for Navigation in Dynamic Environments” IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics, Special Issue on Learning Autonomous Robots, vol. 26, No. 3, Jun. 1996, p… [cited by applicant]
Abraham et al., “A Topological Approach of Path Planning for Autonomous Robot Navigation in Dynamic Environments”, The 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, Oct. 11-15, 2009, DOI: 10.… [cited by applicant]
Alkautsar, “Topological Path Planning and Metric Path Planning”, https://medium.com/@arifmaulanaa/topological-path-planning-and-metric-path-planning-5c0fa7f107f2, downloaded Feb. 13, 2023, 3 pages. [cited by applicant]
boost.org, “buffer (with strategies)”, https://www.boost.org/doc/libs/1_75_0/libs/geometry/doc/html/geometry/reference/algorithms/buffer/buffer_7_with_strategies.html, downloaded Feb. 1, 2023, 5 pages. [cited by applicant]
Buchegger et al. “An Autonomous Vehicle for Parcel Delivery in Urban Areas” 2018 21st International Conference on Intelligent Transportation Systems (ITSC), Nov. 2018, DOI: 10.1109/ITSC.2018.8569339, pp. 2961-2967. [cited by applicant]
Cao, “Topological Path Planning for Crowd Navigation”, https://www.ri.cmu.edu/app/uploads/2019/05/thesis.pdf, May 2019, 24 pages. [cited by applicant]
Collins et al. “Efficient Planning for High-Speed MAV Flight in Unknown Environments Using Online Sparse Topological Graphs” IEEE International Conference on Robotics and Automation (ICRA), Aug. 2020, DOI: 10.1109/ICRA4… [cited by applicant]
github.com, “cartographer-project/cartographer”, https://github.com/cartographer-project/cartographer, downloaded Feb. 1, 2023, 4 pages. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2019/047804 mailed Apr. 6, 2020 in 14 pages. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2019/051092, Apr. 30, 2020, 12 pages. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2022/072710 Sep. 27, 2022, 16 pages. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2022/072703, Sep. 22, 2022, 13 pages. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2022/072717, Sep. 30, 2022, 26 pages. [cited by applicant]
Mccammon et al., “Topological path planning for autonomous information gathering”, Auton. Robot 45, (2021), https://doi.org/10.1007/s10514-021-10012-x, pp. 821-842. [cited by applicant]
Leon et al., “TIGRE: Topological Graph based Robotic Exploration”, 2017 European Conference on Mobile Robots (ECMR), Paris, France, 2017, doi: 10.1109/ECMR.2017.8098718. pp. 1-6. [cited by applicant]
Mendes et al., “ICP-based pose-graph SLAM”, International Symposium on Safety, Security and Rescue Robotics (SSRR), Oct. 2016, Lausanne, Switzerland, ff10.1109/SSRR.2016.7784298, hal-01522248, pp. 195-200. [cited by applicant]
Poncela et al., “Efficient integration of metric and topological maps for directed exploration of unknown environments”, Robotics and Autonomous Systems, vol. 41, No. 1, Oct. 31, 2002, https://doi.org/10.1016/S0921-8890… [cited by applicant]
Tang, “Introduction to Robotics”, The Wayback Machine, https://web.archive.org/web/20160520085742/http://www.cpp.edu:80/˜ftang/courses/CS521/, downloaded Feb. 3, 2023, 58 pages. [cited by applicant]
Thrun et al, “The GraphSLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures”, The International Journal of Robotics Research, vol. 25, No. 5-6, May-Jun. 2006, DOI:10.1177/0278364906065387, pp. 403… [cited by applicant]
Video game, “Unreal Engine 5”, https://docs.unrealengine.com/5.0/en-US/basic-navigation-in-unreal-engine/, downloaded Feb. 1, 2023, 15 pages. [cited by applicant]
Whelan et al, “ElasticFusion: Dense SLAM Without a Pose Graph”, http://www.roboticsproceedings.org/rss11/p01.pdf, downloaded Feb. 1, 2023, 9 pages. [cited by applicant]
wilipedia.org, “Buffer (GIS)”, http://wiki.gis.com/wiki/index.php/Buffer_(GIS)#:˜:text=A%20'polygon%20buffer'%20is%20a,Buffer%20around%20line%20features, downloaded Feb. 1, 2023, 4 pages. [cited by applicant]
wikipedia.org, “Probabilistic roadmap”, https://en.wikipedia.org/wiki/Probabilistic_roadmap, downloaded Feb. 1, 2023, 2 pages. [cited by applicant]
wikipedia.org, “Rapidly-exploring random tree”, https://en.wikipedia.org/wiki/Rapidly-exploring_random_tree, downloaded Feb. 1, 2023, 7 pages. [cited by applicant]
wikipedia.org, “Visibility graph”, https://en.wikipedia.org/wiki/Visibility_graph, downloaded Feb. 1, 2023, 3 pages. [cited by applicant]
Boston Dynamics, “Hey Buddy, Can You Give Me a Hand?,” https://www.youtube.com/watch?v=fUyU3IKzoio, Feb. 12, 2018, downloaded Jul. 31, 2023. [cited by applicant]
Boston Dynamics, “Introducing Spot Classic (previously Spot),” https://www.youtube.com/watch?v=M8YjvHYbZ9w, Feb. 9, 2015, downloaded Aug. 10, 2023. [cited by applicant]
Boston Dynamics, “Introducing Spot (Previously SpotMini),” https://www.youtube.com/watch?v=tf7IEVTDjng, Jun. 23, 2016, downloaded Jul. 31, 2023. [cited by applicant]
Boston Dynamics, “Spot Autonomous Navigation,” https://www.youtube.com/watch?v=Ve9kWX_KXus, May 10, 2018, downloaded Sep. 5, 2023. [cited by applicant]
Boston Dynamics, “Spot Robot Testing at Construction Sites,” https://www.youtube.com/watch?v=wND9goxDVrY&t=15s, Oct. 11, 2018, downloaded Sep. 5, 2023. [cited by applicant]
Boston Dynamics, “SpotMini,” The Wayback Machine, http://web.archive.org/web/20171118145237/https://bostondynamics.com/spot-mini, downloaded Jul. 31, 2023, 3 pages. [cited by applicant]
Boston Dynamics, “Testing Robustness,” https://www.youtube.com/watch?v=aFuA50H9uek, Feb. 20, 2018, downloaded Jul. 31, 2023. [cited by applicant]
Boston Dynamics, “The New Spot,” https://www.youtube.com/watch?v=kgaO45SyaO4, Nov. 13, 2017, downloaded Jul. 31, 2023. [cited by applicant]
International Search Report and Written Opinion received in PCT Application No. PCT/US2019/046646 dated Oct. 31, 2019, 9 pages. [cited by applicant]
International Search Report and Written Opinion received in International Application No. PCT/US2019/051511, Jul. 1, 2020, 15 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2022/013777, May 6, 2022, 16 pages. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2023/025806, Oct. 11, 2023, 16 pages. [cited by applicant]
Lee et al., “A New Semantic Descriptor for Data Association in Semantic SLAM”, 2019 109th International Conference on Control, Automation and Systems (ICCAS), Jeju, Korea (South), 2019, pp. 1178-1181, doi: 10.23919/ICCA… [cited by applicant]
Liu et al., “Behavior-based navigation system of mobile robot in unknown environment”, Industrial Control Comp. Dec. 25, 2017; 12: 28-30. [cited by applicant]
Song et al., “Environment model based path planning for mobile robot”, Electronics Optics & Control, Jun. 30, 2006, 3: 102-104. [cited by applicant]
Wei et al., “A method of autonomous robot navigation in dynamic unknown environment”, J Comp Res Devel. Sep. 30, 2005; 9: 1538-1543. [cited by applicant]
Zhao et al., “Machine vision-based unstructured road navigation path detection method”, Trans Chinese Soc Agricult Mach. Jun. 25, 2007; 6: 202-204. (English Abstract not available). [cited by applicant]
Cited By (3)
US 12,442,640 US 12,449,822 US 12,461,531