IP Library Granted Patent US 12,468,300
Granted Patent B2
US 12,468,300 · App. 17/830,189 · Granted Nov 11, 2025

Detecting negative obstacles

Inventors: Jeffrey Yu (Cambridge, MA); Benjamin John Swilling (Winchester, MA); Eric Cary Whitman (Arlington, MA)
Assignee: BOSTON DYNAMICS, INC.
G05D1/0214B62D57/032G05D1/0238G05D1/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,468,300
App. No.
17/830,189
Granted
Nov 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 detecting a candidate support surface at an elevation less than a current surface supporting a legged robot. A determination is made on whether the candidate support surface includes an area of missing terrain data within a portion of an environment surrounding the legged robot, where the area is large enough to receive a touchdown placement for a leg of the legged robot. If missing terrain data is determined, at least a portion of the area of missing terrain data is classified as a no-step region of the candidate support surface. The no-step region indicates a region where the legged robot should avoid touching down a leg of the legged robot.

Claims (63)

1 . A computer-implemented method when executed by data processing hardware causes the data processing hardware to perform operations comprising:

identifying a first elevation value for a first elevation of a first portion of an environment that depends at least in part on an orientation of a sensor of a legged robot with respect to the first portion of the environment;

determining, based on sensor data from the sensor, that the first elevation value is less than a second elevation value for a second elevation of a second portion of the environment supporting the legged robot;

determining that at least a subset of the first portion of the environment is occluded from the sensor;

classifying the first portion of the environment as a no-step region indicating a region to avoid touching down a distal end of a leg of the legged robot in response to determining that the first elevation value is less than the second elevation value and determining that the at least a subset of the first portion of the environment is occluded from the sensor; and

instructing movement by the legged robot based on classifying the first portion of the environment as the no-step region.

2 . The method of claim 1 , wherein determining that the first elevation value is less than the second elevation value is based on an output of a terrain mapping system of the legged robot.

3 . The method of claim 1 , wherein classifying the first portion of the environment as the no-step region comprises:

re-classifying the first portion of the environment from a step region to the no-step region.

4 . The method of claim 1 , wherein the first portion of the environment corresponds to a gap in the environment, wherein the operations further comprise:

classifying a third portion of the environment adjacent to the gap as the no-step region.

5 . The method of claim 1 , wherein determining that the first elevation value is less than the second elevation value comprises:

determining that the first portion of the environment corresponds to a gap in the environment, wherein the gap extends from a first position in the environment that is adjacent the legged robot to a second position in the environment.

6 . The method of claim 5 , wherein the operations further comprise:

classifying a third portion of the environment adjacent to the first position as the no-step region; and

classifying a fourth portion of the environment adjacent to the second position as the no-step region.

7 . The method of claim 1 , wherein determining that the first elevation value is less than the second elevation value comprises:

determining that the first portion of the environment corresponds to a gap in the environment, wherein the gap corresponds to a width that is less than a stride length of the legged robot.

8 . The method of claim 1 , wherein instructing movement by the legged robot comprises:

instructing the legged robot to move using four legs of the legged robot, the four legs coupled to a body of the legged robot.

9 . The method of claim 1 , wherein determining that the at least a subset of the first portion of the environment is occluded from the sensor comprises:

determining that the sensor data does not include sensor data associated with the at least a subset of the first portion of the environment.

10 . The method of claim 1 , wherein identifying the first elevation value comprises:

identifying the first elevation value that is different from a third elevation value for a third elevation of a ground surface associated with the first portion of the environment.

11 . The method of claim 1 , wherein the operations further comprise:

obtaining the sensor data from the sensor as disposed on a front end portion of a body of the legged robot.

12 . The method of claim 1 , wherein the operations further comprise:

obtaining the sensor data from the sensor as disposed on a rear end portion of a body of the legged robot.

13 . The method of claim 1 , wherein the operations further comprise:

obtaining the sensor data as the legged robot traverses the environment at a particular speed or gait.

14 . The method of claim 1 , wherein instructing movement by the legged robot comprises:

providing instructions to the legged robot; and

executing, by the legged robot, the instructions, wherein the legged robot moves the distal end of the leg from the second portion of the environment to a third portion of the environment based on executing the instructions.

15 . A robot comprising:

a body;

two or more legs coupled to the body;

a sensor; and

an obstacle detection 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:

identify a first elevation value for a first elevation of a first portion of an environment that depends at least in part on an orientation of the sensor with respect to the first portion of the environment;

