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...
Saved in:
Main Author: | Su, Rong. |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/84659 http://hdl.handle.net/10220/12502 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
Similar Items
-
A greedy, deterministic sampling-based path planning algorithm for AGV
by: Liu, Zhenqi
Published: (2024) -
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
by: Fatih Tasgetiren, M., et al.
Published: (2013) -
Group greedy method for sensor placement
by: Jiang, Chaoyang, et al.
Published: (2021) -
Greedy integration based multi-frame detection algorithm in radar systems
by: Li, Wujun, et al.
Published: (2023) -
Learning and extending sublanguages
by: Jain, S., et al.
Published: (2013)