发明名称 |
Method and device for determining the minimal cost path between two points in a road network |
摘要 |
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.
|
申请公布号 |
US7437239(B2) |
申请公布日期 |
2008.10.14 |
申请号 |
US20050500991 |
申请日期 |
2005.01.13 |
申请人 |
WEBRASKA MOBILE TECHNOLOGIES |
发明人 |
SERRE JULIEN |
分类号 |
G01C21/00;G01C21/32;G01C21/34 |
主分类号 |
G01C21/00 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|