Convex Decreasing Algorithms: Distributed Synthesis and Finite-Time Termination in Higher Dimension

James Melbourne; Govind Saraswat; Vivek Khatana; Sourav Patel; Murti V. Salapaka

doi:10.1109/TAC.2023.3344721

Convex Decreasing Algorithms: Distributed Synthesis and Finite-Time Termination in Higher Dimension

James Melbourne, Govind Saraswat, Vivek Khatana, Sourav Patel, Murti V. Salapaka

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

We establish finite time termination algorithms for consensus algorithms based on geometric properties that yield finite-time guarantees, suited for use in high dimension and in the absence of a central authority. These pursuits motivate a new peer to peer convex hull algorithm which is utilized for one stopping algorithm. Further an alternative lightweight norm based stopping criteria is also developed. The practical utility of the algorithm is illustrated through MATLAB simulations.

Original language	English (US)
Pages (from-to)	1-8
Number of pages	8
Journal	IEEE Transactions on Automatic Control
DOIs	https://doi.org/10.1109/TAC.2023.3344721
State	Accepted/In press - 2023

Bibliographical note

Publisher Copyright:
IEEE

Keywords

Consensus algorithm
Convex hull
Costs
Directed graphs
Estimation
Government
Topology
Upper bound
distributed consensus
high-dimensional state algorithms
multi-agent systems
network-based computing systems

Access

10.1109/TAC.2023.3344721

Cite this

@article{5c0e5b93ae9a44d5857c3f04c9cf3bbc,

title = "Convex Decreasing Algorithms: Distributed Synthesis and Finite-Time Termination in Higher Dimension",

abstract = "We establish finite time termination algorithms for consensus algorithms based on geometric properties that yield finite-time guarantees, suited for use in high dimension and in the absence of a central authority. These pursuits motivate a new peer to peer convex hull algorithm which is utilized for one stopping algorithm. Further an alternative lightweight norm based stopping criteria is also developed. The practical utility of the algorithm is illustrated through MATLAB simulations.",

keywords = "Consensus algorithm, Convex hull, Costs, Directed graphs, Estimation, Government, Topology, Upper bound, distributed consensus, high-dimensional state algorithms, multi-agent systems, network-based computing systems",

author = "James Melbourne and Govind Saraswat and Vivek Khatana and Sourav Patel and Salapaka, {Murti V.}",

note = "Publisher Copyright: IEEE",

year = "2023",

doi = "10.1109/TAC.2023.3344721",

language = "English (US)",

pages = "1--8",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Convex Decreasing Algorithms

T2 - Distributed Synthesis and Finite-Time Termination in Higher Dimension

AU - Melbourne, James

AU - Saraswat, Govind

AU - Khatana, Vivek

AU - Patel, Sourav

AU - Salapaka, Murti V.

N1 - Publisher Copyright: IEEE

PY - 2023

Y1 - 2023

N2 - We establish finite time termination algorithms for consensus algorithms based on geometric properties that yield finite-time guarantees, suited for use in high dimension and in the absence of a central authority. These pursuits motivate a new peer to peer convex hull algorithm which is utilized for one stopping algorithm. Further an alternative lightweight norm based stopping criteria is also developed. The practical utility of the algorithm is illustrated through MATLAB simulations.

AB - We establish finite time termination algorithms for consensus algorithms based on geometric properties that yield finite-time guarantees, suited for use in high dimension and in the absence of a central authority. These pursuits motivate a new peer to peer convex hull algorithm which is utilized for one stopping algorithm. Further an alternative lightweight norm based stopping criteria is also developed. The practical utility of the algorithm is illustrated through MATLAB simulations.

KW - Consensus algorithm

KW - Convex hull

KW - Costs

KW - Directed graphs

KW - Estimation

KW - Government

KW - Topology

KW - Upper bound

KW - distributed consensus

KW - high-dimensional state algorithms

KW - multi-agent systems

KW - network-based computing systems

UR - http://www.scopus.com/inward/record.url?scp=85181574835&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85181574835&partnerID=8YFLogxK

U2 - 10.1109/TAC.2023.3344721

DO - 10.1109/TAC.2023.3344721

M3 - Article

AN - SCOPUS:85181574835

SN - 0018-9286

SP - 1

EP - 8

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

ER -

Convex Decreasing Algorithms: Distributed Synthesis and Finite-Time Termination in Higher Dimension

Abstract

Bibliographical note

Keywords

Access

Other files and links

Fingerprint

Cite this