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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:
    Shang, Ying (author)


    Publication date :

    2009


    Size :

    6 Seiten, 15 Quellen




    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    Robust Pricing of Transportation Networks under Uncertain Demand

    Gardner, Lauren M. / Unnikrishnan, Avinash / Waller, S. Travis | Transportation Research Record | 2008


    Robust Pricing of Transportation Networks Under Uncertain Demand

    Gardner, Lauren M. | Online Contents | 2008


    Robust stabilization of uncertain discrete time-delay systems

    Guan, Xinping / Liu, Yichang / Shi, Peng et al. | AIAA | 2000