Sparsity-promoting optimal control for a class of distributed systems

Makan Fardad; Fu Lin; Mihailo R. Jovanović

doi:10.1109/acc.2011.5991020

Sparsity-promoting optimal control for a class of distributed systems

Makan Fardad, Fu Lin, Mihailo R. Jovanović

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

106 Scopus citations

Abstract

We consider a linear quadratic optimal control problem with an additional penalty on the number of communication links in the distributed controller. We reformulate this combinatorial optimization problem as a sequence of weighted ℓ₁ problems, where the weighted ℓ₁ norm approximates the counting of the communication links. We identify a class of systems for which the weighted ℓ₁ problem can be formulated as a semidefinite program and therefore its solution can be computed efficiently. Application of the developed algorithm to the optimal control of vehicular formations reveals communication topologies that become sparser as the price of inter-vehicular communications is increased.

Original language	English (US)
Title of host publication	Proceedings of the 2011 American Control Conference, ACC 2011
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2050-2055
Number of pages	6
ISBN (Print)	9781457700804
DOIs	https://doi.org/10.1109/acc.2011.5991020
State	Published - 2011

Publication series

Name	Proceedings of the American Control Conference
ISSN (Print)	0743-1619

Keywords

Communication architecture
convex optimization
reweighting
semidefinite program
sparsity-promoting optimal control
vehicular formations

Access

10.1109/acc.2011.5991020

OpenUrl availability

Full text

Cite this

Sparsity-promoting optimal control for a class of distributed systems. / Fardad, Makan; Lin, Fu; Jovanović, Mihailo R.
Proceedings of the 2011 American Control Conference, ACC 2011. Institute of Electrical and Electronics Engineers Inc., 2011. p. 2050-2055 5991020 (Proceedings of the American Control Conference).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

@inproceedings{19c5d3aa8a5f405997c93880fb669253,

title = "Sparsity-promoting optimal control for a class of distributed systems",

abstract = "We consider a linear quadratic optimal control problem with an additional penalty on the number of communication links in the distributed controller. We reformulate this combinatorial optimization problem as a sequence of weighted ℓ1 problems, where the weighted ℓ1 norm approximates the counting of the communication links. We identify a class of systems for which the weighted ℓ1 problem can be formulated as a semidefinite program and therefore its solution can be computed efficiently. Application of the developed algorithm to the optimal control of vehicular formations reveals communication topologies that become sparser as the price of inter-vehicular communications is increased.",

keywords = "Communication architecture, convex optimization, reweighting, semidefinite program, sparsity-promoting optimal control, vehicular formations",

author = "Makan Fardad and Fu Lin and Jovanovi{\'c}, {Mihailo R.}",

year = "2011",

doi = "10.1109/acc.2011.5991020",

language = "English (US)",

isbn = "9781457700804",

series = "Proceedings of the American Control Conference",

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

pages = "2050--2055",

booktitle = "Proceedings of the 2011 American Control Conference, ACC 2011",

}

TY - GEN

T1 - Sparsity-promoting optimal control for a class of distributed systems

AU - Fardad, Makan

AU - Lin, Fu

AU - Jovanović, Mihailo R.

PY - 2011

Y1 - 2011

N2 - We consider a linear quadratic optimal control problem with an additional penalty on the number of communication links in the distributed controller. We reformulate this combinatorial optimization problem as a sequence of weighted ℓ1 problems, where the weighted ℓ1 norm approximates the counting of the communication links. We identify a class of systems for which the weighted ℓ1 problem can be formulated as a semidefinite program and therefore its solution can be computed efficiently. Application of the developed algorithm to the optimal control of vehicular formations reveals communication topologies that become sparser as the price of inter-vehicular communications is increased.

AB - We consider a linear quadratic optimal control problem with an additional penalty on the number of communication links in the distributed controller. We reformulate this combinatorial optimization problem as a sequence of weighted ℓ1 problems, where the weighted ℓ1 norm approximates the counting of the communication links. We identify a class of systems for which the weighted ℓ1 problem can be formulated as a semidefinite program and therefore its solution can be computed efficiently. Application of the developed algorithm to the optimal control of vehicular formations reveals communication topologies that become sparser as the price of inter-vehicular communications is increased.

KW - Communication architecture

KW - convex optimization

KW - reweighting

KW - semidefinite program

KW - sparsity-promoting optimal control

KW - vehicular formations

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

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

U2 - 10.1109/acc.2011.5991020

DO - 10.1109/acc.2011.5991020

M3 - Conference contribution

AN - SCOPUS:80053161959

SN - 9781457700804

T3 - Proceedings of the American Control Conference

SP - 2050

EP - 2055

BT - Proceedings of the 2011 American Control Conference, ACC 2011

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Sparsity-promoting optimal control for a class of distributed systems

Abstract

Publication series

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this