Abstract: Vehicle management systems and associated processes can consider energy consumption when selecting routes for fleet vehicles. Vehicle management systems and associated processes are described that, in certain embodiments, evaluate vehicle energy usage based on factors such as terrain or elevation, vehicle characteristics, driver characteristics, road conditions, traffic, speed limits, stop time, turn information, traffic information, and weather information, and the like. The features described herein may also be implemented for non-fleet vehicles, such as in personal vehicle navigation systems.

Abstract: Embodiments provide systems and methods that find the quickest route between two locations on a graph with multi-edge constraints in a time and space efficient manner. In some embodiments, Dijkstra's algorithm is split into separate universes when a) a multiple-edge constraint is reached, and b) along each edge of a multi-edge constraint. In some embodiments, the split is performed for the purpose of finding the quickest (i.e. lowest weighted) route to the intersect ion(s) at the end of the constraints. These universes, in some embodiments, are merged or discarded when the intersection at the end of the constraint is found. Using these systems and methods, in some embodiments, the shortest path between two locations of a multi-edge constrained road network can be efficiently determined.

Abstract: Customization features for providing users with the ability to customize various aspects of a vehicle management system are described. These customization features can include functionality for generating custom reports based on vehicle parameters, including diagnostic codes. The customization features can also include features for customizing alerts based on vehicle parameters and features for customizing nomenclature in the vehicle management system.

Abstract: This disclosure describes vehicle route calculation methods including “fitting” route segments between locations reported by a vehicle at different times along a route to create an overall “fitted” route. In certain embodiments, a vehicle management system generates a vehicle management user interface that displays the “fitted” route overlaid on a map. The “fitted” route can provide more useful tracking information to an administrator compared to simply displaying direct routes between known route stops.

Abstract: A vehicle management system is described herein that can perform a variety of features related to managing fleets of vehicles. For example, the vehicle management system includes a routing module that can perform a variety of functions. Some of these functions can include determining a first route between locations using a simplified routing network and then determining a second route between the locations using a more exhaustive routing network. Further, the routing module can store information about the natural flow through intersections, improving control of routes through intersections. Some or all of these features may be used together, or any of these features may be omitted in any given embodiment.

Abstract: Vehicle management systems and associated processes can incorporate calculations for categorizing locations on a map as within one or more territories based on proximity of the location to predetermined points with in the territories. The systems and processes can also incorporate techniques for estimating total distance required to traverse a route reaching all of a set of predetermined stops, without using a routing algorithm that would provide a usable route for a vehicle, but is less computationally demanding. The systems and processes can also include techniques for incorporating legs of a route that extend through a temporary exclusion zone.

Abstract: The present invention provides a technique for building natural language parsers by implementing a country and/or jurisdiction specific set of training data that is automatically converted during a build phase to a respective predictive model, i.e., an automated country specific natural language parser. The predictive model can be used without the training data to quantify any input address. This model may be included as part of a larger Geographic Information System (GIS) data-set or as a stand alone quantifier. The build phase may also be run on demand and the resultant predictive model kept in temporary storage for immediate use.

Abstract: Systems and methods are provided for the organization, management, and graphical display of multiple logically related entities. In some embodiments, the systems and methods provide the real-time display of status and location information for a fleet of tracked vehicles. In some embodiments, the systems and methods permit the automatic clustering of assets based on a user's view of an underlying map. In some embodiments, the assets are vehicles that are a part of a managed fleet. In some embodiments, the assets are logically arranged into clusters of like assets. In some embodiments, the clusters provide graphical indications of status or class information of their underlying assets.

Abstract: In one embodiment, a system for presenting fleet vehicle operation information in standardized forms includes a telematics module and a data standardizing module. The telematics module receives measurements related to operation of multiple vehicles in a fleet. The data standardizing module, using a first technique, estimates a first value for a parameter for at least one vehicle of the multiple vehicles based at least on the measurements. Further, the data standardizing module, using a second technique, estimates a second value for the parameter for at least one vehicle of the multiple vehicles based at least on the measurements. The second technique including using some measurement to estimate the second value different from the measurements used to estimate the first value according to the first technique. The data standardizing module outputs one or both of the first value and the second value for presentation to a user.

Abstract: Vehicle management systems and associated processes can consider energy consumption when selecting routes for fleet vehicles. Vehicle management systems and associated processes are described that, in certain embodiments, evaluate vehicle energy usage based on factors such as terrain or elevation, vehicle characteristics, driver characteristics, road conditions, traffic, speed limits, stop time, turn information, traffic information, and weather information, and the like. The features described herein may also be implemented for non-fleet vehicles, such as in personal vehicle navigation systems.

