Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)
DOI: 10.1109/cdc.2000.912900
|View full text |Cite
|
Sign up to set email alerts
|

Forward algorithms for optimal control of a class of hybrid systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…In the future, we need to develop a low-complexity, scalable algorithm for explicitly determining the optimal controls for each agent. Since each CHA is considered as a hybrid system, an optimal sample path can be decomposed into segments known as busy periods [13]. Each busy period can be decomposed into blocks defined by certain jobs known as critical jobs.…”
Section: Discussionmentioning
confidence: 99%
“…In the future, we need to develop a low-complexity, scalable algorithm for explicitly determining the optimal controls for each agent. Since each CHA is considered as a hybrid system, an optimal sample path can be decomposed into segments known as busy periods [13]. Each busy period can be decomposed into blocks defined by certain jobs known as critical jobs.…”
Section: Discussionmentioning
confidence: 99%