Title :
A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore, Singapore
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.
Keywords :
computational complexity; control system synthesis; controllability; optimal control; NP-hard; finite-makespan controllable sublanguages; finite-makespan controller synthesis problem; language-based time-optimal control framework; polynomial-time algorithm; synthesized finite-makespan controller; Automata; Mathematical model; Routing; Time complexity; Trajectory; Vectors; Controllability; finite makespan; finite-state automata; time-weighted systems;
Journal_Title :
Automatic Control, IEEE Transactions on
DOI :
10.1109/TAC.2014.2342099