Local obstacle avoidance path planning method based on two-dimensional obstacle map processing
The invention provides a local obstacle avoidance path planning method based on two-dimensional obstacle map processing, and the method comprises the steps: designing a distance field calculation formula based on the geometric distance between a robot and an obstacle region, building a distance fiel...
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 | LI ZHI WU GUANG YUAN MENGQI LAN XUKE WU JIAHAO KIM YOUNG-HEE |
| description | The invention provides a local obstacle avoidance path planning method based on two-dimensional obstacle map processing, and the method comprises the steps: designing a distance field calculation formula based on the geometric distance between a robot and an obstacle region, building a distance field cost map, enabling a pixel position in the distance field cost map to represent the cost value of a distance field, and enabling the closer to an obstacle, the higher the cost value. If the accumulated sum of the distance field cost values of the pixel positions corresponding to the nodes in the path is low, it is indicated that the whole path is far away from the obstacle. And an RRT * method with rapidity and geometric distance optimization capability is applied, a path with the optimal cost in the current searching times is found through multiple times of searching, the characteristics of the path searching method are reserved, and a relatively safe distance is further kept between the whole path and the obsta |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN118483991A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN118483991A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN118483991A3</originalsourceid><addsrcrecordid>eNqNjDEOwjAMALswIOAP5gEdojK0I6qKGBATM5WbGBopsS0cwfdhYGBkuuXultX1JB4TyGQFfSLAp8SA7AkUywyakDnyHTKVWQJMaBRAGMpL6hAzsUXh30FGBX2IJ7NPt64WN0xGmy9X1fYwXPpjTSojmaInpjL2Z-faXdt0nds3_zhvTgc84g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Local obstacle avoidance path planning method based on two-dimensional obstacle map processing</title><source>esp@cenet</source><creator>LI ZHI ; WU GUANG ; YUAN MENGQI ; LAN XUKE ; WU JIAHAO ; KIM YOUNG-HEE</creator><creatorcontrib>LI ZHI ; WU GUANG ; YUAN MENGQI ; LAN XUKE ; WU JIAHAO ; KIM YOUNG-HEE</creatorcontrib><description>The invention provides a local obstacle avoidance path planning method based on two-dimensional obstacle map processing, and the method comprises the steps: designing a distance field calculation formula based on the geometric distance between a robot and an obstacle region, building a distance field cost map, enabling a pixel position in the distance field cost map to represent the cost value of a distance field, and enabling the closer to an obstacle, the higher the cost value. If the accumulated sum of the distance field cost values of the pixel positions corresponding to the nodes in the path is low, it is indicated that the whole path is far away from the obstacle. And an RRT * method with rapidity and geometric distance optimization capability is applied, a path with the optimal cost in the current searching times is found through multiple times of searching, the characteristics of the path searching method are reserved, and a relatively safe distance is further kept between the whole path and the obsta</description><language>chi ; eng</language><subject>CONTROLLING ; PHYSICS ; REGULATING ; SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES</subject><creationdate>2024</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=20240813&DB=EPODOC&CC=CN&NR=118483991A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25543,76293</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20240813&DB=EPODOC&CC=CN&NR=118483991A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LI ZHI</creatorcontrib><creatorcontrib>WU GUANG</creatorcontrib><creatorcontrib>YUAN MENGQI</creatorcontrib><creatorcontrib>LAN XUKE</creatorcontrib><creatorcontrib>WU JIAHAO</creatorcontrib><creatorcontrib>KIM YOUNG-HEE</creatorcontrib><title>Local obstacle avoidance path planning method based on two-dimensional obstacle map processing</title><description>The invention provides a local obstacle avoidance path planning method based on two-dimensional obstacle map processing, and the method comprises the steps: designing a distance field calculation formula based on the geometric distance between a robot and an obstacle region, building a distance field cost map, enabling a pixel position in the distance field cost map to represent the cost value of a distance field, and enabling the closer to an obstacle, the higher the cost value. If the accumulated sum of the distance field cost values of the pixel positions corresponding to the nodes in the path is low, it is indicated that the whole path is far away from the obstacle. And an RRT * method with rapidity and geometric distance optimization capability is applied, a path with the optimal cost in the current searching times is found through multiple times of searching, the characteristics of the path searching method are reserved, and a relatively safe distance is further kept between the whole path and the obsta</description><subject>CONTROLLING</subject><subject>PHYSICS</subject><subject>REGULATING</subject><subject>SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2024</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNjDEOwjAMALswIOAP5gEdojK0I6qKGBATM5WbGBopsS0cwfdhYGBkuuXultX1JB4TyGQFfSLAp8SA7AkUywyakDnyHTKVWQJMaBRAGMpL6hAzsUXh30FGBX2IJ7NPt64WN0xGmy9X1fYwXPpjTSojmaInpjL2Z-faXdt0nds3_zhvTgc84g</recordid><startdate>20240813</startdate><enddate>20240813</enddate><creator>LI ZHI</creator><creator>WU GUANG</creator><creator>YUAN MENGQI</creator><creator>LAN XUKE</creator><creator>WU JIAHAO</creator><creator>KIM YOUNG-HEE</creator><scope>EVB</scope></search><sort><creationdate>20240813</creationdate><title>Local obstacle avoidance path planning method based on two-dimensional obstacle map processing</title><author>LI ZHI ; WU GUANG ; YUAN MENGQI ; LAN XUKE ; WU JIAHAO ; KIM YOUNG-HEE</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN118483991A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2024</creationdate><topic>CONTROLLING</topic><topic>PHYSICS</topic><topic>REGULATING</topic><topic>SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES</topic><toplevel>online_resources</toplevel><creatorcontrib>LI ZHI</creatorcontrib><creatorcontrib>WU GUANG</creatorcontrib><creatorcontrib>YUAN MENGQI</creatorcontrib><creatorcontrib>LAN XUKE</creatorcontrib><creatorcontrib>WU JIAHAO</creatorcontrib><creatorcontrib>KIM YOUNG-HEE</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LI ZHI</au><au>WU GUANG</au><au>YUAN MENGQI</au><au>LAN XUKE</au><au>WU JIAHAO</au><au>KIM YOUNG-HEE</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Local obstacle avoidance path planning method based on two-dimensional obstacle map processing</title><date>2024-08-13</date><risdate>2024</risdate><abstract>The invention provides a local obstacle avoidance path planning method based on two-dimensional obstacle map processing, and the method comprises the steps: designing a distance field calculation formula based on the geometric distance between a robot and an obstacle region, building a distance field cost map, enabling a pixel position in the distance field cost map to represent the cost value of a distance field, and enabling the closer to an obstacle, the higher the cost value. If the accumulated sum of the distance field cost values of the pixel positions corresponding to the nodes in the path is low, it is indicated that the whole path is far away from the obstacle. And an RRT * method with rapidity and geometric distance optimization capability is applied, a path with the optimal cost in the current searching times is found through multiple times of searching, the characteristics of the path searching method are reserved, and a relatively safe distance is further kept between the whole path and the obsta</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | chi ; eng |
| recordid | cdi_epo_espacenet_CN118483991A |
| source | esp@cenet |
| subjects | CONTROLLING PHYSICS REGULATING SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES |
| title | Local obstacle avoidance path planning method based on two-dimensional obstacle map processing |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T03%3A10%3A26IST&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=LI%20ZHI&rft.date=2024-08-13&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN118483991A%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 |