Distributed Fixed/Preassigned-Time Optimization Based on Piecewise Power-Law Design
The problem of fixed-time (FXT) and preassigned-time (PAT) optimization is concerned in this article based on multiagent systems (MASs) and power-law algorithms. Under the framework of strong convexity of the cost functions, two types of piecewise algorithms are proposed, which ensure that the FXT o...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on cybernetics 2023-07, Vol.53 (7), p.4320-4333 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 4333 |
|---|---|
| container_issue | 7 |
| container_start_page | 4320 |
| container_title | IEEE transactions on cybernetics |
| container_volume | 53 |
| creator | Ma, Lanlan Hu, Cheng Yu, Juan Wang, Leimin Jiang, Haijun |
| description | The problem of fixed-time (FXT) and preassigned-time (PAT) optimization is concerned in this article based on multiagent systems (MASs) and power-law algorithms. Under the framework of strong convexity of the cost functions, two types of piecewise algorithms are proposed, which ensure that the FXT optimization can be solved either by first achieving the FXT consensus or by first achieving local optimization. Correspondingly, the PAT optimization problem is also considered by designing several piecewise protocols, where the finished time of optimization can be arbitrary prescribed according to actual demands. Furthermore, these piecewise power-law algorithms on the weighted undirected graphs are generalized to the weighted digraphs. Finally, by providing two numerical examples, the presented algorithms are further verified. |
| doi_str_mv | 10.1109/TCYB.2022.3163623 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TCYB_2022_3163623</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9765796</ieee_id><sourcerecordid>2826477810</sourcerecordid><originalsourceid>FETCH-LOGICAL-c349t-c7577157d9dadd4b363a2b8eb85ef7e2ce11c86d4c57e36b38a0700a1e0596df3</originalsourceid><addsrcrecordid>eNpdkE1LAzEQhoMoWtQfIIIsePGybT42H3u0rVWhYMF68BSym6mkdLs12aXqrzdLaw_mkmHmeYfhQeiK4D4hOB_MR-_DPsWU9hkRTFB2hHqUCJVSKvnxoRbyDF2GsMTxqdjK1Sk6YzxTgou8h17HLjTeFW0DNpm4L7CDmQcTgvtYg03nroLkZdO4yv2YxtXrZGhCJGMxc1DC1gVIZvUWfDo122QMXe4CnSzMKsDl_j9Hb5OH-egpnb48Po_up2nJsrxJS8mlJFza3Bprs4IJZmihoFAcFhJoCYSUStis5BKYKJgyWGJsCGCeC7tg5-hut3fj688WQqMrF0pYrcwa6jZoKriKMhRXEb39hy7r1q_jdZoqKjIpFcGRIjuq9HUIHhZ6411l_LcmWHfSdSddd9L1XnrM3Ow3t0UF9pD4UxyB6x3gAOAwzqXgMhfsF-Y6hNw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2826477810</pqid></control><display><type>article</type><title>Distributed Fixed/Preassigned-Time Optimization Based on Piecewise Power-Law Design</title><source>IEEE Electronic Library (IEL)</source><creator>Ma, Lanlan ; Hu, Cheng ; Yu, Juan ; Wang, Leimin ; Jiang, Haijun</creator><creatorcontrib>Ma, Lanlan ; Hu, Cheng ; Yu, Juan ; Wang, Leimin ; Jiang, Haijun</creatorcontrib><description>The problem of fixed-time (FXT) and preassigned-time (PAT) optimization is concerned in this article based on multiagent systems (MASs) and power-law algorithms. Under the framework of strong convexity of the cost functions, two types of piecewise algorithms are proposed, which ensure that the FXT optimization can be solved either by first achieving the FXT consensus or by first achieving local optimization. Correspondingly, the PAT optimization problem is also considered by designing several piecewise protocols, where the finished time of optimization can be arbitrary prescribed according to actual demands. Furthermore, these piecewise power-law algorithms on the weighted undirected graphs are generalized to the weighted digraphs. Finally, by providing two numerical examples, the presented algorithms are further verified.</description><identifier>ISSN: 2168-2267</identifier><identifier>EISSN: 2168-2275</identifier><identifier>DOI: 10.1109/TCYB.2022.3163623</identifier><identifier>PMID: 35486569</identifier><identifier>CODEN: ITCEB8</identifier><language>eng</language><publisher>United States: IEEE</publisher><subject>Algorithms ; Asymptotic stability ; Convexity ; Cost function ; Design optimization ; Directed graphs ; Distributed algorithm ; fixed-time (FXT) optimization ; Graph theory ; Heuristic algorithms ; Laplace equations ; Local optimization ; multiagent system (MAS) ; Multiagent systems ; Optimization ; Power law ; preassigned-time (PAT) optimization ; Protocols ; Stability criteria</subject><ispartof>IEEE transactions on cybernetics, 2023-07, Vol.53 (7), p.4320-4333</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c349t-c7577157d9dadd4b363a2b8eb85ef7e2ce11c86d4c57e36b38a0700a1e0596df3</citedby><cites>FETCH-LOGICAL-c349t-c7577157d9dadd4b363a2b8eb85ef7e2ce11c86d4c57e36b38a0700a1e0596df3</cites><orcidid>0000-0002-0663-3365 ; 0000-0003-1322-2828</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9765796$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9765796$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/35486569$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Ma, Lanlan</creatorcontrib><creatorcontrib>Hu, Cheng</creatorcontrib><creatorcontrib>Yu, Juan</creatorcontrib><creatorcontrib>Wang, Leimin</creatorcontrib><creatorcontrib>Jiang, Haijun</creatorcontrib><title>Distributed Fixed/Preassigned-Time Optimization Based on Piecewise Power-Law Design</title><title>IEEE transactions on cybernetics</title><addtitle>TCYB</addtitle><addtitle>IEEE Trans Cybern</addtitle><description>The problem of fixed-time (FXT) and preassigned-time (PAT) optimization is concerned in this article based on multiagent systems (MASs) and power-law algorithms. Under the framework of strong convexity of the cost functions, two types of piecewise algorithms are proposed, which ensure that the FXT optimization can be solved either by first achieving the FXT consensus or by first achieving local optimization. Correspondingly, the PAT optimization problem is also considered by designing several piecewise protocols, where the finished time of optimization can be arbitrary prescribed according to actual demands. Furthermore, these piecewise power-law algorithms on the weighted undirected graphs are generalized to the weighted digraphs. Finally, by providing two numerical examples, the presented algorithms are further verified.</description><subject>Algorithms</subject><subject>Asymptotic stability</subject><subject>Convexity</subject><subject>Cost function</subject><subject>Design optimization</subject><subject>Directed graphs</subject><subject>Distributed algorithm</subject><subject>fixed-time (FXT) optimization</subject><subject>Graph theory</subject><subject>Heuristic algorithms</subject><subject>Laplace equations</subject><subject>Local optimization</subject><subject>multiagent system (MAS)</subject><subject>Multiagent systems</subject><subject>Optimization</subject><subject>Power law</subject><subject>preassigned-time (PAT) optimization</subject><subject>Protocols</subject><subject>Stability criteria</subject><issn>2168-2267</issn><issn>2168-2275</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkE1LAzEQhoMoWtQfIIIsePGybT42H3u0rVWhYMF68BSym6mkdLs12aXqrzdLaw_mkmHmeYfhQeiK4D4hOB_MR-_DPsWU9hkRTFB2hHqUCJVSKvnxoRbyDF2GsMTxqdjK1Sk6YzxTgou8h17HLjTeFW0DNpm4L7CDmQcTgvtYg03nroLkZdO4yv2YxtXrZGhCJGMxc1DC1gVIZvUWfDo122QMXe4CnSzMKsDl_j9Hb5OH-egpnb48Po_up2nJsrxJS8mlJFza3Bprs4IJZmihoFAcFhJoCYSUStis5BKYKJgyWGJsCGCeC7tg5-hut3fj688WQqMrF0pYrcwa6jZoKriKMhRXEb39hy7r1q_jdZoqKjIpFcGRIjuq9HUIHhZ6411l_LcmWHfSdSddd9L1XnrM3Ow3t0UF9pD4UxyB6x3gAOAwzqXgMhfsF-Y6hNw</recordid><startdate>20230701</startdate><enddate>20230701</enddate><creator>Ma, Lanlan</creator><creator>Hu, Cheng</creator><creator>Yu, Juan</creator><creator>Wang, Leimin</creator><creator>Jiang, Haijun</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>H8D</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7X8</scope><orcidid>https://orcid.org/0000-0002-0663-3365</orcidid><orcidid>https://orcid.org/0000-0003-1322-2828</orcidid></search><sort><creationdate>20230701</creationdate><title>Distributed Fixed/Preassigned-Time Optimization Based on Piecewise Power-Law Design</title><author>Ma, Lanlan ; Hu, Cheng ; Yu, Juan ; Wang, Leimin ; Jiang, Haijun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c349t-c7577157d9dadd4b363a2b8eb85ef7e2ce11c86d4c57e36b38a0700a1e0596df3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Asymptotic stability</topic><topic>Convexity</topic><topic>Cost function</topic><topic>Design optimization</topic><topic>Directed graphs</topic><topic>Distributed algorithm</topic><topic>fixed-time (FXT) optimization</topic><topic>Graph theory</topic><topic>Heuristic algorithms</topic><topic>Laplace equations</topic><topic>Local optimization</topic><topic>multiagent system (MAS)</topic><topic>Multiagent systems</topic><topic>Optimization</topic><topic>Power law</topic><topic>preassigned-time (PAT) optimization</topic><topic>Protocols</topic><topic>Stability criteria</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ma, Lanlan</creatorcontrib><creatorcontrib>Hu, Cheng</creatorcontrib><creatorcontrib>Yu, Juan</creatorcontrib><creatorcontrib>Wang, Leimin</creatorcontrib><creatorcontrib>Jiang, Haijun</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>MEDLINE - Academic</collection><jtitle>IEEE transactions on cybernetics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ma, Lanlan</au><au>Hu, Cheng</au><au>Yu, Juan</au><au>Wang, Leimin</au><au>Jiang, Haijun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Distributed Fixed/Preassigned-Time Optimization Based on Piecewise Power-Law Design</atitle><jtitle>IEEE transactions on cybernetics</jtitle><stitle>TCYB</stitle><addtitle>IEEE Trans Cybern</addtitle><date>2023-07-01</date><risdate>2023</risdate><volume>53</volume><issue>7</issue><spage>4320</spage><epage>4333</epage><pages>4320-4333</pages><issn>2168-2267</issn><eissn>2168-2275</eissn><coden>ITCEB8</coden><abstract>The problem of fixed-time (FXT) and preassigned-time (PAT) optimization is concerned in this article based on multiagent systems (MASs) and power-law algorithms. Under the framework of strong convexity of the cost functions, two types of piecewise algorithms are proposed, which ensure that the FXT optimization can be solved either by first achieving the FXT consensus or by first achieving local optimization. Correspondingly, the PAT optimization problem is also considered by designing several piecewise protocols, where the finished time of optimization can be arbitrary prescribed according to actual demands. Furthermore, these piecewise power-law algorithms on the weighted undirected graphs are generalized to the weighted digraphs. Finally, by providing two numerical examples, the presented algorithms are further verified.</abstract><cop>United States</cop><pub>IEEE</pub><pmid>35486569</pmid><doi>10.1109/TCYB.2022.3163623</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0002-0663-3365</orcidid><orcidid>https://orcid.org/0000-0003-1322-2828</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2168-2267 |
| ispartof | IEEE transactions on cybernetics, 2023-07, Vol.53 (7), p.4320-4333 |
| issn | 2168-2267 2168-2275 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TCYB_2022_3163623 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Asymptotic stability Convexity Cost function Design optimization Directed graphs Distributed algorithm fixed-time (FXT) optimization Graph theory Heuristic algorithms Laplace equations Local optimization multiagent system (MAS) Multiagent systems Optimization Power law preassigned-time (PAT) optimization Protocols Stability criteria |
| title | Distributed Fixed/Preassigned-Time Optimization Based on Piecewise Power-Law Design |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-19T23%3A57%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Distributed%20Fixed/Preassigned-Time%20Optimization%20Based%20on%20Piecewise%20Power-Law%20Design&rft.jtitle=IEEE%20transactions%20on%20cybernetics&rft.au=Ma,%20Lanlan&rft.date=2023-07-01&rft.volume=53&rft.issue=7&rft.spage=4320&rft.epage=4333&rft.pages=4320-4333&rft.issn=2168-2267&rft.eissn=2168-2275&rft.coden=ITCEB8&rft_id=info:doi/10.1109/TCYB.2022.3163623&rft_dat=%3Cproquest_RIE%3E2826477810%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2826477810&rft_id=info:pmid/35486569&rft_ieee_id=9765796&rfr_iscdi=true |