Actuator selection for cyber-physical systems

Ahmad F. Taha, Nikolaos Gatsis, Tyler Summers, Sebastian Nugroho

Research output: ResearchConference contribution

Abstract

In cyber-physical systems (CPS), the problem of controlling resources can be depicted as an actuator selection problem. Given a large library of actuators and a control objective, what is the least number of actuators to be selected, and what is the corresponding optimal control law? These dynamic design questions are inherently coupled. In this paper, we show that a breadth of actuator selection and optimal control problems (stabilizability, robust and LQR control routines, control of uncertain, nonlinear systems) that do not satisfy the submodularity property lead to the formulation of two classes of combinatorial optimization routines for unstable CPSs: mixed-integer semidefinite programs and mixed-integer bilinear matrix inequalities. Branch-and-bound and greedy algorithms are proposed to address the computational complexity, and numerical results are given to illustrate the proposed formulations.

LanguageEnglish (US)
Title of host publication2017 American Control Conference, ACC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages5300-5305
Number of pages6
ISBN (Electronic)9781509059928
DOIs
StatePublished - Jun 29 2017
Event2017 American Control Conference, ACC 2017 - Seattle, United States
Duration: May 24 2017May 26 2017

Other

Other2017 American Control Conference, ACC 2017
CountryUnited States
CitySeattle
Period5/24/175/26/17

Fingerprint

Actuators
Cyber Physical System
Combinatorial optimization
Nonlinear systems
Computational complexity

Keywords

  • Actuator selection
  • controller design
  • cyber-physical systems
  • greedy algorithms
  • linear matrix inequalities

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Taha, A. F., Gatsis, N., Summers, T., & Nugroho, S. (2017). Actuator selection for cyber-physical systems. In 2017 American Control Conference, ACC 2017 (pp. 5300-5305). [7963778] Institute of Electrical and Electronics Engineers Inc.. DOI: 10.23919/ACC.2017.7963778

Actuator selection for cyber-physical systems. / Taha, Ahmad F.; Gatsis, Nikolaos; Summers, Tyler; Nugroho, Sebastian.

2017 American Control Conference, ACC 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 5300-5305 7963778.

Research output: ResearchConference contribution

Taha, AF, Gatsis, N, Summers, T & Nugroho, S 2017, Actuator selection for cyber-physical systems. in 2017 American Control Conference, ACC 2017., 7963778, Institute of Electrical and Electronics Engineers Inc., pp. 5300-5305, 2017 American Control Conference, ACC 2017, Seattle, United States, 5/24/17. DOI: 10.23919/ACC.2017.7963778
Taha AF, Gatsis N, Summers T, Nugroho S. Actuator selection for cyber-physical systems. In 2017 American Control Conference, ACC 2017. Institute of Electrical and Electronics Engineers Inc.2017. p. 5300-5305. 7963778. Available from, DOI: 10.23919/ACC.2017.7963778
Taha, Ahmad F. ; Gatsis, Nikolaos ; Summers, Tyler ; Nugroho, Sebastian. / Actuator selection for cyber-physical systems. 2017 American Control Conference, ACC 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 5300-5305
@inbook{ce88379702d640448dd6c545cf0cc3d1,
title = "Actuator selection for cyber-physical systems",
abstract = "In cyber-physical systems (CPS), the problem of controlling resources can be depicted as an actuator selection problem. Given a large library of actuators and a control objective, what is the least number of actuators to be selected, and what is the corresponding optimal control law? These dynamic design questions are inherently coupled. In this paper, we show that a breadth of actuator selection and optimal control problems (stabilizability, robust and LQR control routines, control of uncertain, nonlinear systems) that do not satisfy the submodularity property lead to the formulation of two classes of combinatorial optimization routines for unstable CPSs: mixed-integer semidefinite programs and mixed-integer bilinear matrix inequalities. Branch-and-bound and greedy algorithms are proposed to address the computational complexity, and numerical results are given to illustrate the proposed formulations.",
keywords = "Actuator selection, controller design, cyber-physical systems, greedy algorithms, linear matrix inequalities",
author = "Taha, {Ahmad F.} and Nikolaos Gatsis and Tyler Summers and Sebastian Nugroho",
year = "2017",
month = "6",
doi = "10.23919/ACC.2017.7963778",
pages = "5300--5305",
booktitle = "2017 American Control Conference, ACC 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - CHAP

T1 - Actuator selection for cyber-physical systems

AU - Taha,Ahmad F.

AU - Gatsis,Nikolaos

AU - Summers,Tyler

AU - Nugroho,Sebastian

PY - 2017/6/29

Y1 - 2017/6/29

N2 - In cyber-physical systems (CPS), the problem of controlling resources can be depicted as an actuator selection problem. Given a large library of actuators and a control objective, what is the least number of actuators to be selected, and what is the corresponding optimal control law? These dynamic design questions are inherently coupled. In this paper, we show that a breadth of actuator selection and optimal control problems (stabilizability, robust and LQR control routines, control of uncertain, nonlinear systems) that do not satisfy the submodularity property lead to the formulation of two classes of combinatorial optimization routines for unstable CPSs: mixed-integer semidefinite programs and mixed-integer bilinear matrix inequalities. Branch-and-bound and greedy algorithms are proposed to address the computational complexity, and numerical results are given to illustrate the proposed formulations.

AB - In cyber-physical systems (CPS), the problem of controlling resources can be depicted as an actuator selection problem. Given a large library of actuators and a control objective, what is the least number of actuators to be selected, and what is the corresponding optimal control law? These dynamic design questions are inherently coupled. In this paper, we show that a breadth of actuator selection and optimal control problems (stabilizability, robust and LQR control routines, control of uncertain, nonlinear systems) that do not satisfy the submodularity property lead to the formulation of two classes of combinatorial optimization routines for unstable CPSs: mixed-integer semidefinite programs and mixed-integer bilinear matrix inequalities. Branch-and-bound and greedy algorithms are proposed to address the computational complexity, and numerical results are given to illustrate the proposed formulations.

KW - Actuator selection

KW - controller design

KW - cyber-physical systems

KW - greedy algorithms

KW - linear matrix inequalities

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

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

U2 - 10.23919/ACC.2017.7963778

DO - 10.23919/ACC.2017.7963778

M3 - Conference contribution

SP - 5300

EP - 5305

BT - 2017 American Control Conference, ACC 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -