IP Library Granted Patent US 12,304,082
Granted Patent B2
US 12,304,082 · App. 17/805,005 · Granted May 20, 2025

Alternate route finding for waypoint-based navigation maps

Inventor: Gene Brown Merewether (Chestnut Hill, MA)
Assignee: Boston Dynamics, Inc.
B25J9/1664B25J9/162B25J9/1697B25J19/023
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,304,082
App. No.
17/805,005
Granted
May 20, 2025
Kind
B2
Abstract

A computer-implemented method executed by data processing hardware of a robot causes the data processing hardware to perform operations including obtaining a topological map including waypoints and edges. Each edge connects adjacent waypoints. The waypoints and edges represent a navigation route for the robot to follow. Operations include determining, that an edge that connects first and second waypoints is blocked by an obstacle. Operations include generating, using image data and the topological map, one or more alternate waypoints offset from one of the waypoints. For each alternate waypoint, operations include generating an alternate edge connecting the alternate waypoint to a waypoint. Operations include adjusting the navigation route to include at least one alternate waypoint and alternate edge that bypass the obstacle. Operations include navigating the robot from the first waypoint to an alternate waypoint along the alternate edge connecting the alternate waypoint to the first waypoint.

Claims (62)

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

obtaining a navigation route for the robot, the navigation route comprising a first route waypoint, a second route waypoint, and a first route edge connecting the first route waypoint and the second route waypoint, wherein navigation by the robot according to the navigation route is constrained by a first constraint, wherein the first constraint is based on at least one of the first route waypoint or the second route waypoint;

receiving, from an image sensor, image data;

determining, using the image data and the first constraint, that the first route edge is at least partially blocked by an obstacle;

generating, using the image data and the navigation route, a first alternate route waypoint and a first alternate route edge connecting the first alternate route waypoint and the first route waypoint;

adjusting the navigation route to obtain an adjusted navigation route, the adjusted navigation route comprising the first alternate route waypoint and the first alternate route edge, wherein the first alternate route waypoint and the first alternate route edge bypass the first route edge that is at least partially blocked by the obstacle; and

instructing the robot to navigate according to the adjusted navigation route.

2. The computer-implemented method of claim 1 , wherein instructing the robot to navigate according to the adjusted navigation route comprises:

providing instructions to the robot;

wherein the operations further comprise;

executing, by the robot, the instructions, wherein, based on executing the instructions, the robot navigates from the first route waypoint to the first alternate route waypoint via the first alternate route edge.

3. The computer-implemented method of claim 1 , wherein adjusting the navigation route comprises:

obtaining a first cost associated with the first route edge;

obtaining a second cost associated with the first alternate route edge; and

determining the adjusted navigation route based on the first cost and the second cost.

4. The computer-implemented method of claim 3 , wherein the second cost is less than the first cost.

5. The computer-implemented method of claim 1 , wherein the first alternate route waypoint is offset from the second route waypoint by an offset distance associated with the image sensor.

6. The computer-implemented method of claim 1 , wherein the operations further comprise:

generating a second alternate route edge connecting the first alternate route waypoint and a second alternate route waypoint.

7. The computer-implemented method of claim 6 , wherein the operations further comprise:

determining that the second alternate route edge is at least partially blocked; and

readjusting the navigation route to obtain a readjusted navigation route, the readjusted navigation route comprising a third alternate route waypoint.

8. The computer-implemented method of claim 1 , wherein generating the first alternate route waypoint comprises:

generating the first alternate route waypoint based on a polyline buffer.

9. The computer-implemented method of claim 1 , wherein generating the first alternate route waypoint comprises:

generating one or more alternate route waypoints within a threshold distance of a location of the robot.

10. The computer-implemented method of claim 1 , wherein the navigation route is based on one or more locations of one or more obstacles.

11. The computer-implemented method of claim 1 , wherein navigation by the robot according to the adjusted navigation route is constrained by a second constraint.

12. The computer-implemented method of claim 1 , wherein generating the first alternate route waypoint comprises:

generating at least two alternate route waypoints and at least two alternate route edges, each alternate route edge of the at least two alternate route edges connecting a respective alternate route waypoint of the at least two alternate route waypoints and the first route waypoint.

13. A system comprising:

data processing hardware of a robot; 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 perform operations comprising:

obtaining a navigation route for the robot, the navigation route comprising a first route waypoint, a second route waypoint, and a first route edge connecting the first route waypoint and the second route waypoint, wherein navigation by the robot according to the navigation route is constrained by a first constraint, wherein the first constraint is based on at least one of the first route waypoint or the second route waypoint;

receiving, from an image sensor, image data;

determining, using the image data and the first constraint, that the first route edge is at least partially blocked by an obstacle;

