IP Library Granted Patent US 12,372,982
Granted Patent B2
US 12,372,982 · App. 17/811,840 · Granted Jul 29, 2025

Constrained mobility mapping

Inventors: Eric Whitman (Waltham, MA); Gina Christine Fay (Waltham, MA); Alex Khripin (Waltham, MA); Max Bajracharya (Waltham, MA); Matthew Malchano (Waltham, MA); Adam Komoroski (Waltham, MA); Christopher Stathis (Waltham, MA)
Assignee: Boston Dynamics, Inc.
G05D1/606B25J9/1666B25J9/1697B25J13/089B62D57/032G05D1/2435G05D1/622G05D2111/67
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,372,982
App. No.
17/811,840
Granted
Jul 29, 2025
Kind
B2
Abstract

A method of constrained mobility mapping includes receiving from at least one sensor of a robot at least one original set of sensor data and a current set of sensor data. Here, each of the at least one original set of sensor data and the current set of sensor data corresponds to an environment about the robot. The method further includes generating a voxel map including a plurality of voxels based on the at least one original set of sensor data. The plurality of voxels includes at least one ground voxel and at least one obstacle voxel. The method also includes generating a spherical depth map based on the current set of sensor data and determining that a change has occurred to an obstacle represented by the voxel map based on a comparison between the voxel map and the spherical depth map. The method additional includes updating the voxel map to reflect the change to the obstacle.

Claims (48)

1. A method comprising:

obtaining, at data processing hardware, a voxel map generated based on a first set of sensor data, wherein the voxel map indicates a height associated with a particular location;

obtaining, at the data processing hardware, a depth map generated based on a second set of sensor data, wherein the voxel map represents the first set of sensor data in a first format and the depth map represents the second set of sensor data in a second format that is different from the first format, wherein the depth map indicates a range of heights associated with the particular location;

performing, by the data processing hardware, a comparison of the height indicated by the voxel map to the range of heights indicated by the depth map based on the first format and the second format;

identifying, by the data processing hardware, a modification of an object of the voxel map based on the comparison of the height indicated by the voxel map to the range of heights indicated by the depth map;

updating, by the data processing hardware, the voxel map based on the modification of the object of the voxel map to obtain an updated voxel map; and

instructing, by the data processing hardware, navigation by a robot according to the updated voxel map.

2. The method of claim 1 , wherein the data processing hardware comprises data processing hardware of the robot.

3. The method of claim 1 , further comprising obtaining at least one of the first set of sensor data or the second set of sensor data from at least one sensor.

4. The method of claim 1 , wherein the first set of sensor data is an original set of sensor data and the second set of sensor data is a current set of sensor data.

5. The method of claim 1 , wherein the first set of sensor data is received by the data processing hardware prior to the data processing hardware receiving the second set of sensor data.

6. The method of claim 1 , wherein the comparison of the height indicated by the voxel map to the range of heights indicated by the depth map comprises a comparison of one or more columns of the voxel map to one or more columns of the depth map.

7. The method of claim 1 , wherein the depth map comprises a spherical representation of an environment of the robot.

8. The method of claim 1 , wherein the voxel map comprises a representation of an environment of the robot as a plurality of voxels.

9. The method of claim 1 , wherein obtaining the voxel map comprises generating the voxel map, and wherein obtaining the depth map comprises generating the depth map.

10. The method of claim 1 , wherein instructing navigation by the robot according to the updated voxel map comprises:

identifying one or more locations for placement of a foot of the robot based on the updated voxel map; and

instructing movement by the robot according to the one or more locations.

11. The method of claim 1 , wherein the robot is a legged robot, and wherein the updated voxel map indicates one or more objects that may interfere with movement of the legged robot.

12. The method of claim 1 , wherein updating the voxel map based on the modification of the object of the voxel map comprises removing, from the voxel map, one or more voxels corresponding to the object.

13. The method of claim 1 , wherein the depth map comprises a representation of the second set of sensor data, the representation comprising one or more structures defined by two or more points of the second set of sensor data.

