The optimal control problem for switched linear systems with internally forced switching has more constraints than with
externally forced switching. Heavy computations and slow convergence in solving this problem is a major obstacle. In
this paper we describe a new approach for solving this problem, which is called Migrant Particle Swarm Optimization
(Migrant PSO). Imitating the behavior of a flock of migrant birds, the Migrant PSO applies naturally to both continuous
and discrete spaces, in which definitive optimization algorithm and stochastic search method are combined. The efficacy
of the proposed algorithm is illustrated via a numerical example.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.