No Cover Image

Journal article 298 views 203 downloads

Analysis and design of a distributed k-winners-take-all model

Yinyan Zhang, Shuai Li Orcid Logo, Bin Xu, Yong Yang

Automatica, Volume: 115, Start page: 108868

Swansea University Author: Shuai Li Orcid Logo

  • zhang2020.pdf

    PDF | Accepted Manuscript

    Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND).

    Download (380.65KB)

Check full text

DOI (Published version): 10.1016/j.automatica.2020.108868

Abstract

The -winners-take-all (WTA) problem is to find the largest inputs from inputs. In this paper, we design and propose a novel distributed WTA model, for which no central unit is needed to realize the computation of the winners. As a result, the proposed model has the general advantages of distributed...

Full description

Published in: Automatica
ISSN: 0005-1098
Published: Elsevier BV 2020
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa53516
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2020-02-13T19:46:06Z
last_indexed 2020-09-17T03:16:47Z
id cronfa53516
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2020-02-13T12:36:41.0484564</datestamp><bib-version>v2</bib-version><id>53516</id><entry>2020-02-13</entry><title>Analysis and design of a distributed k-winners-take-all model</title><swanseaauthors><author><sid>42ff9eed09bcd109fbbe484a0f99a8a8</sid><ORCID>0000-0001-8316-5289</ORCID><firstname>Shuai</firstname><surname>Li</surname><name>Shuai Li</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2020-02-13</date><deptcode>MECH</deptcode><abstract>The -winners-take-all (WTA) problem is to find the largest inputs from inputs. In this paper, we design and propose a novel distributed WTA model, for which no central unit is needed to realize the computation of the winners. As a result, the proposed model has the general advantages of distributed models over centralized ones, such as better robustness to faults of agents. The global asymptotic convergence of the proposed distributed model is proven. Besides, two numerical examples on networks of agents with static inputs and time-varying inputs are presented to validate the performance of the proposed model.</abstract><type>Journal Article</type><journal>Automatica</journal><volume>115</volume><paginationStart>108868</paginationStart><publisher>Elsevier BV</publisher><issnPrint>0005-1098</issnPrint><keywords>Optimization, k-winners-take-all, Convergence, Multi-agent system, Invariance principle</keywords><publishedDay>1</publishedDay><publishedMonth>5</publishedMonth><publishedYear>2020</publishedYear><publishedDate>2020-05-01</publishedDate><doi>10.1016/j.automatica.2020.108868</doi><url/><notes/><college>COLLEGE NANME</college><department>Mechanical Engineering</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>MECH</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2020-02-13T12:36:41.0484564</lastEdited><Created>2020-02-13T12:36:41.0484564</Created><authors><author><firstname>Yinyan</firstname><surname>Zhang</surname><order>1</order></author><author><firstname>Shuai</firstname><surname>Li</surname><orcid>0000-0001-8316-5289</orcid><order>2</order></author><author><firstname>Bin</firstname><surname>Xu</surname><order>3</order></author><author><firstname>Yong</firstname><surname>Yang</surname><order>4</order></author></authors><documents><document><filename>53516__16634__ef8e931337604abb9c881d58f4769155.pdf</filename><originalFilename>zhang2020.pdf</originalFilename><uploaded>2020-02-19T15:39:03.5137621</uploaded><type>Output</type><contentLength>389785</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2021-02-08T00:00:00.0000000</embargoDate><documentNotes>Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND).</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language></document></documents><OutputDurs/></rfc1807>
spelling 2020-02-13T12:36:41.0484564 v2 53516 2020-02-13 Analysis and design of a distributed k-winners-take-all model 42ff9eed09bcd109fbbe484a0f99a8a8 0000-0001-8316-5289 Shuai Li Shuai Li true false 2020-02-13 MECH The -winners-take-all (WTA) problem is to find the largest inputs from inputs. In this paper, we design and propose a novel distributed WTA model, for which no central unit is needed to realize the computation of the winners. As a result, the proposed model has the general advantages of distributed models over centralized ones, such as better robustness to faults of agents. The global asymptotic convergence of the proposed distributed model is proven. Besides, two numerical examples on networks of agents with static inputs and time-varying inputs are presented to validate the performance of the proposed model. Journal Article Automatica 115 108868 Elsevier BV 0005-1098 Optimization, k-winners-take-all, Convergence, Multi-agent system, Invariance principle 1 5 2020 2020-05-01 10.1016/j.automatica.2020.108868 COLLEGE NANME Mechanical Engineering COLLEGE CODE MECH Swansea University 2020-02-13T12:36:41.0484564 2020-02-13T12:36:41.0484564 Yinyan Zhang 1 Shuai Li 0000-0001-8316-5289 2 Bin Xu 3 Yong Yang 4 53516__16634__ef8e931337604abb9c881d58f4769155.pdf zhang2020.pdf 2020-02-19T15:39:03.5137621 Output 389785 application/pdf Accepted Manuscript true 2021-02-08T00:00:00.0000000 Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND). true eng
title Analysis and design of a distributed k-winners-take-all model
spellingShingle Analysis and design of a distributed k-winners-take-all model
Shuai Li
title_short Analysis and design of a distributed k-winners-take-all model
title_full Analysis and design of a distributed k-winners-take-all model
title_fullStr Analysis and design of a distributed k-winners-take-all model
title_full_unstemmed Analysis and design of a distributed k-winners-take-all model
title_sort Analysis and design of a distributed k-winners-take-all model
author_id_str_mv 42ff9eed09bcd109fbbe484a0f99a8a8
author_id_fullname_str_mv 42ff9eed09bcd109fbbe484a0f99a8a8_***_Shuai Li
author Shuai Li
author2 Yinyan Zhang
Shuai Li
Bin Xu
Yong Yang
format Journal article
container_title Automatica
container_volume 115
container_start_page 108868
publishDate 2020
institution Swansea University
issn 0005-1098
doi_str_mv 10.1016/j.automatica.2020.108868
publisher Elsevier BV
document_store_str 1
active_str 0
description The -winners-take-all (WTA) problem is to find the largest inputs from inputs. In this paper, we design and propose a novel distributed WTA model, for which no central unit is needed to realize the computation of the winners. As a result, the proposed model has the general advantages of distributed models over centralized ones, such as better robustness to faults of agents. The global asymptotic convergence of the proposed distributed model is proven. Besides, two numerical examples on networks of agents with static inputs and time-varying inputs are presented to validate the performance of the proposed model.
published_date 2020-05-01T04:06:29Z
_version_ 1763753474875457536
score 11.013799

Similar Items