Telogis, Inc.

Verizon Patent and Licensing Inc.

David John Mitchell

Ralph James Mason

Carl David James Cerecke

John Thomas Morris

Kyle Chi Sung

Arthur Newth Morris, Iv

Seth Nelson Milligan

Howard John Jelinek

Jason Mathew Koch

Mark A Fryer

In an embodiment, a system can determine geocoded data from a database of geographic coordinates and metadata. The system correlates metadata, such as invoice data, to geolocation data, such as GPS or cellular data to determine geocoded data. The system further identifies one or more geographic coordinates for one or more location names, which may not have a corresponding metadata entry, by generating clusters of geographic coordinates. The clusters are then matched to one or location names using a matching algorithm. Accordingly, improved geocoded data may be determined.

Systems and methods for database geocoding

System and methods are disclosed for gathering vehicle data from a vehicle engine computer installed in an engine of a vehicle and a plurality of sensors disposed about the vehicle and providing functionality for a third-party to install and then execute custom scripts within a telematics application to change default functionalities of the telematics application when processing the vehicle data.

Systems and methods for executing custom fleet vehicle management scripts

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.

System for processing fleet vehicle operation information

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.

Natural language parsers to normalize addresses for geocoding

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.

Vehicle fleet routing system

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.

System and method for efficient routing on a network in the presence of multiple-edge restrictions and other constraints

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.

Growing community of inventors

Austin, TX, United States of America

David John Mitchell