%0 Journal Article
%T Ellipse-based shortest path algorithm for typical urban road networks<br>典型城市路网中的椭圆最短路径算法
%A WANG Shi-ming
%A XING Jian-ping
%A ZHANG Yu-ting
%A BAI Bao-hua
%A <br>王世明
%A 邢建平
%A 张玉婷
%A 柏宝华
%J 系统工程理论与实践
%D 2011
%I 
%X An efficient and reliable optimal path algorithm within restricted searching area is proposed in this paper.Based on the common characteristics of typical urban road networks rather than the statistical information of a certain special city it can be used in different urban road networks.This algorithm searches for the shortest path in two kinds of different size ellipses for different Euclidean distances between the source station and the destination station.Compared to the ellipse restricted searching are...
%K Dijkstra algorithm
%K Euclidean distance
%K shortest path
%K restricted searching area
%K typical urban road networks<br>迪杰斯特拉算法
%K 欧式距离
%K 最短路径
%K 限制搜索区域
%K 典型城市路网
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=5704D2E38E2B920F5262BB79A7866ED9&yid=9377ED8094509821&vid=4AD960B5AD2D111A&iid=B31275AF3241DB2D&sid=E2D70FDCD65737D1&eid=4E85BC78FC25985C&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=12