Scene detection view field generation and path planning method and application thereof
The invention discloses a scene detection view field generation and path planning method and application thereof, and the method comprises the steps: firstly providing a detection scene imaging constraint model, and guaranteeing that a detected object cannot be cut off; secondly, on the basis of an...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| 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 | SONG GUILING |
| description | The invention discloses a scene detection view field generation and path planning method and application thereof, and the method comprises the steps: firstly providing a detection scene imaging constraint model, and guaranteeing that a detected object cannot be cut off; secondly, on the basis of an improved iterative self-organizing clustering algorithm, automatic optimal distribution of view field distribution is achieved, and a Hamilton path is formed; and finally, a solution of the shortest Hamilton path problem is given through the proposed VTSP + heuristic algorithm and the ML4CO algorithm of the VTSP + Transformer. Experiments prove that compared with a dynamic selection binary state compression DP method and a local shortest path planning algorithm, the method disclosed by the invention can support large-scale path nodes in the aspect of node quantity, and makes up for the defects of similar algorithms; compared with a classical traveling salesman baseline solving method LKH, the method has the advanta |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN116861796A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN116861796A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN116861796A3</originalsourceid><addsrcrecordid>eNrjZAgLTk7NS1VISS1JTS7JzM9TKMtMLVdIy0zNSVFIB8oUJYJFE_NSFAoSSzIUCnIS8_Iy89IVclNLMvJTwBKJBQU5mckQhSUZqUWp-Wk8DKxpiTnFqbxQmptB0c01xNlDN7UgPz61uCARZGtJvLOfoaGZhZmhuaWZozExagAglDm7</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Scene detection view field generation and path planning method and application thereof</title><source>esp@cenet</source><creator>SONG GUILING</creator><creatorcontrib>SONG GUILING</creatorcontrib><description>The invention discloses a scene detection view field generation and path planning method and application thereof, and the method comprises the steps: firstly providing a detection scene imaging constraint model, and guaranteeing that a detected object cannot be cut off; secondly, on the basis of an improved iterative self-organizing clustering algorithm, automatic optimal distribution of view field distribution is achieved, and a Hamilton path is formed; and finally, a solution of the shortest Hamilton path problem is given through the proposed VTSP + heuristic algorithm and the ML4CO algorithm of the VTSP + Transformer. Experiments prove that compared with a dynamic selection binary state compression DP method and a local shortest path planning algorithm, the method disclosed by the invention can support large-scale path nodes in the aspect of node quantity, and makes up for the defects of similar algorithms; compared with a classical traveling salesman baseline solving method LKH, the method has the advanta</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2023</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=20231010&DB=EPODOC&CC=CN&NR=116861796A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76418</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20231010&DB=EPODOC&CC=CN&NR=116861796A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>SONG GUILING</creatorcontrib><title>Scene detection view field generation and path planning method and application thereof</title><description>The invention discloses a scene detection view field generation and path planning method and application thereof, and the method comprises the steps: firstly providing a detection scene imaging constraint model, and guaranteeing that a detected object cannot be cut off; secondly, on the basis of an improved iterative self-organizing clustering algorithm, automatic optimal distribution of view field distribution is achieved, and a Hamilton path is formed; and finally, a solution of the shortest Hamilton path problem is given through the proposed VTSP + heuristic algorithm and the ML4CO algorithm of the VTSP + Transformer. Experiments prove that compared with a dynamic selection binary state compression DP method and a local shortest path planning algorithm, the method disclosed by the invention can support large-scale path nodes in the aspect of node quantity, and makes up for the defects of similar algorithms; compared with a classical traveling salesman baseline solving method LKH, the method has the advanta</description><subject>CALCULATING</subject><subject>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZAgLTk7NS1VISS1JTS7JzM9TKMtMLVdIy0zNSVFIB8oUJYJFE_NSFAoSSzIUCnIS8_Iy89IVclNLMvJTwBKJBQU5mckQhSUZqUWp-Wk8DKxpiTnFqbxQmptB0c01xNlDN7UgPz61uCARZGtJvLOfoaGZhZmhuaWZozExagAglDm7</recordid><startdate>20231010</startdate><enddate>20231010</enddate><creator>SONG GUILING</creator><scope>EVB</scope></search><sort><creationdate>20231010</creationdate><title>Scene detection view field generation and path planning method and application thereof</title><author>SONG GUILING</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN116861796A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2023</creationdate><topic>CALCULATING</topic><topic>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>SONG GUILING</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>SONG GUILING</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Scene detection view field generation and path planning method and application thereof</title><date>2023-10-10</date><risdate>2023</risdate><abstract>The invention discloses a scene detection view field generation and path planning method and application thereof, and the method comprises the steps: firstly providing a detection scene imaging constraint model, and guaranteeing that a detected object cannot be cut off; secondly, on the basis of an improved iterative self-organizing clustering algorithm, automatic optimal distribution of view field distribution is achieved, and a Hamilton path is formed; and finally, a solution of the shortest Hamilton path problem is given through the proposed VTSP + heuristic algorithm and the ML4CO algorithm of the VTSP + Transformer. Experiments prove that compared with a dynamic selection binary state compression DP method and a local shortest path planning algorithm, the method disclosed by the invention can support large-scale path nodes in the aspect of node quantity, and makes up for the defects of similar algorithms; compared with a classical traveling salesman baseline solving method LKH, the method has the advanta</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | chi ; eng |
| recordid | cdi_epo_espacenet_CN116861796A |
| source | esp@cenet |
| subjects | CALCULATING COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | Scene detection view field generation and path planning method and application thereof |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T23%3A11%3A43IST&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=SONG%20GUILING&rft.date=2023-10-10&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN116861796A%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 |