Method and device for processing multi-task running path conflict, equipment and medium
The invention relates to a method and device for processing multi-task running path conflicts, equipment and a medium. The method comprises the following steps: calculating an optimal path of each task during independent operation as an initial optimal path, and recording an initial income correspon...
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 | LIU ZHIHUI WANG ZIQI SUN XIA XU JINGYI TONG CHENGDONG |
| description | The invention relates to a method and device for processing multi-task running path conflicts, equipment and a medium. The method comprises the following steps: calculating an optimal path of each task during independent operation as an initial optimal path, and recording an initial income corresponding to the initial path; constructing a priority queue which is initially empty, putting all tasks into the priority queue, and sorting the tasks according to the initial path earnings; the cost of the initial optimal scheme is set to be positive infinity, tasks are dequeued from the priority queue according to the priority from high to low, and conflict points in task paths are processed; when all the conflict points in the priority queue are processed, calculating the cost of the dynamic scheme; and comparing the cost of the dynamic scheme with the cost of the current optimal scheme, and selecting the scheme with the lower cost as the optimal scheme. By the adoption of the method, when paths are planned for mult |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN116542412A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN116542412A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN116542412A3</originalsourceid><addsrcrecordid>eNqNjDEKAjEQANNYiPqHtfeKnKe9HIqNVoLlEZLNXTDZxGTj-0XxAVYDwzBzcb8gT9GAIgMGX04j2Jgh5aixFEcjhOrZNazKA3Il-qikeAIdyXqneQP4rC4FJP5eAhpXw1LMrPIFVz8uxPp0vPXnBlMcsCSlkZCH_irlfte1nWwP23-aN1Z1Od0</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method and device for processing multi-task running path conflict, equipment and medium</title><source>esp@cenet</source><creator>LIU ZHIHUI ; WANG ZIQI ; SUN XIA ; XU JINGYI ; TONG CHENGDONG</creator><creatorcontrib>LIU ZHIHUI ; WANG ZIQI ; SUN XIA ; XU JINGYI ; TONG CHENGDONG</creatorcontrib><description>The invention relates to a method and device for processing multi-task running path conflicts, equipment and a medium. The method comprises the following steps: calculating an optimal path of each task during independent operation as an initial optimal path, and recording an initial income corresponding to the initial path; constructing a priority queue which is initially empty, putting all tasks into the priority queue, and sorting the tasks according to the initial path earnings; the cost of the initial optimal scheme is set to be positive infinity, tasks are dequeued from the priority queue according to the priority from high to low, and conflict points in task paths are processed; when all the conflict points in the priority queue are processed, calculating the cost of the dynamic scheme; and comparing the cost of the dynamic scheme with the cost of the current optimal scheme, and selecting the scheme with the lower cost as the optimal scheme. By the adoption of the method, when paths are planned for mult</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; PHYSICS ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</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=20230804&DB=EPODOC&CC=CN&NR=116542412A$$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=20230804&DB=EPODOC&CC=CN&NR=116542412A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LIU ZHIHUI</creatorcontrib><creatorcontrib>WANG ZIQI</creatorcontrib><creatorcontrib>SUN XIA</creatorcontrib><creatorcontrib>XU JINGYI</creatorcontrib><creatorcontrib>TONG CHENGDONG</creatorcontrib><title>Method and device for processing multi-task running path conflict, equipment and medium</title><description>The invention relates to a method and device for processing multi-task running path conflicts, equipment and a medium. The method comprises the following steps: calculating an optimal path of each task during independent operation as an initial optimal path, and recording an initial income corresponding to the initial path; constructing a priority queue which is initially empty, putting all tasks into the priority queue, and sorting the tasks according to the initial path earnings; the cost of the initial optimal scheme is set to be positive infinity, tasks are dequeued from the priority queue according to the priority from high to low, and conflict points in task paths are processed; when all the conflict points in the priority queue are processed, calculating the cost of the dynamic scheme; and comparing the cost of the dynamic scheme with the cost of the current optimal scheme, and selecting the scheme with the lower cost as the optimal scheme. By the adoption of the method, when paths are planned for mult</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>PHYSICS</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNjDEKAjEQANNYiPqHtfeKnKe9HIqNVoLlEZLNXTDZxGTj-0XxAVYDwzBzcb8gT9GAIgMGX04j2Jgh5aixFEcjhOrZNazKA3Il-qikeAIdyXqneQP4rC4FJP5eAhpXw1LMrPIFVz8uxPp0vPXnBlMcsCSlkZCH_irlfte1nWwP23-aN1Z1Od0</recordid><startdate>20230804</startdate><enddate>20230804</enddate><creator>LIU ZHIHUI</creator><creator>WANG ZIQI</creator><creator>SUN XIA</creator><creator>XU JINGYI</creator><creator>TONG CHENGDONG</creator><scope>EVB</scope></search><sort><creationdate>20230804</creationdate><title>Method and device for processing multi-task running path conflict, equipment and medium</title><author>LIU ZHIHUI ; WANG ZIQI ; SUN XIA ; XU JINGYI ; TONG CHENGDONG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN116542412A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2023</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>PHYSICS</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><toplevel>online_resources</toplevel><creatorcontrib>LIU ZHIHUI</creatorcontrib><creatorcontrib>WANG ZIQI</creatorcontrib><creatorcontrib>SUN XIA</creatorcontrib><creatorcontrib>XU JINGYI</creatorcontrib><creatorcontrib>TONG CHENGDONG</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LIU ZHIHUI</au><au>WANG ZIQI</au><au>SUN XIA</au><au>XU JINGYI</au><au>TONG CHENGDONG</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method and device for processing multi-task running path conflict, equipment and medium</title><date>2023-08-04</date><risdate>2023</risdate><abstract>The invention relates to a method and device for processing multi-task running path conflicts, equipment and a medium. The method comprises the following steps: calculating an optimal path of each task during independent operation as an initial optimal path, and recording an initial income corresponding to the initial path; constructing a priority queue which is initially empty, putting all tasks into the priority queue, and sorting the tasks according to the initial path earnings; the cost of the initial optimal scheme is set to be positive infinity, tasks are dequeued from the priority queue according to the priority from high to low, and conflict points in task paths are processed; when all the conflict points in the priority queue are processed, calculating the cost of the dynamic scheme; and comparing the cost of the dynamic scheme with the cost of the current optimal scheme, and selecting the scheme with the lower cost as the optimal scheme. By the adoption of the method, when paths are planned for mult</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | chi ; eng |
| recordid | cdi_epo_espacenet_CN116542412A |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES PHYSICS SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR |
| title | Method and device for processing multi-task running path conflict, equipment and medium |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T21%3A12%3A06IST&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=LIU%20ZHIHUI&rft.date=2023-08-04&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN116542412A%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 |