generating, using the image data and the navigation route, a first alternate route waypoint and a first alternate route edge connecting the first alternate route waypoint and the first route waypoint;

adjusting the navigation route to obtain an adjusted navigation route, the adjusted navigation route comprising the first alternate route waypoint and the first alternate route edge, wherein the first alternate route waypoint and the first alternate route edge bypass the first route edge that is at least partially blocked by the obstacle; and

instructing the robot to navigate according to the adjusted navigation route.

14. The system of claim 13 , wherein instructing the robot to navigate according to the adjusted navigation route comprises:

providing instructions to the robot;

wherein the operations further comprise:

executing, by the robot, the instructions, wherein, based on executing the instructions, the robot navigates from the first route waypoint to the first alternate route waypoint via the first alternate route edge.

15. The system of claim 13 , wherein adjusting the navigation route comprises:

obtaining a first cost associated with the first route edge;

obtaining a second cost associated with the first alternate route edge; and

determining the adjusted navigation route based on the first cost and the second cost.

16. The system of claim 15 , wherein the second cost is less than the first cost.

17. The system of claim 13 , wherein the first alternate route waypoint is offset from the second route waypoint by an offset distance associated with the image sensor.

18. The system of claim 13 , wherein the operations further comprise;

generating a second alternate route edge connecting the first alternate route waypoint and a second alternate route waypoint.

19. The system of claim 18 , wherein the operations further comprise:

determining that the second alternate route edge is at least partially blocked; and

readjusting the navigation route to obtain a readjusted navigation route, the readjusted navigation route comprising a third alternate route waypoint.

20. The system of claim 13 , wherein generating the first alternate route waypoint comprises;

generating the first alternate route waypoint based on a polyline buffer.

21. The system of claim 13 , wherein generating the first alternate route waypoint comprises:

generating one or more alternate route waypoints within a threshold distance of a location of the robot.

22. The system of claim 13 , wherein the navigation route is based on one or more locations of one or more obstacles.

23. The system of claim 13 , wherein navigation by the robot according to the adjusted navigation route is constrained by a second constraint.

24. The system of claim 13 , wherein generating the first alternate route waypoint comprises:

