Particle swarm with domain partition and control assignment for time-optimal maneuvers
A novel approach has been proposed for planning time-optimal maneuvers imposing a bang–bang external control. The optimizer was based on the particle swarm optimization and only required setting the maximum number of switches allowed for each axis. Two different test cases were analyzed and solved to validate the optimizer. In the first example, characterized by four state-space variables and no path constraints, the convergence toward the optimal solution has been demonstrated with different values of the maximum number of switches.