| TELOGIS, INC. Patent applications |
| Patent application number | Title | Published |
|---|
| 20120022904 | VEHICLE ROUTE SELECTION BASED ON ENERGY USAGE - 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. | 01-26-2012 |
| 20120016582 | 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. | 01-19-2012 |
| 20110238457 | VEHICLE ROUTE SELECTION BASED ON ENERGY USAGE - 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. | 09-29-2011 |
| 20110041088 | REAL TIME MAP RENDERING WITH DATA CLUSTERING AND EXPANSION AND OVERLAY - 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. | 02-17-2011 |
| 20100153005 | 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. | 06-17-2010 |
