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

James Melbourne; Govind Saraswat; Vivek Khatana; Sourav Patel; Murti 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 Salapaka

Power Systems 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	American English
Pages (from-to)	3960-3967
Number of pages	8
Journal	IEEE Transactions on Automatic Control
Volume	69
Issue number	6
DOIs	https://doi.org/10.1109/tac.2023.3344721
State	Published - 2024

Bibliographical note

See NREL/JA-5D00-77304 for arXiv preprint

NREL Publication Number

NREL/JA-5D00-88723

Keywords

convex hull
distributed consensus
high-dimensional state algorithms
multi-agent systems
network-based computing systems

Access to Document

10.1109/tac.2023.3344721

Cite this

@article{c53450d12e144147a9c6a36cb3b3ac55,

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 = "convex hull, 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 Murti Salapaka",

note = "See NREL/JA-5D00-77304 for arXiv preprint",

year = "2024",

doi = "10.1109/tac.2023.3344721",

language = "American English",

volume = "69",

pages = "3960--3967",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

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

number = "6",

}

TY - JOUR

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

AU - Melbourne, James

AU - Saraswat, Govind

AU - Khatana, Vivek

AU - Patel, Sourav

AU - Salapaka, Murti

N1 - See NREL/JA-5D00-77304 for arXiv preprint

PY - 2024

Y1 - 2024

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 - convex hull

KW - distributed consensus

KW - high-dimensional state algorithms

KW - multi-agent systems

KW - network-based computing systems

U2 - 10.1109/tac.2023.3344721

DO - 10.1109/tac.2023.3344721

M3 - Article

SN - 0018-9286

VL - 69

SP - 3960

EP - 3967

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 6

ER -

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

Abstract

Bibliographical note

NREL Publication Number

Keywords

Access to Document

Fingerprint

Cite this