DocumentCode
3249130
Title
On exploiting algebraic structure in control of finite state machines
Author
Tarraf, Danielle C.
Author_Institution
Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD, USA
fYear
2013
fDate
2-4 Oct. 2013
Firstpage
962
Lastpage
965
Abstract
We consider finite state machines whose states evolve in a vector space defined over a finite field, and whose dynamics are linear time-invariant. For this class of systems, we show how the linear structure may be exploited to reduce the complexity of solving a class of finite horizon optimal control problems.
Keywords
computational complexity; finite state machines; optimal control; vectors; algebraic structure; class complexity; finite horizon optimal control problems; finite state machine control; linear structure; linear time-invariant dynamics; vector space; Approximation methods; Automata; Complexity theory; Cost function; Supervisory control; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton Conference on
Conference_Location
Monticello, IL
Print_ISBN
978-1-4799-3409-6
Type
conf
DOI
10.1109/Allerton.2013.6736629
Filename
6736629
Link To Document