Summary
This chapter presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds for the event costs of a language measure that has been recently reported in literature and is presented in Chapter 1. The performance index for the proposed robust optimal policy is obtained by combining the measure of the supervised plant language with uncertainty. The performance of a controller is represented by the language measure of the supervised plant and is minimized over the given range of event cost uncertainties. Synthesis of the robust optimal control policy requires at most n iterations, where n is the number of states of the deterministic finite state automaton (DFSA) model generated from the regular language of the unsupervised plant behavior. The computational complexity of control synthesis is polynomial in n.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Y. Brave and M. Heyman, On optimal attraction of discrete-event processes, Information Science 67 (1993), no. 3, 245–276.
J. E. R. Cury and B. H. Krogh, Robustness of supervisors for discrete-event systems, IEEE Transactions on Automatic Control 44 (1999), no. 2, 376–379.
J. Fu, C.M. Lagoa, and A. Ray, Robust optimal control of regular languages with event cost uncertainties, Proceedings of IEEE Conference on Decision and Control, December 2003, pp. 3209–3214.
J. Fu, A. Ray, and C.M. Lagoa, Optimal control of regular languages with event disabling cost, Proceedings of American Control Conference, Denver, Colorado, June 2003, pp. 1691–1695.
J. Fu, A. Ray, and C.M. Lagoa, Unconstrained optimal control of regular languages, Automatica 40 (2004), no. 4, 639–648.
R. Kumar and V. Garg, Optimal supervisory control of discrete event dynamical systems, SIAM J. Control and Optimization 33 (1995), no. 2, 419–439.
F. Lin, Robust and adaptive supervisory control of discrete event systems, IEEE Transactions on Automatic Control 38 (1993), no. 12, 1848–1852.
A.W. Naylor and G.R. Sell, Linear operator theory in engineering and science, Springer-Verlag, 1982.
S.-J. Park and J.-T. Lim, Robust and nonblocking supervisory control of nondeterministic discrete event systems using trajectory models, IEEE Transactions on Automatic Control 47 (2002), no. 4, 655–658.
K. Passino and P. Antsaklis, On the optimal control of discrete event systems, Proceedings of 28th IEEE Decision and Control Conference, Tampa, Florida (1989), 2713–2718.
P.J. Ramadge and W.M. Wonham, Supervisory control of a class of discrete event processes, SIAM J. Control and Optimization 25 (1987), no. 1, 206–230.
A. Ray and S. Phoha, Signed real measure of regular languages for discrete-event automata, Int. J. Control 76 (2003), no. 18, 1800–1808.
R. Sengupta and S. Lafortune, An optimal control theory for discrete event systems, SIAM J. Control and Optimization 36 (1998), no. 2, 488–541.
A. Surana and A. Ray, Signed real measure of regular languages, Demonstratio Mathematica 37 (2004), no. 2, 485–503.
S. Takai, Design of robust supervisors for prefix-closed language specifications, Proceedings of the 38th IEEE Conference on Decision and Control, 1999, pp. 1725–1730.
X. Wang and A. Ray, A language measure for performance evaluation of discrete-event supervisory control systems, Applied Mathematical Modelling 28 (2004), no. 9, 817–833.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Lagoa, C., Fu, J., Ray, A. (2005). Robust Optimal Control of Regular Languages. In: Ray, A., Phoha, V.V., Phoha, S.P. (eds) Quantitative Measure for Discrete Event Supervisory Control. Springer, New York, NY. https://doi.org/10.1007/0-387-23903-0_3
Download citation
DOI: https://doi.org/10.1007/0-387-23903-0_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-02108-9
Online ISBN: 978-0-387-23903-3
eBook Packages: Computer ScienceComputer Science (R0)