G - Physics – 01 – C
Patent
G - Physics
01
C
G01C 21/34 (2006.01)
Patent
CA 2472950
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.
Le réseau comportant une pluralité de noeuds reliés deux à deux par des segments, on attribue un coût à chaque segment du réseau, on développe deux graphes de chemins, sensiblement à partir des deux points, respectivement, on interrompt le développement des deux graphes lorsqu'ils comprennent au moins un premier noeud commun d'interférence, on détermine les deux chemins de coût minimal, appartenant respectivement aux deux graphes, et on relie les deux chemins de coût minimal afin d'obtenir le chemin de coût minimal entre les deux points. L'invention concerne également un serveur pour la mise en oeuvre du procédé.
Ridout & Maybee Llp
Webraska Mobile Technologies
LandOfFree
Method and device for determining the minimal cost path... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and device for determining the minimal cost path..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and device for determining the minimal cost path... will most certainly appreciate the feedback.
Profile ID: LFCA-PAI-O-1548440