Global path planning and cutting method and system based on lanelet framework
The invention provides a global path planning and cutting method and system based on a lanelet framework, and the method comprises the following steps: S1, converting a map into a map formed by splicing sections of lanelet based on the lanelet framework; s2, according to the defined starting point,...
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 | HE ZIJUN WU YUANQING LU YONGKANG XIA CANMING |
| description | The invention provides a global path planning and cutting method and system based on a lanelet framework, and the method comprises the following steps: S1, converting a map into a map formed by splicing sections of lanelet based on the lanelet framework; s2, according to the defined starting point, the defined ending point and the driving direction of the road, performing path search by using a Dijkstra algorithm to obtain a preliminary path; s3, randomly distributing a plurality of waypoints on the center line of the lanelet where the starting point and the ending point are located, wherein the first waypoint and the last waypoint of each section of lanelet are located at the boundary of the lanelet; s4, acquiring a path point closest to the starting point and the ending point; s5, according to the driving direction, deleting the path points behind the starting point and the path points in front of the ending point, and forming path planning of lanelet where the starting point and the ending point are locate |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN113063423A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN113063423A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN113063423A3</originalsourceid><addsrcrecordid>eNrjZPB1z8lPSsxRKEgsyVAoyEnMy8vMS1dIzEtRSC4tKQGxc1NLMvJTwELFlcUlqbkKSYnFqSkK-XkKQOWpOaklCmlFibmp5flF2TwMrGmJOcWpvFCam0HRzTXE2UM3tSA_PrW4IDE5NS-1JN7Zz9DQ2MDM2MTI2NGYGDUAuXs18A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Global path planning and cutting method and system based on lanelet framework</title><source>esp@cenet</source><creator>HE ZIJUN ; WU YUANQING ; LU YONGKANG ; XIA CANMING</creator><creatorcontrib>HE ZIJUN ; WU YUANQING ; LU YONGKANG ; XIA CANMING</creatorcontrib><description>The invention provides a global path planning and cutting method and system based on a lanelet framework, and the method comprises the following steps: S1, converting a map into a map formed by splicing sections of lanelet based on the lanelet framework; s2, according to the defined starting point, the defined ending point and the driving direction of the road, performing path search by using a Dijkstra algorithm to obtain a preliminary path; s3, randomly distributing a plurality of waypoints on the center line of the lanelet where the starting point and the ending point are located, wherein the first waypoint and the last waypoint of each section of lanelet are located at the boundary of the lanelet; s4, acquiring a path point closest to the starting point and the ending point; s5, according to the driving direction, deleting the path points behind the starting point and the path points in front of the ending point, and forming path planning of lanelet where the starting point and the ending point are locate</description><language>chi ; eng</language><subject>CONTROLLING ; GYROSCOPIC INSTRUMENTS ; MEASURING ; MEASURING DISTANCES, LEVELS OR BEARINGS ; NAVIGATION ; PHOTOGRAMMETRY OR VIDEOGRAMMETRY ; PHYSICS ; REGULATING ; SURVEYING ; SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES ; TESTING</subject><creationdate>2021</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=20210702&DB=EPODOC&CC=CN&NR=113063423A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20210702&DB=EPODOC&CC=CN&NR=113063423A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>HE ZIJUN</creatorcontrib><creatorcontrib>WU YUANQING</creatorcontrib><creatorcontrib>LU YONGKANG</creatorcontrib><creatorcontrib>XIA CANMING</creatorcontrib><title>Global path planning and cutting method and system based on lanelet framework</title><description>The invention provides a global path planning and cutting method and system based on a lanelet framework, and the method comprises the following steps: S1, converting a map into a map formed by splicing sections of lanelet based on the lanelet framework; s2, according to the defined starting point, the defined ending point and the driving direction of the road, performing path search by using a Dijkstra algorithm to obtain a preliminary path; s3, randomly distributing a plurality of waypoints on the center line of the lanelet where the starting point and the ending point are located, wherein the first waypoint and the last waypoint of each section of lanelet are located at the boundary of the lanelet; s4, acquiring a path point closest to the starting point and the ending point; s5, according to the driving direction, deleting the path points behind the starting point and the path points in front of the ending point, and forming path planning of lanelet where the starting point and the ending point are locate</description><subject>CONTROLLING</subject><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>REGULATING</subject><subject>SURVEYING</subject><subject>SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES</subject><subject>TESTING</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2021</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPB1z8lPSsxRKEgsyVAoyEnMy8vMS1dIzEtRSC4tKQGxc1NLMvJTwELFlcUlqbkKSYnFqSkK-XkKQOWpOaklCmlFibmp5flF2TwMrGmJOcWpvFCam0HRzTXE2UM3tSA_PrW4IDE5NS-1JN7Zz9DQ2MDM2MTI2NGYGDUAuXs18A</recordid><startdate>20210702</startdate><enddate>20210702</enddate><creator>HE ZIJUN</creator><creator>WU YUANQING</creator><creator>LU YONGKANG</creator><creator>XIA CANMING</creator><scope>EVB</scope></search><sort><creationdate>20210702</creationdate><title>Global path planning and cutting method and system based on lanelet framework</title><author>HE ZIJUN ; WU YUANQING ; LU YONGKANG ; XIA CANMING</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN113063423A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2021</creationdate><topic>CONTROLLING</topic><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>REGULATING</topic><topic>SURVEYING</topic><topic>SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES</topic><topic>TESTING</topic><toplevel>online_resources</toplevel><creatorcontrib>HE ZIJUN</creatorcontrib><creatorcontrib>WU YUANQING</creatorcontrib><creatorcontrib>LU YONGKANG</creatorcontrib><creatorcontrib>XIA CANMING</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>HE ZIJUN</au><au>WU YUANQING</au><au>LU YONGKANG</au><au>XIA CANMING</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Global path planning and cutting method and system based on lanelet framework</title><date>2021-07-02</date><risdate>2021</risdate><abstract>The invention provides a global path planning and cutting method and system based on a lanelet framework, and the method comprises the following steps: S1, converting a map into a map formed by splicing sections of lanelet based on the lanelet framework; s2, according to the defined starting point, the defined ending point and the driving direction of the road, performing path search by using a Dijkstra algorithm to obtain a preliminary path; s3, randomly distributing a plurality of waypoints on the center line of the lanelet where the starting point and the ending point are located, wherein the first waypoint and the last waypoint of each section of lanelet are located at the boundary of the lanelet; s4, acquiring a path point closest to the starting point and the ending point; s5, according to the driving direction, deleting the path points behind the starting point and the path points in front of the ending point, and forming path planning of lanelet where the starting point and the ending point are locate</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | chi ; eng |
| recordid | cdi_epo_espacenet_CN113063423A |
| source | esp@cenet |
| subjects | CONTROLLING GYROSCOPIC INSTRUMENTS MEASURING MEASURING DISTANCES, LEVELS OR BEARINGS NAVIGATION PHOTOGRAMMETRY OR VIDEOGRAMMETRY PHYSICS REGULATING SURVEYING SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES TESTING |
| title | Global path planning and cutting method and system based on lanelet framework |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T01%3A56%3A29IST&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=HE%20ZIJUN&rft.date=2021-07-02&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN113063423A%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 |