DocumentCode :
404422
Title :
Viability, the solution set, and fixed point approximation of hybrid systems
Author :
Labinaz, G. ; Guay, M.
Author_Institution :
Dept. of Electr. & Comput. Eng., Queen´´s Univ., Kingston, Ont., Canada
Volume :
1
fYear :
2003
fDate :
9-12 Dec. 2003
Firstpage :
646
Abstract :
This paper develops an approach for ensuring viability of hybrid systems under sampling. An algorithm based on the Fast Viability Kernel Algorithm for continuous-time viability is developed for hybrid systems with time independent constraint sets. The general existence of a fixed point for the algorithm is examined. The application of the algorithm to one control law class is carried out. His paper develops an approach for ensuring viability of hybrid systems under sampling. An algorithm based on the Fast Viability Kernel Algorithm for continuous-time viability is developed for hybrid systems with time independent constraint sets. The general existence of a fixed point for the algorithm is examined. The application of the algorithm to one control law class is carried out.
Keywords :
approximation theory; constraint theory; controllability; sampling methods; continuous time viability; controllability; fixed point approximation; hybrid systems; sampling; time independent constraint sets; viability kernel algorithm; Automata; Automated highways; Automatic control; Centralized control; Chemical processes; Control system synthesis; Control systems; Kernel; Sampling methods; Time factors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 2003. Proceedings. 42nd IEEE Conference on
ISSN :
0191-2216
Print_ISBN :
0-7803-7924-1
Type :
conf
DOI :
10.1109/CDC.2003.1272637
Filename :
1272637
Link To Document :
بازگشت