Abstract
Recently, a new language-based time-optimal control framework has been proposed. We adopt that new framework in this paper and address the finite-makespan controller synthesis problem. A polynomial-time algorithm is proposed to solve the problem. In order to determine the potential difference between the attained finite makespan and the expected minimum makespan for the sake of evaluating the performance of a synthesized finite-makespan controller, we provide another polynomial-time algorithm to compute a strictly lower bound of the minimum makespan so that explicitly computing the minimum makespan can be avoid, as the latter turns out to be NP-hard. Experimental results are provided to show the effectiveness of our algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
