Time optimal control systhesis for discrete time hybrid automata

Y. Pang, M.P. Spathopoulos

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this paper, the problem of time-optimal control for hybrid systems with discrete-time dynamics is considered. The hybrid controller steers all trajectories starting from a maximal set to a given target set in minimum time. We derive an algorithm that computes this maximal winning set. Also, algorithms for the computation of level sets associated with the value function rather than the value function itself are presented. We show that by solving the reachability problem for the discrete time hybrid automata we obtain the time optimal solution as well. The control synthesis is subject to hard constraints on both control inputs and states. For linear discrete-time dynamics, linear programming and quantifier elimination techniques are employed for the backward reachability analysis. Emphasis is given on the computation of operators for non-convex sets using an extended convex hull approach. A two-tank example is considered in order to demonstrate the techniques of the paper.
LanguageEnglish
Pages847-863
Number of pages16
JournalInternational Journal of Control
Volume78
Issue number11
DOIs
Publication statusPublished - 20 Jul 2005

Fingerprint

Set theory
Hybrid systems
Linear programming
Mathematical operators
Trajectories
Controllers

Keywords

  • control engineering
  • dynamical systems
  • control systems

Cite this

Pang, Y. ; Spathopoulos, M.P. / Time optimal control systhesis for discrete time hybrid automata. In: International Journal of Control. 2005 ; Vol. 78, No. 11. pp. 847-863.
@article{99533dc4a5bb4f9cbe5164699c83d710,
title = "Time optimal control systhesis for discrete time hybrid automata",
abstract = "In this paper, the problem of time-optimal control for hybrid systems with discrete-time dynamics is considered. The hybrid controller steers all trajectories starting from a maximal set to a given target set in minimum time. We derive an algorithm that computes this maximal winning set. Also, algorithms for the computation of level sets associated with the value function rather than the value function itself are presented. We show that by solving the reachability problem for the discrete time hybrid automata we obtain the time optimal solution as well. The control synthesis is subject to hard constraints on both control inputs and states. For linear discrete-time dynamics, linear programming and quantifier elimination techniques are employed for the backward reachability analysis. Emphasis is given on the computation of operators for non-convex sets using an extended convex hull approach. A two-tank example is considered in order to demonstrate the techniques of the paper.",
keywords = "control engineering, dynamical systems, control systems",
author = "Y. Pang and M.P. Spathopoulos",
year = "2005",
month = "7",
day = "20",
doi = "10.1080/00207170500114899",
language = "English",
volume = "78",
pages = "847--863",
journal = "International Journal of Control",
issn = "0020-7179",
number = "11",

}

Time optimal control systhesis for discrete time hybrid automata. / Pang, Y.; Spathopoulos, M.P.

In: International Journal of Control, Vol. 78, No. 11, 20.07.2005, p. 847-863.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Time optimal control systhesis for discrete time hybrid automata

AU - Pang, Y.

AU - Spathopoulos, M.P.

PY - 2005/7/20

Y1 - 2005/7/20

N2 - In this paper, the problem of time-optimal control for hybrid systems with discrete-time dynamics is considered. The hybrid controller steers all trajectories starting from a maximal set to a given target set in minimum time. We derive an algorithm that computes this maximal winning set. Also, algorithms for the computation of level sets associated with the value function rather than the value function itself are presented. We show that by solving the reachability problem for the discrete time hybrid automata we obtain the time optimal solution as well. The control synthesis is subject to hard constraints on both control inputs and states. For linear discrete-time dynamics, linear programming and quantifier elimination techniques are employed for the backward reachability analysis. Emphasis is given on the computation of operators for non-convex sets using an extended convex hull approach. A two-tank example is considered in order to demonstrate the techniques of the paper.

AB - In this paper, the problem of time-optimal control for hybrid systems with discrete-time dynamics is considered. The hybrid controller steers all trajectories starting from a maximal set to a given target set in minimum time. We derive an algorithm that computes this maximal winning set. Also, algorithms for the computation of level sets associated with the value function rather than the value function itself are presented. We show that by solving the reachability problem for the discrete time hybrid automata we obtain the time optimal solution as well. The control synthesis is subject to hard constraints on both control inputs and states. For linear discrete-time dynamics, linear programming and quantifier elimination techniques are employed for the backward reachability analysis. Emphasis is given on the computation of operators for non-convex sets using an extended convex hull approach. A two-tank example is considered in order to demonstrate the techniques of the paper.

KW - control engineering

KW - dynamical systems

KW - control systems

UR - http://dx.doi.org/10.1080/00207170500114899

U2 - 10.1080/00207170500114899

DO - 10.1080/00207170500114899

M3 - Article

VL - 78

SP - 847

EP - 863

JO - International Journal of Control

T2 - International Journal of Control

JF - International Journal of Control

SN - 0020-7179

IS - 11

ER -