A continuous-time dynamical system that can sort agents through distributed protocols
2014 (English)In: 2014 IEEEMulti-conference on Systems and Control, Antibes, France: Institute of Electrical and Electronics Engineers (IEEE), 2014, 2153-2158 p.Conference paper (Refereed)
A class of continuous-time dynamical systems able to sort a list of real numbers is introduced in this paper. The dynamical sorting is achieved in a completely distributed manner, by modifying a consensus problem, namely right multiplying a Laplacian matrix by a diagonal matrix of weights that represents the desired order. The sorting obtained is relative, i.e., a conservation law is imposed on the dynamics. It is shown that sorting can be achieved in finite-time even in a globally smooth way.
Place, publisher, year, edition, pages
Antibes, France: Institute of Electrical and Electronics Engineers (IEEE), 2014. 2153-2158 p.
IdentifiersURN: urn:nbn:se:liu:diva-120910DOI: 10.1109/CCA.2014.6981621ISBN: 978-147997409-2OAI: oai:DiVA.org:liu-120910DiVA: diva2:849580
2014 IEEE Multi-conference on Systems and Control