Task allocation of multiple unmanned aerial vehicles (multi-UAVs) is a typical NP-hard problem. In this paper, according to practical battlefield needs, mathematical model is constructed based on complex constrains of task allocation, and objective function is constructed based on multi-UAVs’ global voyage and task time. An improved strategy of particle position based on basic Particle Swarm Optimization (PSO) algorithm is applied to the problem, and reasonable allocation schemes are obtained. The allocation schemes meet the complex constrains including task sequence, time window, UAVs’ capacities and flight path, and can be chosen and adjusted flexibly by the decision maker according to the practical battlefield needs. A large number of simulation experiments show that improved PSO algorithm is effective and provides a reference for multi-UAVs’ task allocation problem with complex constrains and multi-objectives.
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.