Projection-based iterative mode scheduling for switched systems

From MaRDI portal
Publication:286059

DOI10.1016/J.NAHS.2015.11.002zbMATH Open1342.90034arXiv1709.02405OpenAlexW2322278952MaRDI QIDQ286059FDOQ286059


Authors: T. M. Caldwell, T. D. Murphey Edit this on Wikidata


Publication date: 19 May 2016

Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)

Abstract: This paper describes a method for scheduling the events of a switched system to achieve an optimal performance. The approach has guarantees on convergence and computational complexity that parallel derivative-based iterative optimization but in the infinite dimensional, integer constrained setting of mode scheduling. In comparison to methods relying on mixed integer programming, the presented approach does not require a priori discretizations of time or state. Furthermore, in comparison to embedding and relaxation methods, every iteration of the algorithm returns a dynamically feasible solution. A large class of problems call for optimal mode scheduling. This paper considers a vehicle tracking problem and a high dimensional multimachine power network synchronization problem. For the power network example, both single horizon and receding horizon approaches prevent instability of the network, and the receding horizon approach does so at near real-time speeds on a single processor.


Full work available at URL: https://arxiv.org/abs/1709.02405




Recommendations




Cites Work


Cited In (9)

Uses Software





This page was built for publication: Projection-based iterative mode scheduling for switched systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286059)