Path planning method and system
The invention discloses a path planning method and system. The method comprises the following steps: preprocessing the positions of grid points of collapse jump points in a uniform grid map; acquiringstarting point and ending point positions; when an optimal composite main sequence path needs to be...
Gespeichert in:
Hauptverfasser: | , , , , , , , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
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 | YANG MEI QIN LONG WANG PENG YIN QUANJUN JIAO PENG ZENG YUNXIU XIE XU HU YUE PENG YONG |
description | The invention discloses a path planning method and system. The method comprises the following steps: preprocessing the positions of grid points of collapse jump points in a uniform grid map; acquiringstarting point and ending point positions; when an optimal composite main sequence path needs to be searched between a starting point and an end point, searching the optimal path by adopting contact-search, and pruning when a starting child node is generated in a connection process and/or when a jump point is expanded in a search process; by combining the pruning process with the optimal prioritysearch of the A * algorithm, constructing and storing the optimal path between the starting point and the terminal point. The problems of information loss, speed limitation and the like in the priorart are solved, and the search speed is increased.
本发明公开一种路径规划方法及系统,该方法包括以均匀网格地图中塌缩跳点的网格点所在位置进行预处理;获取起点和终点位置;在起点与终点之间需要寻找最优复合主序路径时,采用connect-search搜索最优路径,在连接过程生成起始子节点时和/或在搜索过程扩展跳点时进行剪枝;经过将上述剪枝过程与A*算法的最佳优先搜索结合,构建起点与终点之间的最优路径并存储。 |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN110967015A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN110967015A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN110967015A3</originalsourceid><addsrcrecordid>eNrjZJAPSCzJUCjISczLy8xLV8hNLcnIT1FIzEtRKK4sLknN5WFgTUvMKU7lhdLcDIpuriHOHrqpBfnxqcUFicmpeakl8c5-hoYGlmbmBoamjsbEqAEAGHkkvw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Path planning method and system</title><source>esp@cenet</source><creator>YANG MEI ; QIN LONG ; WANG PENG ; YIN QUANJUN ; JIAO PENG ; ZENG YUNXIU ; XIE XU ; HU YUE ; PENG YONG</creator><creatorcontrib>YANG MEI ; QIN LONG ; WANG PENG ; YIN QUANJUN ; JIAO PENG ; ZENG YUNXIU ; XIE XU ; HU YUE ; PENG YONG</creatorcontrib><description>The invention discloses a path planning method and system. The method comprises the following steps: preprocessing the positions of grid points of collapse jump points in a uniform grid map; acquiringstarting point and ending point positions; when an optimal composite main sequence path needs to be searched between a starting point and an end point, searching the optimal path by adopting contact-search, and pruning when a starting child node is generated in a connection process and/or when a jump point is expanded in a search process; by combining the pruning process with the optimal prioritysearch of the A * algorithm, constructing and storing the optimal path between the starting point and the terminal point. The problems of information loss, speed limitation and the like in the priorart are solved, and the search speed is increased.
本发明公开一种路径规划方法及系统,该方法包括以均匀网格地图中塌缩跳点的网格点所在位置进行预处理;获取起点和终点位置;在起点与终点之间需要寻找最优复合主序路径时,采用connect-search搜索最优路径,在连接过程生成起始子节点时和/或在搜索过程扩展跳点时进行剪枝;经过将上述剪枝过程与A*算法的最佳优先搜索结合,构建起点与终点之间的最优路径并存储。</description><language>chi ; eng</language><subject>GYROSCOPIC INSTRUMENTS ; MEASURING ; MEASURING DISTANCES, LEVELS OR BEARINGS ; NAVIGATION ; PHOTOGRAMMETRY OR VIDEOGRAMMETRY ; PHYSICS ; SURVEYING ; TESTING</subject><creationdate>2020</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&date=20200407&DB=EPODOC&CC=CN&NR=110967015A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25543,76294</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20200407&DB=EPODOC&CC=CN&NR=110967015A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>YANG MEI</creatorcontrib><creatorcontrib>QIN LONG</creatorcontrib><creatorcontrib>WANG PENG</creatorcontrib><creatorcontrib>YIN QUANJUN</creatorcontrib><creatorcontrib>JIAO PENG</creatorcontrib><creatorcontrib>ZENG YUNXIU</creatorcontrib><creatorcontrib>XIE XU</creatorcontrib><creatorcontrib>HU YUE</creatorcontrib><creatorcontrib>PENG YONG</creatorcontrib><title>Path planning method and system</title><description>The invention discloses a path planning method and system. The method comprises the following steps: preprocessing the positions of grid points of collapse jump points in a uniform grid map; acquiringstarting point and ending point positions; when an optimal composite main sequence path needs to be searched between a starting point and an end point, searching the optimal path by adopting contact-search, and pruning when a starting child node is generated in a connection process and/or when a jump point is expanded in a search process; by combining the pruning process with the optimal prioritysearch of the A * algorithm, constructing and storing the optimal path between the starting point and the terminal point. The problems of information loss, speed limitation and the like in the priorart are solved, and the search speed is increased.
本发明公开一种路径规划方法及系统,该方法包括以均匀网格地图中塌缩跳点的网格点所在位置进行预处理;获取起点和终点位置;在起点与终点之间需要寻找最优复合主序路径时,采用connect-search搜索最优路径,在连接过程生成起始子节点时和/或在搜索过程扩展跳点时进行剪枝;经过将上述剪枝过程与A*算法的最佳优先搜索结合,构建起点与终点之间的最优路径并存储。</description><subject>GYROSCOPIC INSTRUMENTS</subject><subject>MEASURING</subject><subject>MEASURING DISTANCES, LEVELS OR BEARINGS</subject><subject>NAVIGATION</subject><subject>PHOTOGRAMMETRY OR VIDEOGRAMMETRY</subject><subject>PHYSICS</subject><subject>SURVEYING</subject><subject>TESTING</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2020</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZJAPSCzJUCjISczLy8xLV8hNLcnIT1FIzEtRKK4sLknN5WFgTUvMKU7lhdLcDIpuriHOHrqpBfnxqcUFicmpeakl8c5-hoYGlmbmBoamjsbEqAEAGHkkvw</recordid><startdate>20200407</startdate><enddate>20200407</enddate><creator>YANG MEI</creator><creator>QIN LONG</creator><creator>WANG PENG</creator><creator>YIN QUANJUN</creator><creator>JIAO PENG</creator><creator>ZENG YUNXIU</creator><creator>XIE XU</creator><creator>HU YUE</creator><creator>PENG YONG</creator><scope>EVB</scope></search><sort><creationdate>20200407</creationdate><title>Path planning method and system</title><author>YANG MEI ; QIN LONG ; WANG PENG ; YIN QUANJUN ; JIAO PENG ; ZENG YUNXIU ; XIE XU ; HU YUE ; PENG YONG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN110967015A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2020</creationdate><topic>GYROSCOPIC INSTRUMENTS</topic><topic>MEASURING</topic><topic>MEASURING DISTANCES, LEVELS OR BEARINGS</topic><topic>NAVIGATION</topic><topic>PHOTOGRAMMETRY OR VIDEOGRAMMETRY</topic><topic>PHYSICS</topic><topic>SURVEYING</topic><topic>TESTING</topic><toplevel>online_resources</toplevel><creatorcontrib>YANG MEI</creatorcontrib><creatorcontrib>QIN LONG</creatorcontrib><creatorcontrib>WANG PENG</creatorcontrib><creatorcontrib>YIN QUANJUN</creatorcontrib><creatorcontrib>JIAO PENG</creatorcontrib><creatorcontrib>ZENG YUNXIU</creatorcontrib><creatorcontrib>XIE XU</creatorcontrib><creatorcontrib>HU YUE</creatorcontrib><creatorcontrib>PENG YONG</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>YANG MEI</au><au>QIN LONG</au><au>WANG PENG</au><au>YIN QUANJUN</au><au>JIAO PENG</au><au>ZENG YUNXIU</au><au>XIE XU</au><au>HU YUE</au><au>PENG YONG</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Path planning method and system</title><date>2020-04-07</date><risdate>2020</risdate><abstract>The invention discloses a path planning method and system. The method comprises the following steps: preprocessing the positions of grid points of collapse jump points in a uniform grid map; acquiringstarting point and ending point positions; when an optimal composite main sequence path needs to be searched between a starting point and an end point, searching the optimal path by adopting contact-search, and pruning when a starting child node is generated in a connection process and/or when a jump point is expanded in a search process; by combining the pruning process with the optimal prioritysearch of the A * algorithm, constructing and storing the optimal path between the starting point and the terminal point. The problems of information loss, speed limitation and the like in the priorart are solved, and the search speed is increased.
本发明公开一种路径规划方法及系统,该方法包括以均匀网格地图中塌缩跳点的网格点所在位置进行预处理;获取起点和终点位置;在起点与终点之间需要寻找最优复合主序路径时,采用connect-search搜索最优路径,在连接过程生成起始子节点时和/或在搜索过程扩展跳点时进行剪枝;经过将上述剪枝过程与A*算法的最佳优先搜索结合,构建起点与终点之间的最优路径并存储。</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | chi ; eng |
recordid | cdi_epo_espacenet_CN110967015A |
source | esp@cenet |
subjects | GYROSCOPIC INSTRUMENTS MEASURING MEASURING DISTANCES, LEVELS OR BEARINGS NAVIGATION PHOTOGRAMMETRY OR VIDEOGRAMMETRY PHYSICS SURVEYING TESTING |
title | Path planning method and system |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T12%3A04%3A12IST&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=YANG%20MEI&rft.date=2020-04-07&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN110967015A%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 |