A greedy algorithm for computing finite-makespan controllable sublanguages
The Ramadge-Wonham supervisory control paradigm has been shown effective in dealing with logic control. Nevertheless, time-related performance is always one of the major concerns in industry. Recently, a new time optimal control framework has been proposed, and an algorithm for synthesizing a minimu...
Main Author: | |
---|---|
Other Authors: | |
Format: | Conference Paper |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/84659 http://hdl.handle.net/10220/12502 |