Processing path planning method based on random pheromone optimization elite colony algorithm
The invention is suitable for the technical field of processing, and particularly relates to a processing path planning method based on a random pheromone optimization elite ant colony algorithm. The method comprises the following steps of S1, inputting data, setting parameters and calculating the d...
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 | LUO LIANGCHUAN LIAO FEI DENG ZHIWEN LI PING FANG SHENGKUN CHEN QIYU |
| description | The invention is suitable for the technical field of processing, and particularly relates to a processing path planning method based on a random pheromone optimization elite ant colony algorithm. The method comprises the following steps of S1, inputting data, setting parameters and calculating the distance between points; S2, using an optimization algorithm to set an ant colony head coordinate; S3, updating a list to be accessed and a taboo list, calculating the transition probability and determining the path of each ant; S4, updating the pheromones; S5, judging whether the number of iterations is completed or not, if yes, outputting an optimal path, and generating a processing file; and if not, returning to the step S2. According to the method, the algorithms, such as ant colony first coordinates, pheromones, etc., are optimized, the local optimum is avoided, the optimal processing path can be efficiently iterated, and the production efficiency is greatly improved.
本发明适用于加工技术领域，尤其涉及一种基于随机信息素优化精英蚁群算法的加工路径规划方法 |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN113703391A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN113703391A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN113703391A3</originalsourceid><addsrcrecordid>eNqNijEKAjEQAK-xEPUP6wMEQwqxlOPESixs5ViT9RJIdkOyjb5eBR9gNQwz8-52qeKotcgTFNQAJSHz1zJpEA93bORBGCqylwwlUJUsTCBFY44v1PiplKISOEnCT8A0SY0a8rKbPTA1Wv246NbH4dqfNlRkpFbQEZOO_dkYu9tauzcH-8_zBlkuPP0</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Processing path planning method based on random pheromone optimization elite colony algorithm</title><source>esp@cenet</source><creator>LUO LIANGCHUAN ; LIAO FEI ; DENG ZHIWEN ; LI PING ; FANG SHENGKUN ; CHEN QIYU</creator><creatorcontrib>LUO LIANGCHUAN ; LIAO FEI ; DENG ZHIWEN ; LI PING ; FANG SHENGKUN ; CHEN QIYU</creatorcontrib><description>The invention is suitable for the technical field of processing, and particularly relates to a processing path planning method based on a random pheromone optimization elite ant colony algorithm. The method comprises the following steps of S1, inputting data, setting parameters and calculating the distance between points; S2, using an optimization algorithm to set an ant colony head coordinate; S3, updating a list to be accessed and a taboo list, calculating the transition probability and determining the path of each ant; S4, updating the pheromones; S5, judging whether the number of iterations is completed or not, if yes, outputting an optimal path, and generating a processing file; and if not, returning to the step S2. According to the method, the algorithms, such as ant colony first coordinates, pheromones, etc., are optimized, the local optimum is avoided, the optimal processing path can be efficiently iterated, and the production efficiency is greatly improved.
本发明适用于加工技术领域，尤其涉及一种基于随机信息素优化精英蚁群算法的加工路径规划方法</description><language>chi ; eng</language><subject>CONTROL OR REGULATING SYSTEMS IN GENERAL ; CONTROLLING ; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS ; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS ORELEMENTS ; PHYSICS ; REGULATING</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=20211126&DB=EPODOC&CC=CN&NR=113703391A$$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=20211126&DB=EPODOC&CC=CN&NR=113703391A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LUO LIANGCHUAN</creatorcontrib><creatorcontrib>LIAO FEI</creatorcontrib><creatorcontrib>DENG ZHIWEN</creatorcontrib><creatorcontrib>LI PING</creatorcontrib><creatorcontrib>FANG SHENGKUN</creatorcontrib><creatorcontrib>CHEN QIYU</creatorcontrib><title>Processing path planning method based on random pheromone optimization elite colony algorithm</title><description>The invention is suitable for the technical field of processing, and particularly relates to a processing path planning method based on a random pheromone optimization elite ant colony algorithm. The method comprises the following steps of S1, inputting data, setting parameters and calculating the distance between points; S2, using an optimization algorithm to set an ant colony head coordinate; S3, updating a list to be accessed and a taboo list, calculating the transition probability and determining the path of each ant; S4, updating the pheromones; S5, judging whether the number of iterations is completed or not, if yes, outputting an optimal path, and generating a processing file; and if not, returning to the step S2. According to the method, the algorithms, such as ant colony first coordinates, pheromones, etc., are optimized, the local optimum is avoided, the optimal processing path can be efficiently iterated, and the production efficiency is greatly improved.
本发明适用于加工技术领域，尤其涉及一种基于随机信息素优化精英蚁群算法的加工路径规划方法</description><subject>CONTROL OR REGULATING SYSTEMS IN GENERAL</subject><subject>CONTROLLING</subject><subject>FUNCTIONAL ELEMENTS OF SUCH SYSTEMS</subject><subject>MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS ORELEMENTS</subject><subject>PHYSICS</subject><subject>REGULATING</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2021</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNijEKAjEQAK-xEPUP6wMEQwqxlOPESixs5ViT9RJIdkOyjb5eBR9gNQwz8-52qeKotcgTFNQAJSHz1zJpEA93bORBGCqylwwlUJUsTCBFY44v1PiplKISOEnCT8A0SY0a8rKbPTA1Wv246NbH4dqfNlRkpFbQEZOO_dkYu9tauzcH-8_zBlkuPP0</recordid><startdate>20211126</startdate><enddate>20211126</enddate><creator>LUO LIANGCHUAN</creator><creator>LIAO FEI</creator><creator>DENG ZHIWEN</creator><creator>LI PING</creator><creator>FANG SHENGKUN</creator><creator>CHEN QIYU</creator><scope>EVB</scope></search><sort><creationdate>20211126</creationdate><title>Processing path planning method based on random pheromone optimization elite colony algorithm</title><author>LUO LIANGCHUAN ; LIAO FEI ; DENG ZHIWEN ; LI PING ; FANG SHENGKUN ; CHEN QIYU</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN113703391A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2021</creationdate><topic>CONTROL OR REGULATING SYSTEMS IN GENERAL</topic><topic>CONTROLLING</topic><topic>FUNCTIONAL ELEMENTS OF SUCH SYSTEMS</topic><topic>MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS ORELEMENTS</topic><topic>PHYSICS</topic><topic>REGULATING</topic><toplevel>online_resources</toplevel><creatorcontrib>LUO LIANGCHUAN</creatorcontrib><creatorcontrib>LIAO FEI</creatorcontrib><creatorcontrib>DENG ZHIWEN</creatorcontrib><creatorcontrib>LI PING</creatorcontrib><creatorcontrib>FANG SHENGKUN</creatorcontrib><creatorcontrib>CHEN QIYU</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LUO LIANGCHUAN</au><au>LIAO FEI</au><au>DENG ZHIWEN</au><au>LI PING</au><au>FANG SHENGKUN</au><au>CHEN QIYU</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Processing path planning method based on random pheromone optimization elite colony algorithm</title><date>2021-11-26</date><risdate>2021</risdate><abstract>The invention is suitable for the technical field of processing, and particularly relates to a processing path planning method based on a random pheromone optimization elite ant colony algorithm. The method comprises the following steps of S1, inputting data, setting parameters and calculating the distance between points; S2, using an optimization algorithm to set an ant colony head coordinate; S3, updating a list to be accessed and a taboo list, calculating the transition probability and determining the path of each ant; S4, updating the pheromones; S5, judging whether the number of iterations is completed or not, if yes, outputting an optimal path, and generating a processing file; and if not, returning to the step S2. According to the method, the algorithms, such as ant colony first coordinates, pheromones, etc., are optimized, the local optimum is avoided, the optimal processing path can be efficiently iterated, and the production efficiency is greatly improved.
本发明适用于加工技术领域，尤其涉及一种基于随机信息素优化精英蚁群算法的加工路径规划方法</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | chi ; eng |
| recordid | cdi_epo_espacenet_CN113703391A |
| source | esp@cenet |
| subjects | CONTROL OR REGULATING SYSTEMS IN GENERAL CONTROLLING FUNCTIONAL ELEMENTS OF SUCH SYSTEMS MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS ORELEMENTS PHYSICS REGULATING |
| title | Processing path planning method based on random pheromone optimization elite colony algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T02%3A44%3A49IST&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=LUO%20LIANGCHUAN&rft.date=2021-11-26&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN113703391A%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 |