Abstract: Embodiments provide systems and methods that find the quickest route between two locations on a graph with multi-edge constraints in a time and space efficient manner. In some embodiments, Dijkstra's algorithm is split into separate universes when a) a multiple-edge constraint is reached, and b) along each edge of a multi-edge constraint. In some embodiments, the split is performed for the purpose of finding the quickest (i.e. lowest weighted) route to the intersect ion(s) at the end of the constraints. These universes, in some embodiments, are merged or discarded when the intersection at the end of the constraint is found. Using these systems and methods, in some embodiments, the shortest path between two locations of a multi-edge constrained road network can be efficiently determined.

Abstract: The present invention provides a technique for building natural language parsers by implementing a country and/or jurisdiction specific set of training data that is automatically converted during a build phase to a respective predictive model, i.e., an automated country specific natural language parser. The predictive model can be used without the training data to quantify any input address. This model may be included as part of a larger Geographic Information System (GIS) data-set or as a stand alone quantifier. The build phase may also be run on demand and the resultant predictive model kept in temporary storage for immediate use.

Abstract: A route scheduling system for a vehicle or fleet of vehicles can recalculate a scheduled route based on input received after the formulation and/or dispatch of the initial route. The additional inputs can be used for recalculation and changes in route selection, which may include a variety of inputs, such as weather conditions, traffic conditions, customer needs, vehicle inventory, and emergency situations. The recalculation of the routes can allow for route selection to be performed in real-time in order for fleets and vehicles to optimize the allocation of resources.

Abstract: In one embodiment, a system for presenting fleet vehicle operation information in standardized forms includes a telematics module and a data standardizing module. The telematics module receives measurements related to operation of multiple vehicles in a fleet. The data standardizing module, using a first technique, estimates a first value for a parameter for at least one vehicle of the multiple vehicles based at least on the measurements. Further, the data standardizing module, using a second technique, estimates a second value for the parameter for at least one vehicle of the multiple vehicles based at least on the measurements. The second technique including using some measurement to estimate the second value different from the measurements used to estimate the first value according to the first technique. The data standardizing module outputs one or both of the first value and the second value for presentation to a user.

Abstract: A vehicle management system is described herein that can perform a variety of features related to managing fleets of vehicles. For example, the vehicle management system includes a routing module that can perform a variety of functions. Some of these functions can include determining a first route between locations using a simplified routing network and then determining a second route between the locations using a more exhaustive routing network. Further, the routing module can store information about the natural flow through intersections, improving control of routes through intersections. Some or all of these features may be used together, or any of these features may be omitted in any given embodiment.

Abstract: Customization features for providing users with the ability to customize various aspects of a vehicle management system are described. These customization features can include functionality for generating custom reports based on vehicle parameters, including diagnostic codes. The customization features can also include features for customizing alerts based on vehicle parameters and features for customizing nomenclature in the vehicle management system.

Abstract: Embodiments provide systems and methods that find the quickest route between two locations on a graph with multi-edge constraints in a time and space efficient manner. In some embodiments, Dijkstra's algorithm is split into separate universes when a) a multiple-edge constraint is reached, and b) along each edge of a multi-edge constraint. In some embodiments, the split is performed for the purpose of finding the quickest (i.e. lowest weighted) route to the intersection(s) at the end of the constraints. These universes, in some embodiments, are merged or discarded when the intersection at the end of the constraint is found. Using these systems and methods, in some embodiments, the shortest path between two locations of a multi-edge constrained road network can be efficiently determined.

Abstract: This disclosure describes vehicle route calculation methods including “fitting” route segments between locations reported by a vehicle at different times along a route to create an overall “fitted” route. In certain embodiments, a vehicle management system generates a vehicle management user interface that displays the “fitted” route overlaid on a map. The “fitted” route can provide more useful tracking information to an administrator compared to simply displaying direct routes between known route stops.

Abstract: Embodiments provide systems and methods that find the quickest route between two locations on a graph with multi-edge constraints in a time and space efficient manner. In some embodiments, Dijkstra's algorithm is split into separate universes when a) a multiple-edge constraint is reached, and b) along each edge of a multi-edge constraint. In some embodiments, the split is performed for the purpose of finding the quickest (i.e. lowest weighted) route to the intersection(s) at the end of the constraints. These universes, in some embodiments, are merged or discarded when the intersection at the end of the constraint is found. Using these systems and methods, in some embodiments, the shortest path between two locations of a multi-edge constrained road network can be efficiently determined.

Abstract: Embodiments provide systems and methods that find the quickest route between two locations on a graph with multi-edge constraints in a time and space efficient manner. In some embodiments, Dijkstra's algorithm is split into separate universes when a) a multiple-edge constraint is reached, and b) along each edge of a multi-edge constraint. In some embodiments, the split is performed for the purpose of finding the quickest (i.e. lowest weighted) route to the intersect ion(s) at the end of the constraints. These universes, in some embodiments, are merged or discarded when the intersection at the end of the constraint is found. Using these systems and methods, in some embodiments, the shortest path between two locations of a multi-edge constrained road network can be efficiently determined.