14. The method of claim 1 , wherein the voxel map comprises a three-dimensional grid.

15. The method of claim 1 , wherein the robot is a legged robot, and wherein the updated voxel map indicates one or more objects that may interfere with movement of the legged robot.

16. The method of claim 1 , further comprising:

identifying one or more first voxels based on identifying the modification of the object of the voxel map; and

identifying, using one or more heuristics, one or more second voxels associated with the object,

wherein updating the voxel map comprises:

removing the one or more first voxels and the one or more second voxels from voxel map.

17. Non-transitory computer-readable media including computer-executable instructions that, when executed by data processing hardware of a computing system, cause the computing system to:

obtain a voxel map generated based on a first set of sensor data, wherein the voxel map indicates a height associated with a particular location;

obtain a depth map generated based on a second set of sensor data, wherein the voxel map represents the first set of sensor data in a first format and the depth map represents the second set of sensor data in a second format that is different from the first format, wherein the depth map indicates a range of heights associated with the particular location;

perform a comparison of the height indicated by the voxel map to the range of heights indicated by the depth map based on the first format and the second format;

identify a modification of an object of the voxel map based on the comparison of the height indicated by the voxel map to the range of heights indicated by the depth map;

update the voxel map based on the modification of the object of the voxel map to obtain an updated voxel map; and

instruct navigation by a robot according to the updated voxel map.

18. The non-transitory computer-readable media of claim 17 , wherein the computing system comprises a computing system of the robot.

19. The non-transitory computer-readable media of claim 17 , wherein execution of the computer-executable instructions by the data processing hardware of the computing system, further causes the computing system to obtain at least one of the first set of sensor data or the second set of sensor data from at least one sensor.

20. The non-transitory computer-readable media of claim 17 , wherein the first set of sensor data is an original set of sensor data and the second set of sensor data is a current set of sensor data.

21. A computing system comprising:

memory; and

one or more processing devices coupled to the memory and configured to:

obtain a voxel map generated based on a first set of sensor data, wherein the voxel map indicates a height associated with a particular location;

obtain a depth map generated based on a second set of sensor data, wherein the voxel map represents the first set of sensor data in a first format and the depth map represents the second set of sensor data in a second format that is different from the first format, wherein the depth map indicates a range of heights associated with the particular location;

perform a comparison of the height indicated by the voxel map to the range of heights indicated by the depth map based on the first format and the second format;

identify a modification of an object of the voxel map based on the comparison of the height indicated by the voxel map to the range of heights indicated by the depth map;

update the voxel map based on the modification of the object of the voxel map to obtain an updated voxel map; and

instruct navigation by a robot according to the updated voxel map.

