Solving Optimization Problems on Hybrid Systems by Graph Exploration

Author

Hiraishi, Kunihiko

Author_Institution

Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa

fYear

2006

fDate

10-12 July 2006

Firstpage

282

Lastpage

287

Abstract

The aim of this research is to give a systematic way to solve optimization problems on hybrid systems. The target classes of hybrid systems are linear hybrid automata and piecewise linear systems. The behavior of a hybrid system is represented by a directed acyclic graph such that each node is associated with a convex polyhedron on continuous state variables, and each edge corresponds to a discrete transition. Then the problem is solved by finding a trajectory in the graph that fulfills given specifications and also optimizes a given objective function. The procedure is implemented on a constraint logic programming language

Keywords

automata theory; directed graphs; linear systems; logic programming; optimisation; constraint logic programming language; continuous state variables; convex polyhedron; directed acyclic graph; graph exploration; hybrid systems; linear hybrid automata; optimization; piecewise linear systems; Automata; Control theory; Cost accounting; Integer linear programming; Lab-on-a-chip; Logic programming; Optimal control; Piecewise linear techniques; Reactive power; Switched systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Discrete Event Systems, 2006 8th International Workshop on

Conference_Location

Ann Arbor, MI

Print_ISBN

1-4244-0053-8

Type

conf

DOI

10.1109/WODES.2006.1678443

Filename

1678443