Computing-time-efficient route determination along several preset path points with given connecting routes in-between
US8401790B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 8, 2009 |
| Grant date | Mar 19, 2013 |
| Priority date | — |
| Expiry date | Apr 12, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG08G5/59
- WIPO fieldControl
- WIPO sectorInstruments
Abstract
A process for determining a route along more than two mutually consecutive preset path points with given connecting routes in-between. In this case, a plurality of connecting routes is given between at least one pair of two mutually consecutive path points. Respective costs and preferably also a respective time duration are assigned to each connecting route. In a first step of the process, a tree is generated which comprises edges and nodes connected by edges. Each node is assigned to a defined path point and each edge corresponds to a connecting route. The route is determined based on a selection of edges of the tree.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.