determine, based on sensor data from the sensor, that the first elevation value is less than a second elevation value for a second elevation of a second portion of the environment supporting at least one of the two or more legs;

determine that at least a subset of the first portion of the environment is occluded from the sensor;

classify the first portion of the environment as a no-step region indicating a region to avoid touching down a distal end of a leg of the two or more legs of the robot in response to determining that the first elevation value is less than the second elevation value and determining that the at least a subset of the first portion of the environment is occluded from the sensor; and

instruct movement by the robot based on classifying the first portion of the environment as the no-step region.

16 . The robot of claim 15 , wherein determining that the first elevation value is less than the second elevation value is based on an output of a terrain mapping system of the robot.

17 . The robot of claim 15 , wherein to classify the first portion of the environment as the no-step region, execution of the instructions on the data processing hardware further causes the data processing hardware to:

reclassify the first portion of the environment from a step region to the no-step region.

18 . The robot of claim 15 , wherein the first portion of the environment corresponds to a gap in the environment, wherein execution of the instructions on the data processing hardware further causes the data processing hardware to:

classify a third portion of the environment adjacent to the gap as the no-step region.

19 . The robot of claim 15 , wherein: the first portion of the environment corresponds to a gap in the environment that extends from a first position in the environment that is adjacent the robot to a second position in the environment.

20 . The robot of claim 19 , wherein execution of the instructions on the data processing hardware further causes the data processing hardware to:

classify a third portion of the environment adjacent to the first position as the no-step region; and

classify a fourth portion of the environment adjacent to the second position as the no-step region.

21 . The robot of claim 15 , wherein the first portion of the environment corresponds to a gap in the environment, wherein the gap corresponds to a width that is less than a stride length of the robot.

22 . The robot of claim 15 , wherein the two or more legs comprise four legs.

23 . The robot of claim 15 , wherein to determine that the at least a subset of the first portion of the environment is occluded from the sensor, execution of the instructions on the data processing hardware further causes the data processing hardware to:

determine that the sensor data does not include sensor data associated with the at least a subset of the first portion of the environment.

24 . The robot of claim 15 , wherein a third elevation value for a third elevation of a ground surface associated with the first portion of the environment is different from the first elevation value and the second elevation value.

25 . The robot of claim 15 , wherein the sensor is disposed on a front end portion of the body.

26 . The robot of claim 15 , wherein the sensor is disposed on a rear end portion of the body.

27 . The robot of claim 15 , wherein the robot traverses the environment at a particular speed or gait.

28 . The robot of claim 15 , wherein to instruct movement by the robot, execution of the instructions on the data processing hardware further causes the data processing hardware to:

provide a set of instructions to the robot; and

