1992
DOI: 10.1109/9.182478
|View full text |Cite
|
Sign up to set email alerts
|

Limited lookahead policies in supervisory control of discrete event systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
98
0

Year Published

1997
1997
2010
2010

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 164 publications
(98 citation statements)
references
References 25 publications
0
98
0
Order By: Relevance
“…In its simplest form, this can be achieved by taking the reachable part of synchronous product of the plant and speci…cation, P k S. Then, by ensuring that only strings that can carry the system to the LL horizon remain in L(P k S), we are left with a nonblocking controller. This problem was studied extensively by (Chung et al 1992). …”
Section: Controlmentioning
confidence: 99%
See 1 more Smart Citation
“…In its simplest form, this can be achieved by taking the reachable part of synchronous product of the plant and speci…cation, P k S. Then, by ensuring that only strings that can carry the system to the LL horizon remain in L(P k S), we are left with a nonblocking controller. This problem was studied extensively by (Chung et al 1992). …”
Section: Controlmentioning
confidence: 99%
“…Limited lookahead (LL) supervisory control has been extensively studied in a DES setting by (Chung et al 1992). In (Raisch and O'Young 1998), discrete abstractions based on the truncated time history of discrete-time LTI continuous models were used to synthesize DES supervisory controllers.…”
Section: Introductionmentioning
confidence: 99%
“…The FSM-based scheme provides us with a simple, yet structured, approach to effectively model the race rules/constraints and behaviors/tactics, as opposed to the conventional rule-based approaches or behavior-based approaches (Arkin, 1998). This scheme allows us to leverage existing supervisory control theories and techniques (Cassandras & Lafortune, 1999;Chen & Lin, 2001b;Chung, Lafortune, & Lin, 1992;Ramadge & Wonham, 1987) to generate safe and optimized behaviors for the vehicle.…”
Section: Behavioral Modes and Supervisionmentioning
confidence: 99%
“…26]). If P is not trim, then we c a n obtain trim(P) b y computing its largest accessible and coaccessible component, much i n t h e same way as in the deterministic case 3 . We n o w specify a subset Q b Q of forbidden states that the system is not allowed to visit.…”
Section: Marked Trajectories and Nonblocking Supervisorsmentioning
confidence: 99%