Summary
This chapter presents optimal discrete-event supervisory control of robot behavior in terms of the language measure μ, presented in Chapter 1. In the discrete-event setting, a robot’s behavior is modelled as a regular language that can be realized by deterministic finite state automata (DFSA). The controlled sublanguage of a DFSA plant model could be different under different supervisors that are constrained to satisfy different specifications [6]. Such a partially ordered set of sublanguages requires a quantitative measure for total ordering of their respective performance. The language measure [10] [8] serves as a common quantitative tool to compare the performance of different supervisors and is assigned an event cost matrix, known as the \( \tilde \Pi\)-matrix and a state characteristic vector, X-vector. Event costs (i.e., elements of the \( \tilde \Pi\)-matrix) are based on the plant states, where they are generated; on the other hand, the X-vector is chosen based on the designer’s perception of the individual state’s impact on the system performance. The elements of the \( \tilde \Pi\)-matrix are conceptually similar to the probabilities of the respective events conditioned on specific states; these parameters can be identified either from experimental data or from the results of extensive simulation, as they are dependent on physical phenomena related to the plant behavior. Since the plant behavior is often slowly time-varying, there is a need for on-line parameter identification to generate up-to-date values of the \( \tilde \Pi\)-matrix within allowable bounds of errors. The results of simulation experiments on a robotic test bed are presented to demonstrate efficacy of the proposed optimal control policy.
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
R. C. Arkin, Behavior-based robotics, MIT Press, 1998.
J. Fu, A. Ray, and C.M. Lagoa, Unconstrained optimal control of regular languages, Automatica 40 (2004), no. 4, 639–648.
S. Mahadevan and J. Connell, Automatic programming of behavior-based robots using reinforcement learning, Proceedings of AAAI-91, 1991, pp. 768–773.
E. Martinson, A. Stoytchev, and R. C. Arkin, Robot behavioral selection using q-learning, IEEE International Conference on Robots and Systems (Lausanne), September 2002.
M. Pradhan and P. Dagum, Optimal monte carlo estimation of belief network inference, Twelfth Conference on Uncertainty in Artificial Intelligence (Portland, OR), 1996, pp. 446–453.
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.
A. Surana and A. Ray, Signed real measure of regular languages, Demonstratio Mathematica 37 (2004), no. 2, 485–503.
X. Wang, Quantitative measure of regular languages for supervisory control of engineering applications, Ph.D. thesis, The Pennsylvania State University, December 2003.
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.
C.J.C.H. Watkins, Learning from delayed rewards, Ph.D. thesis, King’s College, Cambridge, UK, 1989.
C.J.C.H. Watkins and P. Dayan, Q-learning, Machine Learning 8 (1992), no. 3, 279–292.
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
Wang, X., Ray, A., Lee, P., Fu, J. (2005). Optimal Control of Robot Behavior Using Language Measure. 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_6
Download citation
DOI: https://doi.org/10.1007/0-387-23903-0_6
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)