By Topic

Robust invariance in uncertain discrete event systems with applications to transportation networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ying Shang ; Fac. of the Dept. of Electr. & Comput. Eng., Southern Illinois Univ. Edwardsville, Edwardsville, IL, USA

This paper studies a class of uncertain discrete event systems over the max-plus algebra, where system matrices are unknown but are convex combinations of known matrices. These systems model a wide range of applications, for example, transportation systems with varying vehicle travel time and queueing networks with uncertain arrival and queuing time. This paper presents computational methods for different robust invariant sets of such systems. A recursive algorithm is given to compute the supremal robust invariant sub-semimodule in a given sub-semimodule. The algorithm converges to a fixed point in a finite number of iterations under proper assumptions on the state semimodule. This paper also presents computational methods for positively robust invariant polyhedral sets. A search algorithm is presented for the positively robust invariant polyhedral sets. The main results are applied to the time table design of a public transportation network.

Published in:

American Control Conference, 2009. ACC '09.

Date of Conference:

10-12 June 2009