EP 1463921 A1 20041006 - METHOD AND DEVICE FOR DETERMINING THE MINIMAL COST PATH BETWEEN TWO POINTS IN A ROAD NETWORK
Title (en)
METHOD AND DEVICE FOR DETERMINING THE MINIMAL COST PATH BETWEEN TWO POINTS IN A ROAD NETWORK
Title (de)
KOSTENMINIMIERENDES PFADSUCHVERFAHREN FÜR EIN STRASSENNETZ UND ZUGEHÖRIGE VORRICHTUNG
Title (fr)
PROCEDE ET DISPOSITIF POUR DETERMINER LE CHEMIN DE COUT MINIMAL ENTRE DEUX POINTS DANS UN RESEAU ROUTIER
Publication
Application
Priority
FR 0200061 W 20020109
Abstract (en)
[origin: WO03058170A1] The invention relates to a network comprising numerous nodes which are paired by means of segments. The inventive method consists in: allocating a cost to each segment in the network; producing two path graphs, essentially from two points respectively; interrupting the production of the two graphs when they comprise at least a first common interference node; determining the two minimal cost paths which belong respectively to the two graphs; and linking the two minimal cost paths in order to obtain the minimal cost path between the two points. The invention also relates to a server which is used to implement said method.
IPC 1-7
IPC 8 full level
G01C 21/34 (2006.01)
CPC (source: EP US)
G01C 21/3446 (2013.01 - EP US)
Citation (search report)
See references of WO 03058170A1
Designated contracting state (EPC)
AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR
DOCDB simple family (publication)
WO 03058170 A1 20030717; AU 2002231861 A1 20030724; AU 2002231861 B2 20080515; CA 2472950 A1 20030717; EP 1463921 A1 20041006; US 2005119825 A1 20050602; US 7437239 B2 20081014
DOCDB simple family (application)
FR 0200061 W 20020109; AU 2002231861 A 20020109; CA 2472950 A 20020109; EP 02711926 A 20020109; US 50099105 A 20050113