Systems and methods for distance and congestion-aware resource deployment
First Claim
1. A method for estimating a vehicle deployment region, the method comprising the following operations performed by one or more processors:
- constructing a graph data structure using at least in part a single invocation of a form of Dijkstra'"'"'s algorithm;
partitioning an angular space centered on a vehicle location into a plurality of angular space regions, the vehicle location corresponding to a current or potential location of a vehicle;
selecting, for at least three of the plurality of the partitioned angular space regions, a geographical location within the angular space region, wherein each selected geographical location in an angular space region is a geographical location furthest from the vehicle location, and wherein each selected geographical location was determined, using the graph data structure, to be reachable from the vehicle location within a specified maximum cost; and
forming a polygon representing a vehicle deployment region from the selected geographical locations.
8 Assignments
0 Petitions
Accused Products
Abstract
Computer-implemented systems and methods are disclosed for distance and congestion-aware resource deployment. In some embodiments, a method is provided to estimate a vehicle deployment region. The method includes constructing a graph data structure using at least in part a single invocation of a form of Dijkstra'"'"'s algorithm. The method additionally includes partitioning an angular space centered on a vehicle location into a plurality of angular space regions, the vehicle location corresponding to a current or potential location of the vehicle. The method also includes selecting, for at least three of the plurality of the partitioned angular space regions, a geographical location within the angular space region, wherein each selected geographical location in an angular space region is a geographical location furthest from the vehicle location, and wherein each selected geographical location was determined, using the graph data structure, to be reachable from the vehicle location within a specified maximum cost. The method further includes forming a polygon representing a vehicle deployment region from the selected geographical locations.
-
Citations
20 Claims
-
1. A method for estimating a vehicle deployment region, the method comprising the following operations performed by one or more processors:
-
constructing a graph data structure using at least in part a single invocation of a form of Dijkstra'"'"'s algorithm; partitioning an angular space centered on a vehicle location into a plurality of angular space regions, the vehicle location corresponding to a current or potential location of a vehicle; selecting, for at least three of the plurality of the partitioned angular space regions, a geographical location within the angular space region, wherein each selected geographical location in an angular space region is a geographical location furthest from the vehicle location, and wherein each selected geographical location was determined, using the graph data structure, to be reachable from the vehicle location within a specified maximum cost; and forming a polygon representing a vehicle deployment region from the selected geographical locations. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A system for estimating a vehicle deployment region, the system comprising:
-
a memory device that stores a set of instructions; and at least one processor that executes the set of instructions to perform the following operations; construct a graph data structure using at least in part a single invocation of a form of Dijkstra'"'"'s algorithm; partition an angular space centered on a vehicle location into a plurality of angular space regions, the vehicle location corresponding to a current or potential location of a vehicle; select, for at least three of the plurality of the partitioned angular space regions, a geographical location within the angular space region, wherein each selected geographical region in an angular space region is a geographical location furthest from the center of the angular space, and wherein each selected geographical location within an angular space region was determined, using the graph data structure, to be reachable from the vehicle location within a specified maximum cost; and form a polygon representing a vehicle deployment region from the selected geographical locations. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20)
-
Specification