Autonomous rideshare rebalancing
US-12055936-B2 · Aug 6, 2024 · US
US9989371B1 · US · B1
| Field | Value |
|---|---|
| Publication number | US-9989371-B1 |
| Application number | US-201715602425-A |
| Country | US |
| Kind code | B1 |
| Filing date | May 23, 2017 |
| Priority date | Sep 22, 2015 |
| Publication date | Jun 5, 2018 |
| Grant date | Jun 5, 2018 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Methods, apparatus, systems, and computer-readable media are provided for determining and assigning intermediate handoff checkpoints for low-resolution robot planning. In various implementations, a global path planner may identify a task to be performed by a robot in an environment. In various implementations, the global path planner may determine, based at least in part on one or more attributes of the environment or the task, an intermediate handoff checkpoint for the robot to reach by a scheduled time while the robot performs the task. In various implementations, the global path planner may determine that a measure of reactivity that would be attributable to the robot upon the robot being assigned the intermediate handoff checkpoint satisfies a reactivity threshold. In various implementations, the global path planner may provide, to a local path planner associated with the robot, data indicative of the intermediate handoff checkpoint.
Opening claim text (preview).
What is claimed is: 1. A method comprising: identifying, by a global path planner implemented by a computing system, a task to be performed by a given robot of a plurality of robots in an environment, wherein the plurality of robots are in communication with the global path planner; determining, by the global path planner, a first intermediate handoff checkpoint for the given robot to reach while the given robot performs the task; transmitting, by the global path planner over one or more networks, to a local path planner associated with the given robot, data indicative of the first intermediate handoff checkpoint; determining, by the global path planner, a second intermediate handoff checkpoint for the given robot to reach consecutively after the given robot meets the first intermediate handoff checkpoint while the given robot performs the task, wherein a spatial or temporal difference between the first and second intermediate handoff checkpoints is selected based on one or more attributes of the environment; and transmitting, by the global path planner over one or more of the networks, to the local path planner associated with the given robot, data indicative of the second intermediate handoff checkpoint; wherein transmitting the first and second intermediate handoff checkpoints causes the given robot to operate in a manner in which the given robot consecutively reaches the first and second intermediate handoff checkpoints. 2. The method of claim 1 , wherein the one or more attributes of the environment comprise a latency associated with a communication channel between the global path planner and the local path planner. 3. The method of claim 1 , wherein the one or more attributes of the environment comprise dropoff characteristics associated with a communication channel between the global path planner and the local path planner. 4. The method of claim 1 , wherein the one or more attributes of the environment comprise a level of entropy in the environment. 5. The method of claim 1 , wherein the one or more attributes of the environment comprise an observed change in a level of entropy in the environment. 6. The method of claim 1 , wherein the one or more attributes of the environment comprise an observed change in the environment. 7. The method of claim 1 , further comprising including, by the global path planner, in the data indicative of the second intermediate handoff checkpoint, an amount of precision about how the local path planner is to operate the robot to reach the second intermediate handoff checkpoint, wherein the amount of precision is commensurate with an amount of knowledge the global path planner has about the environment or the task. 8. A system comprising one or more processors and memory operably coupled with the one or more processors, wherein the memory stores instructions that, in response to execution of the instructions by one or more processors, cause the one or more processors to implement a global path planner that performs the following operations: identifying a task to be performed by a given robot of a plurality of robots in an environment, wherein the plurality of robots are in communication with the global path planner; determining a first intermediate handoff checkpoint for the given robot to reach while the given robot performs the task; transmitting, over one or more networks, to a local path planner associated with the given robot, data indicative of the first intermediate handoff checkpoint; determining a second intermediate handoff checkpoint for the given robot to reach consecutively after the given robot meets the first intermediate handoff checkpoint while the given robot performs the task, wherein a spatial or temporal difference between the first and second intermediate handoff checkpoints is selected based on one or more attributes of the environment; and transmitting, over one or more of the networks, to the local path planner associated with the given robot, data indicative of the second intermediate handoff checkpoint; wherein transmitting the first and second intermediate handoff checkpoints causes the given robot to operate in a manner in which the given robot consecutively reaches the first and second intermediate handoff checkpoints. 9. The system of claim 8 , wherein the one or more attributes of the environment comprise a latency associated with a communication channel between the global path planner and the local path planner. 10. The system of claim 8 , wherein the one or more attributes of the environment comprise dropoff characteristics associated with a communication channel between the global path planner and the local path planner. 11. The system of claim 8 , wherein the one or more attributes of the environment comprise a level of entropy in the environment. 12. The system of claim 8 , wherein the one or more attributes of the environment comprise an observed change in a level of entropy in the environment. 13. The system of claim 8 , wherein the one or more attributes of the environment comprise an observed change in the environment. 14. The system of claim 8 , further comprising instructions to include, in the data indicative of the second intermediate handoff checkpoint, an amount of precision about how the local path planner is to operate the robot to reach the second intermediate handoff checkpoint, wherein the amount of precision is commensurate with an amount of knowledge the global path planner has about the environment or the task. 15. At least one non-transitory computer-readable medium comprising instructions that, in response to execution of the instructions by one or more processors, cause the one or more processors to implement a global path planner that performs the following operations: identifying a task to be performed by a given robot of a plurality of robots in an environment, wherein the plurality of robots are in communication with the global path planner; determining a first intermediate handoff checkpoint for the given robot to reach while the given robot performs the task; transmitting, over one or more networks, to a local path planner associated with the given robot, data indicative of the first intermediate handoff checkpoint; determining a second intermediate handoff checkpoint for the given robot to reach consecutively after the given robot meets the first intermediate handoff checkpoint while the given robot performs the task, wherein a spatial or temporal difference between the first and second intermediate handoff checkpoints is selected based on one or more attributes of the environment; and transmitting, over one or more of the networks, to the local path planner associated with the given robot, data indicative of the second intermediate handoff checkpoint; wherein transmitting the first and second intermediate handoff checkpoints causes the given robot to operate in a manner in which the given robot consecutively reaches the first and second intermediate handoff checkpoints. 16. The at least one non-transitory computer readable medium of claim 15 , wherein the one or more attributes of the environment comprise a latency associated with a communication channel between the global path planner and the local path planner. 17. The at least one non-transitory computer readable medium of claim 15 , wherein the one or more attributes of the environment comprise dropoff characteristics associated with a communication channel between the global path planner and the local path planner. 18. The at least one non-transitory computer readable medium of claim 15 , wher
by means of a wireless system for controlling one or several manipulators · CPC title
Rendezvous; Ride sharing · CPC title
Manipulators mounted on wheels or on carriages (B25J1/00 takes precedence; programme-controlled manipulators B25J9/00 {; vehicle aspects B60, B62, e.g. remote-controlled steering for motor vehicles B62D1/24; control of position of vehicles G05D1/00}) · CPC title
Avoiding collision or forbidden zones · CPC title
Mobile robot · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.