Feedback encoding for efficient symbolic control of dynamical systems

Antonio Bicchi, Alessia Marigo, Benedetto Piccoli

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

The problem of efficiently steering dynamical systems by generating input plans is considered. Plans are considered which consist of finite-length words constructed on an alphabet of input symbols, which could be, e.g., transmitted through a limited capacity channel to a remote system, where they can be decoded in suitable control actions. Efficiency is considered in terms of the computational complexity of plans, and in terms of their description length (in number of bits). We show that, by suitable choice of the control encoding, finite plans can be efficiently built for a wide class of dynamical systems, computing arbitrarily close approximations of a desired equilibrium in polynomial time. The paper also investigates how the efficiency of planning is affected by the choice of inputs, and provides some results as to optimal performance in terms of accuracy and range.

Original languageEnglish (US)
Pages (from-to)987-1002
Number of pages16
JournalIEEE Transactions on Automatic Control
Volume51
Issue number6
DOIs
StatePublished - Jun 1 2006
Externally publishedYes

Fingerprint

Dynamical systems
Feedback
Channel capacity
Computational complexity
Polynomials
Planning

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

@article{3991730557354159adc81506295d95eb,
title = "Feedback encoding for efficient symbolic control of dynamical systems",
abstract = "The problem of efficiently steering dynamical systems by generating input plans is considered. Plans are considered which consist of finite-length words constructed on an alphabet of input symbols, which could be, e.g., transmitted through a limited capacity channel to a remote system, where they can be decoded in suitable control actions. Efficiency is considered in terms of the computational complexity of plans, and in terms of their description length (in number of bits). We show that, by suitable choice of the control encoding, finite plans can be efficiently built for a wide class of dynamical systems, computing arbitrarily close approximations of a desired equilibrium in polynomial time. The paper also investigates how the efficiency of planning is affected by the choice of inputs, and provides some results as to optimal performance in terms of accuracy and range.",
author = "Antonio Bicchi and Alessia Marigo and Benedetto Piccoli",
year = "2006",
month = "6",
day = "1",
doi = "10.1109/TAC.2006.876947",
language = "English (US)",
volume = "51",
pages = "987--1002",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

Feedback encoding for efficient symbolic control of dynamical systems. / Bicchi, Antonio; Marigo, Alessia; Piccoli, Benedetto.

In: IEEE Transactions on Automatic Control, Vol. 51, No. 6, 01.06.2006, p. 987-1002.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Feedback encoding for efficient symbolic control of dynamical systems

AU - Bicchi, Antonio

AU - Marigo, Alessia

AU - Piccoli, Benedetto

PY - 2006/6/1

Y1 - 2006/6/1

N2 - The problem of efficiently steering dynamical systems by generating input plans is considered. Plans are considered which consist of finite-length words constructed on an alphabet of input symbols, which could be, e.g., transmitted through a limited capacity channel to a remote system, where they can be decoded in suitable control actions. Efficiency is considered in terms of the computational complexity of plans, and in terms of their description length (in number of bits). We show that, by suitable choice of the control encoding, finite plans can be efficiently built for a wide class of dynamical systems, computing arbitrarily close approximations of a desired equilibrium in polynomial time. The paper also investigates how the efficiency of planning is affected by the choice of inputs, and provides some results as to optimal performance in terms of accuracy and range.

AB - The problem of efficiently steering dynamical systems by generating input plans is considered. Plans are considered which consist of finite-length words constructed on an alphabet of input symbols, which could be, e.g., transmitted through a limited capacity channel to a remote system, where they can be decoded in suitable control actions. Efficiency is considered in terms of the computational complexity of plans, and in terms of their description length (in number of bits). We show that, by suitable choice of the control encoding, finite plans can be efficiently built for a wide class of dynamical systems, computing arbitrarily close approximations of a desired equilibrium in polynomial time. The paper also investigates how the efficiency of planning is affected by the choice of inputs, and provides some results as to optimal performance in terms of accuracy and range.

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

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

U2 - 10.1109/TAC.2006.876947

DO - 10.1109/TAC.2006.876947

M3 - Article

VL - 51

SP - 987

EP - 1002

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 6

ER -