K-pair single source point and single sink shortest path searching method based on common calculation and application

K-pair single source point and single sink shortest path searching method based on common calculation and application

The invention discloses a K-pair single source point and single sink shortest path searching method based on common calculation and application. The method comprises the steps that 1, an urban network is constructed according to real-time road condition information; 2, acquiring a target source sink...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: ZHOU RUNDONG, FAN YINCHAO, ZHAN XINGBIN, ZHA FEIFEI, DING JIANXUN, XU XIAOMING, SHAN YUNHAN, LONG JIANCHENG
Format: Patent
Sprache:chi ; eng
Schlagworte:
PHYSICS
SIGNALLING
TRAFFIC CONTROL SYSTEMS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator ZHOU RUNDONG
FAN YINCHAO
ZHAN XINGBIN
ZHA FEIFEI
DING JIANXUN
XU XIAOMING
SHAN YUNHAN
LONG JIANCHENG
description The invention discloses a K-pair single source point and single sink shortest path searching method based on common calculation and application. The method comprises the steps that 1, an urban network is constructed according to real-time road condition information; 2, acquiring a target source sink intersection pair set; 3, defining and initializing parameters; 4, performing forward search under the current source sink; and 5, judging whether the shortest path is found or not according to the element value in the B corresponding to the current search intersection, and updating the B. According to the method, the shortest path distance obtained by searching is stored through the two-dimensional array B, so that the waste of computing resources can be reduced, the path searching efficiency is improved, and support is provided for realizing faster navigation and the like. 本发明公开一种基于共用计算的K对单源点单汇点最短路搜索方法及应用，包括：1.由实时路况信息构建城市网络；2.获取目标源汇点交叉口对集合；3.参数定义及初始化；4.在当前源汇点下的向前搜索；5.根据当前搜索交叉口对应的B中的元素值，判断是否已经找到最短路径并进行B的更新。本发明考虑通
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN115394109A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN115394109A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN115394109A3</originalsourceid><addsrcrecordid>eNqNjD0KwkAQhdNYiHqH8QABQ7RIKUERBCv7MG5Gd3GzM-xM7m8Usbb63h9vXoznUjBk0JAekUB5zI5AOCQDTP0vD-kJ6jkbqYGgeVDC7PxUw0DmuYcbKvXACRwPwxsY3RjRwqTfVygSg_v4ZTG7Y1Rafbko1sfDtT2VJNyRCjpKZF17qapd3WyrTbOv_9m8AMV2RUI</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>K-pair single source point and single sink shortest path searching method based on common calculation and application</title><source>esp@cenet</source><creator>ZHOU RUNDONG ; FAN YINCHAO ; ZHAN XINGBIN ; ZHA FEIFEI ; DING JIANXUN ; XU XIAOMING ; SHAN YUNHAN ; LONG JIANCHENG</creator><creatorcontrib>ZHOU RUNDONG ; FAN YINCHAO ; ZHAN XINGBIN ; ZHA FEIFEI ; DING JIANXUN ; XU XIAOMING ; SHAN YUNHAN ; LONG JIANCHENG</creatorcontrib><description>The invention discloses a K-pair single source point and single sink shortest path searching method based on common calculation and application. The method comprises the steps that 1, an urban network is constructed according to real-time road condition information; 2, acquiring a target source sink intersection pair set; 3, defining and initializing parameters; 4, performing forward search under the current source sink; and 5, judging whether the shortest path is found or not according to the element value in the B corresponding to the current search intersection, and updating the B. According to the method, the shortest path distance obtained by searching is stored through the two-dimensional array B, so that the waste of computing resources can be reduced, the path searching efficiency is improved, and support is provided for realizing faster navigation and the like. 本发明公开一种基于共用计算的K对单源点单汇点最短路搜索方法及应用，包括：1.由实时路况信息构建城市网络；2.获取目标源汇点交叉口对集合；3.参数定义及初始化；4.在当前源汇点下的向前搜索；5.根据当前搜索交叉口对应的B中的元素值，判断是否已经找到最短路径并进行B的更新。本发明考虑通</description><language>chi ; eng</language><subject>PHYSICS ; SIGNALLING ; TRAFFIC CONTROL SYSTEMS</subject><creationdate>2022</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20221125&amp;DB=EPODOC&amp;CC=CN&amp;NR=115394109A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,778,883,25551,76302</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20221125&amp;DB=EPODOC&amp;CC=CN&amp;NR=115394109A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>ZHOU RUNDONG</creatorcontrib><creatorcontrib>FAN YINCHAO</creatorcontrib><creatorcontrib>ZHAN XINGBIN</creatorcontrib><creatorcontrib>ZHA FEIFEI</creatorcontrib><creatorcontrib>DING JIANXUN</creatorcontrib><creatorcontrib>XU XIAOMING</creatorcontrib><creatorcontrib>SHAN YUNHAN</creatorcontrib><creatorcontrib>LONG JIANCHENG</creatorcontrib><title>K-pair single source point and single sink shortest path searching method based on common calculation and application</title><description>The invention discloses a K-pair single source point and single sink shortest path searching method based on common calculation and application. The method comprises the steps that 1, an urban network is constructed according to real-time road condition information; 2, acquiring a target source sink intersection pair set; 3, defining and initializing parameters; 4, performing forward search under the current source sink; and 5, judging whether the shortest path is found or not according to the element value in the B corresponding to the current search intersection, and updating the B. According to the method, the shortest path distance obtained by searching is stored through the two-dimensional array B, so that the waste of computing resources can be reduced, the path searching efficiency is improved, and support is provided for realizing faster navigation and the like. 本发明公开一种基于共用计算的K对单源点单汇点最短路搜索方法及应用，包括：1.由实时路况信息构建城市网络；2.获取目标源汇点交叉口对集合；3.参数定义及初始化；4.在当前源汇点下的向前搜索；5.根据当前搜索交叉口对应的B中的元素值，判断是否已经找到最短路径并进行B的更新。本发明考虑通</description><subject>PHYSICS</subject><subject>SIGNALLING</subject><subject>TRAFFIC CONTROL SYSTEMS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNjD0KwkAQhdNYiHqH8QABQ7RIKUERBCv7MG5Gd3GzM-xM7m8Usbb63h9vXoznUjBk0JAekUB5zI5AOCQDTP0vD-kJ6jkbqYGgeVDC7PxUw0DmuYcbKvXACRwPwxsY3RjRwqTfVygSg_v4ZTG7Y1Rafbko1sfDtT2VJNyRCjpKZF17qapd3WyrTbOv_9m8AMV2RUI</recordid><startdate>20221125</startdate><enddate>20221125</enddate><creator>ZHOU RUNDONG</creator><creator>FAN YINCHAO</creator><creator>ZHAN XINGBIN</creator><creator>ZHA FEIFEI</creator><creator>DING JIANXUN</creator><creator>XU XIAOMING</creator><creator>SHAN YUNHAN</creator><creator>LONG JIANCHENG</creator><scope>EVB</scope></search><sort><creationdate>20221125</creationdate><title>K-pair single source point and single sink shortest path searching method based on common calculation and application</title><author>ZHOU RUNDONG ; FAN YINCHAO ; ZHAN XINGBIN ; ZHA FEIFEI ; DING JIANXUN ; XU XIAOMING ; SHAN YUNHAN ; LONG JIANCHENG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN115394109A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2022</creationdate><topic>PHYSICS</topic><topic>SIGNALLING</topic><topic>TRAFFIC CONTROL SYSTEMS</topic><toplevel>online_resources</toplevel><creatorcontrib>ZHOU RUNDONG</creatorcontrib><creatorcontrib>FAN YINCHAO</creatorcontrib><creatorcontrib>ZHAN XINGBIN</creatorcontrib><creatorcontrib>ZHA FEIFEI</creatorcontrib><creatorcontrib>DING JIANXUN</creatorcontrib><creatorcontrib>XU XIAOMING</creatorcontrib><creatorcontrib>SHAN YUNHAN</creatorcontrib><creatorcontrib>LONG JIANCHENG</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>ZHOU RUNDONG</au><au>FAN YINCHAO</au><au>ZHAN XINGBIN</au><au>ZHA FEIFEI</au><au>DING JIANXUN</au><au>XU XIAOMING</au><au>SHAN YUNHAN</au><au>LONG JIANCHENG</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>K-pair single source point and single sink shortest path searching method based on common calculation and application</title><date>2022-11-25</date><risdate>2022</risdate><abstract>The invention discloses a K-pair single source point and single sink shortest path searching method based on common calculation and application. The method comprises the steps that 1, an urban network is constructed according to real-time road condition information; 2, acquiring a target source sink intersection pair set; 3, defining and initializing parameters; 4, performing forward search under the current source sink; and 5, judging whether the shortest path is found or not according to the element value in the B corresponding to the current search intersection, and updating the B. According to the method, the shortest path distance obtained by searching is stored through the two-dimensional array B, so that the waste of computing resources can be reduced, the path searching efficiency is improved, and support is provided for realizing faster navigation and the like. 本发明公开一种基于共用计算的K对单源点单汇点最短路搜索方法及应用，包括：1.由实时路况信息构建城市网络；2.获取目标源汇点交叉口对集合；3.参数定义及初始化；4.在当前源汇点下的向前搜索；5.根据当前搜索交叉口对应的B中的元素值，判断是否已经找到最短路径并进行B的更新。本发明考虑通</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language chi ; eng
recordid cdi_epo_espacenet_CN115394109A
source esp@cenet
subjects PHYSICS
SIGNALLING
TRAFFIC CONTROL SYSTEMS
title K-pair single source point and single sink shortest path searching method based on common calculation and application
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T23%3A00%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=ZHOU%20RUNDONG&rft.date=2022-11-25&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN115394109A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true