A greedy algorithm for computing finite-makespan controllable sublanguages

@article{Su2012AGA,
  title={A greedy algorithm for computing finite-makespan controllable sublanguages},
  author={Rong Su},
  journal={2012 IEEE 51st IEEE Conference on Decision and Control (CDC)},
  year={2012},
  pages={7360-7365}
}
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 minimum-makespan controllable sublanguage has been provided. But it has been shown that computing such a minimum-makespan controllable sublanguage is NP-hard. To avoid this complexity issue, we present a… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…