Planning trips on a road network using traction information for the road network
First Claim
Patent Images
1. A method for providing transport for a trip, the method comprising:
- maintaining, for a given geographic region, a data structure that identifies a traction value for each location in a plurality of locations of a road network within a geographic region;
identifying, by a computing system comprising one or more computing devices, at least one of a start or destination location for the trip;
planning the trip, including selecting, by the computing system, at least one of a route or a vehicle to use for the trip, based on the traction values of one or more of the plurality of locations; and
directing the vehicle to operate along the planned trip from the start to the destination location.
3 Assignments
0 Petitions
Accused Products
Abstract
A computer system maintains, for a given geographic region, a data structure that identifies a traction value for each of a plurality of locations of a road network within a geographic region. At least of a start or destination location is determined for the trip. The computer system may plan the trip, including selecting at least one of a route or a vehicle to use for the trip, based on the traction values of one or more of the plurality of locations.
56 Citations
20 Claims
-
1. A method for providing transport for a trip, the method comprising:
-
maintaining, for a given geographic region, a data structure that identifies a traction value for each location in a plurality of locations of a road network within a geographic region; identifying, by a computing system comprising one or more computing devices, at least one of a start or destination location for the trip; planning the trip, including selecting, by the computing system, at least one of a route or a vehicle to use for the trip, based on the traction values of one or more of the plurality of locations; and directing the vehicle to operate along the planned trip from the start to the destination location. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A non-transitory computer readable medium that stores instructions, which when executed by one or more processors, cause the one or more processors to perform operations that include:
-
maintaining, for a given geographic region, a data structure that identifies a traction value for each location in a plurality of locations of a road network within a geographic region; identifying at least one of a start or destination location for a trip; planning the trip, including selecting at least one of a route or a vehicle to use for the trip, based on the traction values of one or more of the plurality of locations; and directing the vehicle to operate along the planned trip from the start to the destination location. - View Dependent Claims (18, 19, 20)
-
Specification