Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma

Tobias Leth; Christoffer Sloth; Rafal Wisniewski; Sriram Sankaranarayanan

doi:10.1016/j.ifacol.2017.08.339

Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma

Tobias Leth, Christoffer Sloth, Rafal Wisniewski, Sriram Sankaranarayanan

Publikation: Bidrag til tidsskrift › Konferenceartikel i tidsskrift › Forskning › peer review

3 Citationer (Scopus)

183 Downloads (Pure)

Abstract

In this paper we prove the convergence of an algorithm synthesising continuous piecewise-polynomial Lyapunov functions for polynomial vector elds dened on simplices. We subsequently modify the algorithm to sub-divide locally by utilizing information from infeasible linear problems. We prove that this modication does not destroy the convergence of the algorithm. Both methods are accompanied by examples.

Originalsprog	Engelsk
Bogserie	IFAC-PapersOnLine
Vol/bind	50
Udgave nummer	1
Sider (fra-til)	1667-1672
ISSN	2405-8963
DOI	https://doi.org/10.1016/j.ifacol.2017.08.339
Status	Udgivet - 10 jul. 2017
Begivenhed	2017 IFAC Congress - Varighed: 9 jul. 2017 → 14 jul. 2017 https://www.ifac2017.org/

Konference

Konference	2017 IFAC Congress
Periode	09/07/2017 → 14/07/2017
Internetadresse	https://www.ifac2017.org/

Adgang til dokumentet

10.1016/j.ifacol.2017.08.339

Open Access articleForlagets udgivne version, 553 KB

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

Citationsformater

@inproceedings{cd6921ebf4f3432f84860b4d763b9855,

title = "Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma",

abstract = "In this paper we prove the convergence of an algorithm synthesising continuous piecewise-polynomial Lyapunov functions for polynomial vector elds dened on simplices. We subsequently modify the algorithm to sub-divide locally by utilizing information from infeasible linear problems. We prove that this modication does not destroy the convergence of the algorithm. Both methods are accompanied by examples.",

author = "Tobias Leth and Christoffer Sloth and Rafal Wisniewski and Sriram Sankaranarayanan",

year = "2017",

month = jul,

day = "10",

doi = "10.1016/j.ifacol.2017.08.339",

language = "English",

volume = "50",

pages = "1667--1672",

journal = "IFAC-PapersOnLine",

issn = "2405-8963",

publisher = "Elsevier",

number = "1",

note = "2017 IFAC Congress ; Conference date: 09-07-2017 Through 14-07-2017",

url = "https://www.ifac2017.org/",

}

TY - GEN

T1 - Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma

AU - Leth, Tobias

AU - Sloth, Christoffer

AU - Wisniewski, Rafal

AU - Sankaranarayanan, Sriram

PY - 2017/7/10

Y1 - 2017/7/10

N2 - In this paper we prove the convergence of an algorithm synthesising continuous piecewise-polynomial Lyapunov functions for polynomial vector elds dened on simplices. We subsequently modify the algorithm to sub-divide locally by utilizing information from infeasible linear problems. We prove that this modication does not destroy the convergence of the algorithm. Both methods are accompanied by examples.

AB - In this paper we prove the convergence of an algorithm synthesising continuous piecewise-polynomial Lyapunov functions for polynomial vector elds dened on simplices. We subsequently modify the algorithm to sub-divide locally by utilizing information from infeasible linear problems. We prove that this modication does not destroy the convergence of the algorithm. Both methods are accompanied by examples.

U2 - 10.1016/j.ifacol.2017.08.339

DO - 10.1016/j.ifacol.2017.08.339

M3 - Conference article in Journal

SN - 2405-8963

VL - 50

SP - 1667

EP - 1672

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

IS - 1

T2 - 2017 IFAC Congress

Y2 - 9 July 2017 through 14 July 2017

ER -