22. The computing system of claim 21 , wherein the computing system comprises a computing system of the robot.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 14, 2025
From: WHITMAN, ERIC; FAY, GINA CHRISTINE; KHRIPIN, ALEX; BAJRACHARYA, MAX; MALCHANO, MATTHEW; KOMOROSKI, ADAM; STATHIS, CHRISTOPHER
To: BOSTON DYNAMICS, INC.
Reel/Frame 071118/0610 →
CHANGE OF NAME Recorded May 14, 2025
From: BOSTON DYNAMICS, INC.
To: BOSTON DYNAMICS, INC.
Reel/Frame 071526/0012 →
Continuity (3)
Continuation 16573284 · Sep 17, 2019
Provisional Application 62883310 · Aug 6, 2019
Related Publication 20220374024A1 · Nov 24, 2022
References Cited (232)
US 5111401A · Everett et al. · 1992 [cited by applicant]
US 5307271A · Everett et al. · 1994 [cited by applicant]
US 5378969A · Haikawa · 1995 [cited by applicant]
US 7211980B1 · Bruemmer et al. · 2007 [cited by applicant]
US 7769491B2 · Fukuchi et al. · 2010 [cited by applicant]
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 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 9395726B1 · Rizzi et al. · 2016 [cited by applicant]
US 9561592B1 · Silva 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 9789607B1 · Whitman · 2017 [cited by applicant]
US 9868210B1 · Whitman · 2018 [cited by applicant]
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 10017218B1 · Swilling et al. · 2018 [cited by applicant]
US 10059392B1 · Fay et al. · 2018 [cited by applicant]
US 10081098B1 · Nelson et al. · 2018 [cited by applicant]
US 10081104B1 · Swilling · 2018 [cited by applicant]
US 10144465B1 · Swilling et al. · 2018 [cited by applicant]
US 10196104B1 · Kagami et al. · 2019 [cited by applicant]
US 10226870B1 · Silva et al. · 2019 [cited by applicant]
US 10266220B2 · Swilling et al. · 2019 [cited by applicant]
US 10399621B2 · Swilling et al. · 2019 [cited by applicant]
US 11059532B1 · Fay et al. · 2021 [cited by applicant]
US 11073842B1 · Whitman et al. · 2021 [cited by applicant]
US 11123869B2 · Whitman et al. · 2021 [cited by applicant]
US 11175664B1 · Boyraz · 2021 [cited by applicant]
US 11268816B2 · Fay et al. · 2022 [cited by applicant]
US 11287826B2 · Whitman et al. · 2022 [cited by applicant]
US 11319005B2 · Swilling et al. · 2022 [cited by applicant]
US 11383381B2 · Whitman et al. · 2022 [cited by applicant]
US 11416003B2 · Whitman · 2022 [cited by examiner]
US 11447195B2 · Whitman · 2022 [cited by applicant]
US 11465281B2 · Whitman et al. · 2022 [cited by applicant]
US 11480974B2 · Lee et al. · 2022 [cited by applicant]
US 11518029B2 · Cantor et al. · 2022 [cited by applicant]
US 11548151B2 · Whitman et al. · 2023 [cited by applicant]
US 11599128B2 · Whitman et al. · 2023 [cited by applicant]
US 11660752B2 · Whitman et al. · 2023 [cited by applicant]
US 11691292B2 · Klingensmith et al. · 2023 [cited by applicant]
US 11712802B2 · Chestnutt et al. · 2023 [cited by applicant]
US 11774237B2 · Fay et al. · 2023 [cited by applicant]
US 11851120B2 · Fay et al. · 2023 [cited by applicant]
US 11927961B2 · Fay et al. · 2024 [cited by applicant]
US 11999423B2 · Whitman · 2024 [cited by applicant]
US 12038752B1 · Blanton et al. · 2024 [cited by applicant]
US 12235652B2 · Whitman et al. · 2025 [cited by applicant]
US 20050131581A1 · Sabe et al. · 2005 [cited by applicant]
US 20060025888A1 · Gutmann et al. · 2006 [cited by applicant]
US 20060167621A1 · Dale · 2006 [cited by applicant]
US 20070282564A1 · Sprague et al. · 2007 [cited by applicant]
US 20080009966A1 · Bruemmer et al. · 2008 [cited by applicant]
US 20080027590A1 · Phillips et al. · 2008 [cited by applicant]
US 20080086241A1 · Phillips et al. · 2008 [cited by applicant]
US 20090099689A1 · Takenaka et al. · 2009 [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 20110172850A1 · Paz-Meidan 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 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 20150253775A1 · Jacobus et al. · 2015 [cited by applicant]
US 20150355638A1 · Field et al. · 2015 [cited by applicant]
US 20150362921A1 · Hanaoka et al. · 2015 [cited by applicant]
US 20170131102A1 · Wirbel et al. · 2017 [cited by applicant]
US 20170168488A1 · Wierzynski · 2017 [cited by examiner]
US 20170176990A1 · Keller et al. · 2017 [cited by applicant]
US 20170197311A1 · Garcia et al. · 2017 [cited by applicant]
US 20170203446A1 · Dooley et al. · 2017 [cited by applicant]
US 20180173242A1 · Lalonde et al. · 2018 [cited by applicant]
US 20180218513A1 · Ho · 2018 [cited by examiner]
US 20180364717A1 · Douillard · 2018 [cited by examiner]
US 20190079523A1 · Zhu et al. · 2019 [cited by applicant]
US 20190080463A1 · Davison et al. · 2019 [cited by applicant]
US 20190100306A1 · Pohl · 2019 [cited by examiner]
US 20190138029A1 · Ryll · 2019 [cited by examiner]
US 20190171911A1 · Greenberg · 2019 [cited by applicant]
US 20190187703A1 · Millard et al. · 2019 [cited by applicant]
US 20190213896A1 · Gohi et al. · 2019 [cited by applicant]
US 20190258737A1 · Wang · 2019 [cited by examiner]
US 20190318277A1 · Goldman et al. · 2019 [cited by applicant]
US 20200117198A1 · Whitman et al. · 2020 [cited by applicant]
US 20200117214A1 · Jonak et al. · 2020 [cited by applicant]
US 20200192388A1 · Zhang et al. · 2020 [cited by applicant]
US 20200249033A1 · Gelhar · 2020 [cited by applicant]
US 20200333790A1 · Kobayashi 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 20210141389A1 · Jonak et al. · 2021 [cited by applicant]
US 20210147017A1 · Swilling et al. · 2021 [cited by applicant]
US 20210158544A1 · Steinmeyer · 2021 [cited by examiner]
US 20210331754A1 · Whitman · 2021 [cited by applicant]
US 20220024034A1 · Wei et al. · 2022 [cited by applicant]
US 20220083062A1 · Jaquez et al. · 2022 [cited by applicant]
US 20220137637A1 · Baldini et al. · 2022 [cited by applicant]
US 20220155078A1 · Fay et al. · 2022 [cited by applicant]
US 20220179420A1 · Whitman et al. · 2022 [cited by applicant]
US 20220193898A1 · Aghasadeghi et al. · 2022 [cited by applicant]
US 20220194245A1 · Gonano et al. · 2022 [cited by applicant]
US 20220276654A1 · Lee et al. · 2022 [cited by applicant]
US 20220324104A1 · Whitman et al. · 2022 [cited by applicant]
US 20220342421A1 · Kearns et al. · 2022 [cited by applicant]
US 20220388170A1 · Merewether · 2022 [cited by applicant]
US 20220390950A1 · Yamauchi · 2022 [cited by applicant]
US 20220390952A1 · Yu et al. · 2022 [cited by applicant]
US 20220390954A1 · Klingensmith · 2022 [cited by applicant]
US 20220410390A1 · Whitman et al. · 2022 [cited by applicant]
US 20230008677A1 · Whitman et al. · 2023 [cited by applicant]
US 20230143315A1 · Whitman et al. · 2023 [cited by applicant]
US 20230234229A1 · Fay et al. · 2023 [cited by applicant]
US 20230286167A1 · Klingensmith et al. · 2023 [cited by applicant]
US 20230321830A1 · Fay et al. · 2023 [cited by applicant]
US 20230400307A1 · Fay et al. · 2023 [cited by applicant]
US 20230415343A1 · Whitman · 2023 [cited by applicant]
US 20240075998A1 · Fay et al. · 2024 [cited by applicant]
US 20240174310A1 · Whitman · 2024 [cited by applicant]
CA 2928262A1 · 2012 [cited by applicant]
CN 114499733A · 2011 [cited by applicant]
CN 103413313A · 2013 [cited by applicant]
CN 203371557 · 2014 [cited by applicant]
CN 106662646A · 2017 [cited by applicant]
CN 107169986A · 2017 [cited by applicant]
CN 108052103 · 2018 [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 114503043A · 2022 [cited by applicant]
CN 114234967B · 2023 [cited by applicant]
JP H02127180A · 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 2007041656A · 2007 [cited by applicant]
JP 2008072963 · 2008 [cited by applicant]
JP 2009223628 · 2009 [cited by applicant]
JP 2009271513A · 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 2016081404 · 2016 [cited by applicant]
JP 2016103158 · 2016 [cited by applicant]
JP 2022504039 · 2022 [cited by applicant]
JP 2022543997A · 2022 [cited by applicant]
JP 7219812 · 2023 [cited by applicant]
KR 101121763 · 2012 [cited by applicant]
KR 20120019893A · 2012 [cited by applicant]
KR 20130002834A · 2013 [cited by applicant]
KR 20180004151A · 2018 [cited by applicant]
KR 20220083666A · 2022 [cited by applicant]
KR 1020230019497 · 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 WO2018231616A1 · 2018 [cited by applicant]
WO WO2020076418 · 2020 [cited by applicant]
WO WO2021025708A1 · 2021 [cited by applicant]
WO WO2022256812A1 · 2022 [cited by applicant]
NPL, Lourenco et al., “A volumetric representation for obstacle detection in vegetated terrain”, Date of Conference: Dec. 2014, Date uploaded to IEEE: Apr. 2015, Retrieved from web Jun. 2024, URL: <https://ieeexplore.ie… [cited by examiner]
International Preliminary Report on Patentability (Chapter I of the Patent Cooperation Treaty), PCT/US2019/051511, Feb. 8, 2022, 11 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US/2019/051511, Jul. 1, 2020, 15 pages. [cited by applicant]
Invitation to Pay Fees Notification with Annex Communication Relating to the Results of the Partial International Search, PCT/US2019/051511, May 6, 2020, 14 pages. [cited by applicant]
Japanese Office Action received in Japanese Application No. JP 2022-502057, dated Feb. 27, 2023, 8 pages. [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. [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]
Bajracharya et al., “High fidelity day/night stereo mapping with vegetation and negative obstacle detection for vision-in-the-loop walking,” 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems, Nov.… [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” International Conference on Intelligent Transportation Systems (ITSC) Nov. 2018. [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. [cited by applicant]
Fermin-Leon et al., “TIGRE: Topological Graph based Robotic Exploration”, 2017 European Conference on Mobile Robots (ECMR), Paris, France, 2017, pp. 1-6. [cited by applicant]
Github.com, “cartographer-project/cartographer”, https://github.com/cartographer-project/cartographer, downloaded Feb. 1, 2023, 4 pages. [cited by applicant]
Hines et al., “Virtual surfaces and attitude aware planning and behaviours for negative navigation,” IEEE Robotics and Automation Letters, Apr. 2021, vol. 6, No. 2, pp. 4048-4055. [cited by applicant]
Karunasekera et al., “Stereo vision based negative obstacle detection,” 2017 13th IEEE International Conference on Control & Automation (ICCA), Jul. 3, 2017; pp. 834-838. [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]
Larson et al., “Lidar based off-road negative obstacle detection and analysis,” IEEE 14th Conference on Intelligent Transportation Systems, Washington, D.C., Oct. 5-7, 2011, 8 pages. [cited by applicant]
McCammon et al., “Topological path planning for autonomous information gathering”, Auton Robot 45, 821-842 (2021). https://doi.org/10.1007/s10514-021-10012-x. [cited by applicant]
Mendes et al., “ICP-based pose-graph Slam”, International Symposium on Safety, Security and Rescue Robotics (SSRR), Oct. 2016, Lausanne, Switzerland. pp. 195-200, ff10.1109/SSRR.2016.7784298, hal-01522248. [cited by applicant]
Poncela et al., “Efficient integration of metric and topological maps for directed exploration of unknown environments”, Robotics and Autonomous Systems, Elsevier BV, Amsterdam, NL, vol. 41, No. 1, Oct. 31, 2002 (Oct. 3… [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, pp. 403-429. [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]
Wikipedia.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]
Yamauchi 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]
International Search Report and Written Opinion, PCT/US2019/046646, Oct. 31, 2019, 9 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US2022/072704, Sep. 28, 2022, 17 pages. [cited by applicant]
“AlphaDog Proto,” video screen shots taken from https://www.youtube.com/watch?v=SSbZrQp-HOk, Sep. 29, 2011, downloaded Aug. 14, 2023, 24 pages. [cited by applicant]
“Atlas Update,” video screen shots taken from https://www.youtube.com/watch?v=SD6Okylclb8, Oct. 3, 2013, downloaded Aug. 14, 2023, 18 pages. [cited by applicant]
“BigDog Overview (Updated Mar. 2010),” video screen shots taken from https://www.youtube.com/watch?v=cNZPRsrwumQ, Apr. 22, 2010, downloaded Aug. 14, 2023, 25 pages. [cited by applicant]
“BigDog Reflexes,” video screen shots taken from https://www.youtube.com/watch?v=3gi6Ohnp9x8, Jan. 27, 2009, downloaded Aug. 14, 2023, 15 pages. [cited by applicant]
“Boston Dynamics BigDog Robot,” video screen shots taken from https://www.youtube.com/watch?v=b2bExqhhWRI, Jul. 17, 2007, downloaded Oct. 5, 2023, 13 pages. [cited by applicant]
Boston Dynamics, “LS3—Legged Squad Support System,” video screen shots taken from https://www.youtube.com/watch?v=R7ezXBEBE6U&t=1s, Sep. 10, 2012, downloaded Feb. 2, 2024, 5 pages. [cited by applicant]
Boston Dynamics, “Introducing Spot Classic (previously Spot),” video screen shots taken from https://www.youtube.com/watch?v=M8YjvHYbZ9w, Feb. 9, 2015, downloaded Aug. 10, 2023, 14 pages. [cited by applicant]
Boston Dynamics, “Introducing Spot (Previously SpotMini),” video screen shots taken from https://www.youtube.com/watch?v=tf7IEVTDjng, Jun. 23, 2016, downloaded Jul. 31, 2023, 10 pages. [cited by applicant]
Boston Dynamics, “The New Spot,” video screen shots taken from https://www.youtube.com/watch?v=kgaO45SyaO4, Nov. 13, 2017, downloaded Jul. 31, 2023, 3 pages. [cited by applicant]
Boston Dynamics, “Testing Robustness,” video screen shots taken from https://www.youtube.com/watch?v=aFuA50H9uek, Feb. 20, 2018, downloaded Jul. 31, 2023, 3 pages. [cited by applicant]
Boston Dynamics, “Spot Autonomous Navigation,” video screen shots taken from https://www.youtube.com/watch?v=Ve9kWX_KXus, May 10, 2018, downloaded Sep. 5, 2023, 11 pages. [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]
“Petman Prototype,” video screen shots taken from https://www.youtube.com/watch?v=67CUudkjEG4, Oct. 26, 2009, downloaded Aug. 14, 2023, 10 pages. [cited by applicant]
“Petman,” video screen shots taken from https://www.youtube.com/watch?v=mclbVTIYG8E, Oct. 30, 2011, downloaded Aug. 14, 2023, 12 pages. [cited by applicant]
Redacted Presentation from IAP Event at Massachusetts Institute of Technology, Jan. 31, 2018, 10 pages. [cited by applicant]
Stanford, “BigDog, the Rough-Terrain Robot,” video screen shots taken from https://www.youtube.com/watch?v =-Bi-tPO0OPs, Aug. 27, 2010, downloaded Apr. 26, 2024, 12 pages. [cited by applicant]
Video embedded in PowerPoint Presentation for IAP Event at Massachusetts Institute of Technology on Jan. 31, 2018, video screen shots taken at 1 second intervals, 47 pages. [cited by applicant]
Chinese Office Action received in Chinese Application No. 2019800100707.0 dated Apr. 26, 2024 in 41 pages. [cited by applicant]
Chinese Office Action received in Chinese Application No. 2019800100707.0 dated Sep. 14, 2024 in 11 pages. [cited by applicant]
Korean Office Action received in Korean Application No. 10-2022-7006639, dated Nov. 19, 2024, 5 pages. [cited by applicant]
International Partial Search Report mailed Feb. 5, 2025, for International Application No. PCT/US2024/059844, 80 pages. [cited by applicant]