Telogis, Inc.

Verizon Patent and Licensing Inc.

Mark A Fryer

Ralph James Mason

David John Mitchell

William Robert Elliot

Hughan Jay Ross

Mykhaylo Tyuryutikov

Brad Llewellyn

Peter Lear

Victor Rehorst

Michael Fried

Steven Ashley

Ben Burns

Jeffrey Fiore

Sebastien Sydney Robert Bigot

Rick Turek

A route planning platform can find a path through a road network that has turn complexities. The route planning platform can identify, in the road network, multiple paths from an origin node to a destination node, including at least one path having a turn complexity (e.g., a turn cost, a turn restriction, and/or the like). The route planning platform can compute a respective cost for each respective path from the origin node to the destination node based on a total cost associated with a set of road segments in the respective path, and the cost for the at least one path having the turn complexity can be further based on the turn cost or the turn restriction along the at least one path. The route planning platform can select, among the multiple paths, a shortest path based on the respective cost for each path.

Pathfinding through a road network with turn complexities

A device receives historical map data, and receives, during a time period, location data associated with a location of a vehicle. The device processes the location data, with a fitted history model, to generate a vehicle path, and processes a portion of the location data, with the fitted history model, to generate a fitted history path, based on the historical map data. The device compares the vehicle path and the fitted history path, and determines whether the vehicle path and the fitted history path match based on comparing the vehicle path and the fitted history path. The device provides the portion of the location data when the vehicle path and the fitted history path match, or adds location data to the portion of the location data and provides the portion of the location data and the added location data, when the vehicle path and the fitted history path do not match.

Dynamic reporting of location data for a vehicle based on a fitted history model

Systems and methods for determination of an access path are disclosed. The access path may include any drivable route that is within a site, and is often, but not necessarily, exclusive of roads in a road network external to the site. In some cases, access paths may include a set of streets between two or more sites without necessarily including a drivable path within a site. Further, the systems and methods may calculate or determine minimum cost routes that include the access path. In some cases, the calculated route may be the minimum cost route that includes the access path, but not necessarily a minimum cost route to a site. In other words, in some cases, the selection of an access path serves as a constraint that supersedes the calculation of a minimum cost route.

Context-based routing and access path selection

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 &#x201c;fitted&#x201d; route overlaid on a map. The &#x201c;fitted&#x201d; route can provide more useful tracking information to an administrator compared to simply displaying direct routes between known route stops.

Vehicle route calculation

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

Vehicle management systems and associated processes can determine and consider street classifications when selecting routes for fleet vehicles. In one embodiment, a system for calculating routes for a plurality of vehicles in a vehicle fleet includes a computer system. The computer system is configured to receive custom data to classify streets of a network of streets in a geographic region for use in calculating routes. Based at least in part on the received custom data, the computer system can calculate custom routes on the network of streets between waypoint locations. In addition, the computer system can determine a classification for each street of the network of streets based at least in part on the calculated custom routes. The classification can include a score indicative of a hierarchical ranking of each street for calculating routes for the fleet vehicles on the network of streets in the geographic region.

Growing community of inventors

Christchurch, New Zealand

Mark A Fryer