generating at least two alternate route waypoints and at least two alternate route edges, each alternate route edge of the at least two alternate route edges connecting a respective alternate route waypoint of the at least two alternate route waypoints and the first route waypoint.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 18, 2022
From: MEREWETHER, GENE BROWN
To: BOSTON DYNAMICS, INC.
Reel/Frame 060848/0133 →
Continuity (2)
Provisional Application 63202288 · Jun 4, 2021
Related Publication 20220388170A1 · Dec 8, 2022
References Cited (235)
US 5111401A · Everett et al. · 1992 [cited by applicant]
US 5378969A · Haikawa · 1995 [cited by applicant]
US 7211980B1 · Bruemmer et al. · 2007 [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 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 · da 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 et al. · 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 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 et al. · 2021 [cited by applicant]
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 et al. · 2022 [cited by applicant]
US 11518029B2 · Cantor et al. · 2022 [cited by applicant]
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 applicant]
US 20060025888A1 · Gutmann et al. · 2006 [cited by applicant]
US 20060167621A1 · Dale · 2006 [cited by applicant]
US 20070233338A1 · Ariyur et al. · 2007 [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 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 et al. · 2011 [cited by applicant]
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 et al. · 2016 [cited by applicant]
US 20170017236A1 · Song et al. · 2017 [cited by applicant]
US 20170095383A1 · Li et al. · 2017 [cited by applicant]
US 20170120448A1 · Lee et al. · 2017 [cited by applicant]
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 20190016312A1 · Carlson · 2019 [cited by examiner]
US 20190056743A1 · Alesiani et al. · 2019 [cited by applicant]
US 20190079523A1 · Zhu et al. · 2019 [cited by applicant]
US 20190080463A1 · Davison et al. · 2019 [cited by applicant]
US 20190113927A1 · Englard · 2019 [cited by examiner]
US 20190138029A1 · Ryll et al. · 2019 [cited by applicant]
US 20190171911A1 · Greenberg · 2019 [cited by applicant]
US 20190187699A1 · Salour et al. · 2019 [cited by applicant]
US 20190187703A1 · Millard · 2019 [cited by examiner]
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 20200039427A1 · Chen et al. · 2020 [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 et al. · 2020 [cited by applicant]
US 20200198140A1 · Dupuis et al. · 2020 [cited by applicant]
US 20200216061A1 · Zidek · 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 · 2021 [cited by examiner]
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 20210200219A1 · Gaschler · 2021 [cited by examiner]
US 20210311480A1 · Yang et al. · 2021 [cited by applicant]
US 20210323618A1 · Komoroski · 2021 [cited by applicant]
US 20210382491A1 · Murotani et al. · 2021 [cited by applicant]
US 20220024034A1 · Wei et al. · 2022 [cited by applicant]
US 20220063662A1 · Sprunk et al. · 2022 [cited by applicant]
US 20220083062A1 · Jaquez et al. · 2022 [cited by applicant]
US 20220088776A1 · Kuffner · 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 20220244741A1 · da Silva et al. · 2022 [cited by applicant]
US 20220276654A1 · Lee et al. · 2022 [cited by applicant]
US 20220342421A1 · Kearns · 2022 [cited by applicant]
US 20220374024A1 · Whitman et al. · 2022 [cited by applicant]
US 20220390950A1 · Yamauchi · 2022 [cited by applicant]
US 20220390954A1 · Klingensmith · 2022 [cited by applicant]
US 20230062175A1 · Yahata · 2023 [cited by applicant]
US 20230309776A1 · Li et al. · 2023 [cited by applicant]
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 et al. · 2024 [cited by applicant]
US 20240165821A1 · Dabiri et al. · 2024 [cited by applicant]
US 20240361779A1 · Dellon et al. · 2024 [cited by applicant]
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 113168184A · 2021 [cited by applicant]
CN 113633219 · 2021 [cited by applicant]
CN 114174766A · 2022 [cited by applicant]
CN 114503043A · 2022 [cited by applicant]
JP H02127180A · 1990 [cited by applicant]
JP H09134217 · 2003 [cited by applicant]
JP 2005088189A · 2005 [cited by applicant]
JP 2006011880 · 2006 [cited by applicant]
JP 2006239844A · 2006 [cited by applicant]
JP 2007041656A · 2007 [cited by applicant]
JP 2008072963 · 2008 [cited by applicant]
JP 2009223628A · 2009 [cited by applicant]
JP 2009271513A · 2009 [cited by applicant]
JP 2010253585A · 2010 [cited by applicant]
JP 2013250795 · 2013 [cited by applicant]
JP 2014123200 · 2014 [cited by applicant]
JP 2014151370A · 2014 [cited by applicant]
JP 2016081404 · 2016 [cited by applicant]
JP 2016103158 · 2016 [cited by applicant]
JP 2017182502A · 2017 [cited by applicant]
JP 2019500691A · 2019 [cited by applicant]
JP 2019021197A · 2019 [cited by applicant]
JP 2022504039A · 2022 [cited by applicant]
JP 2022543997A · 2022 [cited by applicant]
JP 7219812B2 · 2023 [cited by applicant]
JP 7259020B2 · 2023 [cited by applicant]
KR 101121763 · 2012 [cited by applicant]
KR 20120019893A · 2012 [cited by applicant]
KR 20130020107A · 2013 [cited by applicant]
KR 20220078563A · 2022 [cited by applicant]
KR 20220083666A · 2022 [cited by applicant]
KR 102492242B1 · 2023 [cited by applicant]
KR 102504729B1 · 2023 [cited by applicant]
KR 20230035139A · 2023 [cited by applicant]
KR 102533690B1 · 2023 [cited by applicant]
WO WO2007051972 · 2007 [cited by applicant]
WO WO2017090108 · 2017 [cited by applicant]
WO WO2018231616A1 · 2018 [cited by applicant]
WO WO2020076418A1 · 2020 [cited by applicant]
WO WO2020076422 · 2020 [cited by applicant]
WO WO2021025707 · 2021 [cited by applicant]
WO WO2021025708A1 · 2021 [cited by applicant]
WO WO2022164832A1 · 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]
WO WO2024220811A2 · 2024 [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]
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, DOI:10.1016/0921-8890(91)90014-C, pp. 47-63. [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. pages 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. 40… [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]
Yamauchi et al. “Place Recognition in Dynamic Environments” Journal of Robotic Systems, Special Issue on Mobile Robots, vol. 14, No. 2, Feb. 1997, https://doi.org/10.1002/(SICI)1097-4563(199702)14:2<107::AID-ROB5>3.0.CO… [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, D… [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]
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), Oct. 15, 2019; pp. 1178-1181, IEEE. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2023/025806, Oct. 11, 2023, 16 pages. [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]
Matsumaru T., Mobile robot with preliminary-announcement and display function of forthcoming motion using projection equipment. In Roman 2006—The 15th IEEE International Symposium on Robot and Human Interactive Communic… [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]
Wengefeld et al., “A laser projection system for robot intention communication and human robot interaction.” In 2020 29th IEEE International Conference on Robot and Human Interactive Communication (RO-MAN) Aug. 3, 20201… [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]
International Search Report and Written Opinion for PCT Application No. PCT/US2024/025417, Nov. 5, 2024, 26 pages. [cited by applicant]
Cited By (1)
US 12,442,640