Journal of Intelligent & Robotic Systems

, Volume 74, Issue 1–2, pp 479–498 | Cite as

On the Concerted Design and Scheduling of Multiple Resources for Persistent UAV Operations

Article
First Online:
Received:
Accepted:

Abstract

A fleet of unmanned aerial vehicles (UAVs) supported by logistics infrastructure, such as automated service stations, may be capable of long-term persistent operations. Typically, two key stages in the deployment of such a system are resource selection and scheduling. Here, we endeavor to conduct both of these phases in concert for persistent UAV operations. We develop a mixed integer linear program (MILP) to formally describe this joint design and scheduling problem. The MILP allows UAVs to replenish their energy resources, and then return to service, using any of a number of candidate service station locations distributed throughout the field. The UAVs provide service to known deterministic customer space-time trajectories. There may be many of these customer missions occurring simultaneously in the time horizon. A customer mission may be served by several UAVs, each of which prosecutes a different segment of the customer mission. Multiple tasks may be conducted by each UAV between visits to the service stations. The MILP jointly determines the number and locations of resources (design) and their schedules to provide service to the customers. We address the computational complexity of the MILP formulation via two methods. We develop a branch and bound algorithm that guarantees an optimal solution and is faster than solving the MILP directly via CPLEX. This method exploits numerous properties of the problem to reduce the search space. We also develop a modified receding horizon task assignment heuristic that includes the design problem (RHTAd). This method may not find an optimal solution, but can find feasible solutions to problems for which the other methods fail. Numerical experiments are conducted to assess the performance of the RHTAd and branch and bound methods relative to the MILP solved via CPLEX. For the experiments conducted, the branch and bound algorithm and RHTAd are about 500 and 25,000 times faster than the MILP solved via CPLEX, respectively. While the branch and bound algorithm obtains the same optimal value as CPLEX, RHTA d sacrifices about 5.5 % optimality on average.

Keywords

Persistent UAV service Concerted design and scheduling Replenishment stations Branch and bound algorithms UAV scheduling for persistence 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kemper Filho, P., Suzuki, K.A.O., Morrison, J.R.: UAV consumable replenishment: design concepts for automated service stations. J. Intell. Robot. Syst. 61(1), 369–397 (2011)CrossRefGoogle Scholar
  2. 2.
    Suzuki, K.A.O., Kemper Filho, P., Morrison, J.R.: Automatic battery replacement system for UAVs: analysis and design. J. Intell. Robot. Syst. 65(1), 563–586 (2012)CrossRefGoogle Scholar
  3. 3.
    Valenti, M., Dale, D., How, J., Vian, J.: Mission health management for 24/7 persistent surveillance operations. In: AIAA Guidance, Control and Navigation Conference, Myrtle Beach, SC (2007)Google Scholar
  4. 4.
    Godzdanker, R., Rutherford, M.J., Valavanis, K.P.: ISLANDS: a self-leveling landing platform for autonomous miniature UAVs. In: 2011 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM2011), pp. 170–175. Budapest, Hungary, 3–7 July 2011Google Scholar
  5. 5.
    Godzdanker, R., Rutherford, M.J., Valavanis, K.P.: Improving endurance of autonomous aerial vehicles through intelligent service-station placement. In: 2012 IEEE International Conference on Robotics and Automation, RiverCentre, pp. 3179–3184. Saint Paul, Minnesota, USA, 14–18 May 2012Google Scholar
  6. 6.
    Ji, M., Xia, J.: Analysis of vehicle requirements in a general automated guided vehicle system based transportation system. Comput. Ind. Eng. 59(12), 544–551 (2010)CrossRefGoogle Scholar
  7. 7.
    Shima, T., Schumacher, C.: Assignment of cooperating UAVs to simultaneous tasks using genetic algorithm. In: Proc. AIAA Guidance, Navigation, and Control Conference and Exhibit. San Francisco (2005). Paper no. AIAA-2005-5829Google Scholar
  8. 8.
    Zeng, J., Yang, X., Yang, L., Shen, G.: Modeling for UAV resource scheduling under mission synchronization. J. Syst. Eng. Electron. 21(13), 821–826 (2010)Google Scholar
  9. 9.
    Weinstein, A.L., Schumacher, C.: UAV scheduling via the vehicle routing problem with time windows. In: Proc. AIAA Infotech@Aerospace 2007 Conference and Exhibit. Rohnert Park, California (2007). Paper no. AIAA-2007-2839Google Scholar
  10. 10.
    Kim, Y.S., Gu, D.W., Postlethwaite, I.: Real-time optimal mission scheduling and flight path selection. IEEE Trans. Autom. Control 52(14), 1119–1123 (2007)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Alidaee, B., Wang, H., Landram, F.: A note on integer programming formulations of the real-time optimal scheduling and flight selection of UAVS. IEEE Trans. Control Syst. Technol. 17(12), 839–843 (2009)CrossRefGoogle Scholar
  12. 12.
    Shetty, V.K., Sudit, M., Nagi, R.: Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles. Comput. Oper. Res. 35, 1813–1828 (2008)CrossRefMATHGoogle Scholar
  13. 13.
    Alidaee, B., Wang, H., Landram, F.: On the flexible demand assignment problems: case of unmanned aerial vehicles. IEEE Trans. Automation Sci. Eng. 8(12), 865–868 (2011)CrossRefGoogle Scholar
  14. 14.
    Bethke, B., Valenti, M., How, J.: UAV task assignment. Robot. Autom. Mag. 15(6), 39–44 (2008)CrossRefGoogle Scholar
  15. 15.
    Nigam, N., Bieniawski, S., Kroo, I., Vian, J.: Control of multiple UAVs for persistent surveillance: algorithm and flight test results. IEEE Trans. Control Syst. Technol. 20(13), 1236–1251 (2012)CrossRefGoogle Scholar
  16. 16.
    Kim, J., Song, B., Morrison, J.R.: On the scheduling of systems of heterogeneous UAVs and fuel service stations for long-term mission fulfillment. J. Intell. Robot. Syst. 70(1), 347–359 (2013)CrossRefGoogle Scholar
  17. 17.
    Song, B., Kim, J., Kim, J., Park, H., Morrison, J.R.: Persistent UAV service: an improved scheduling formulation and prototypes of system components. In: Proc. 2013 International Conference on Unmanned Aircraft Systems (ICUAS), pp. 915–925. Atlanta, GA, 28–31 May 2013Google Scholar
  18. 18.
    Alighanbari, M.: Task assignment algorithms for team of UAVs in dynamic environments. Master Thesis, Massachusetts Institute of Technology (2004)Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Department of Industrial and Systems Engineering KAISTYuseong-guRepublic of Korea

Personalised recommendations