execute, by the robot, the set of instructions, wherein the robot moves the distal end of the leg from the second portion of the environment to a third portion of the environment based on executing the instructions.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 31, 2022
From: YU, JEFFREY; SWILLING, BENJAMIN JOHN; WHITMAN, ERIC CARY
To: BOSTON DYNAMICS, INC.
Reel/Frame 060959/0376 →
Continuity (2)
Provisional Application 63202283 · Jun 4, 2021
Related Publication 20220390952A1 · Dec 8, 2022
References Cited (234)
US 5111401A · Everett, Jr. · 1992 [cited by examiner]
US 5307271A · Everett, Jr. · 1994 [cited by examiner]
US 5378969A · Haikawa · 1995 [cited by examiner]
US 7211980B1 · Bruemmer et al. · 2007 [cited by applicant]
US 7769491B2 · Fukuchi · 2010 [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 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 · 2019 [cited by examiner]
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 et al. · 2022 [cited by applicant]
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 · 2023 [cited by examiner]
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 · 2024 [cited by examiner]
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 · 2015 [cited by examiner]
US 20150355638A1 · Field et al. · 2015 [cited by applicant]
US 20150362921A1 · Hanaoka · 2015 [cited by examiner]
US 20170131102A1 · Wirbel et al. · 2017 [cited by applicant]
US 20170168488A1 · Wierzynski et al. · 2017 [cited by applicant]
US 20170176990A1 · Keller · 2017 [cited by examiner]
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 applicant]
US 20180364717A1 · Douillard et al. · 2018 [cited by applicant]
US 20190079523A1 · Zhu et al. · 2019 [cited by applicant]
US 20190080463A1 · Davison et al. · 2019 [cited by applicant]
US 20190100306A1 · Pohl et al. · 2019 [cited by applicant]
US 20190138029A1 · Ryll et al. · 2019 [cited by applicant]
US 20190171911A1 · Greenberg · 2019 [cited by applicant]
US 20190187703A1 · Millard et al. · 2019 [cited by applicant]
US 20190213896A1 · Gohl · 2019 [cited by examiner]
US 20190258737A1 · Wang et al. · 2019 [cited by applicant]
US 20190318277A1 · Goldman et al. · 2019 [cited by applicant]
US 20200117198A1 · Whitman · 2020 [cited by examiner]
US 20200117214A1 · Jonak · 2020 [cited by examiner]
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 · 2021 [cited by examiner]
US 20210141389A1 · Jonak et al. · 2021 [cited by applicant]
US 20210147017A1 · Swilling et al. · 2021 [cited by applicant]
US 20210158544A1 · Steinmeyer et al. · 2021 [cited by applicant]
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 · 2022 [cited by examiner]
US 20220324104A1 · Whitman et al. · 2022 [cited by applicant]
US 20220342421A1 · Kearns et al. · 2022 [cited by applicant]
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 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]
US 20250155888A1 · Whitman et al. · 2025 [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]
Hines, Thomas 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]
International Search Report and Written Opinion, mailed Sep. 28, 2022, for International Application No. PCT/US2022/072704, 17 pages. [cited by applicant]
M. Bajracharya, J. Ma, M. Malchano, A. Perkins, A. A. Rizzi and L. Matthies, “High fidelity day/night stereo mapping with vegetation and negative obstacle detection for vision-in-the-loop walking,” 2013 IEEE/RSJ Interna… [cited by applicant]
H. Karunasekera, H. Zhang, T. Xi and H. Wang, “Stereo vision based negative obstacle detection,” 2017 13th IEEE International Conference on Control & Automation (ICCA), 2017, pp. 834-838. [cited by applicant]
J. Larson et al., “Lidar based off-road negative obstacle detection and analysis,” IEEE 14 [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]
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 OnlineSparse Topological Graphs” IEEE International Conference on Robotics and Automation (ICRA) Aug. 2020. [cited by applicant]
Github.com, “cartographer-project/cartographer”, https://github.com/cartographer-project/cartographer, downloaded Feb. 1, 2023, 4 pages. [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]
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]
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%20buffer1%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, 13 pages. [cited by applicant]
International Search Report and Written Opinion, PCT/US/2019/051511, Jul. 1, 2020, 15 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]
Lourenço et al., “A Volumetric Representation for Obstacle Detection in Vegetated Terrain,” In 2014 IEEE International Conference on Robotics and Biomimetics (ROBIO 2014) Dec. 5, 2014 (pp. 283-290). [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]
Curless, et al., “A Volumetric Method for Building Complex Models from Range Images,” In Proceedings of the 23rd Annual Conference Comp Graph Inter Tech. Aug. 1, 1996 (pp. 303-312). [cited by applicant]
Github.com, “Volumetric TSDF Fusion of RGB-D Images in Python,” https://github.com/andyzeng/tsdf-fusion-python?tab=readme-ov-file#readme, downloaded Jun. 17, 2025 (3 pages). [cited by applicant]
Kähler, et al., “Very High Frame Rate Volumetric Integration of Depth Images on Mobile Devices,” IEEE Trans Visual Comp Graph. Jul. 23, 2015 (pp. 1241-1250). [cited by applicant]
Newcombe, et al., “KinectFusion: Real-time Dense Surface Mapping and Tracking,” In 2011 10th IEEE Inter Symp Mixed Augm Reality, Oct. 26, 2011 (pp. 127-136). [cited by applicant]
Robots.ox.ac.uk, “InfiniTAM v3,” https://www.robots.ox.ac.uk/˜victor/infinitam/, downloaded Jun. 17, 2025 (2 pages). [cited by applicant]
Shotton, et al., “Scene Coordinate Regression Forests for Camera Relocalization in RGB-D Images,” In Proceedings of the 2013 IEEE Conf Comp Vision and Pattern Recogni., 2013 (pp. 2930-2937). [cited by applicant]
Wooden, et al., “Autonomous Navigation for BigDog”, In 2010 IEEE Inter Conf Robot Auto., May 3, 2010 (pp. 4736-4741). [cited by applicant]
International Search Report and Written Opinion dated Mar. 26, 2025, for International Application No. PCT/US2024/059844, 16 pages. [cited by applicant]