Scheduling System for Multiple Unmanned Aerial Vehicles in Indoor Environments Using the CSP Approach
In recent years there has been an increased demand in use of multiple unmanned aerial vehicles (UAVs) for surveillance and material handling tasks in indoor environments. However, only a limited number of studies have been reported on UAV scheduling in an indoor 3D environment. This paper presents the indoor UAV scheduling problem and models it as a constraint satisfaction problem (CSP) to find a feasible solution in less computation time. A numerical example of the problem is presented to illustrate the proposed methodology.
KeywordsUnmanned aerial vehicles Indoor UAV scheduling Constraint satisfaction problem
This work has partly been supported by Innovation Fund Denmark under project UAWorld; grant agreement number 9-2014-3.
- 1.Kim, J., Morrison, J.R.: On the concerted design and scheduling of multiple resources for persistent UAV operations. In: IEEE Proceedings of International Conference on Unmanned Aircraft Systems (ICUAS), pp. 942–951 (2013)Google Scholar
- 2.Baxter, J., Findlay, S., Paxton, M., Berry, A.: Scheduling UAV surveillance tasks, lessons learned from trials with users. In: IEEE Proceedings of International Conference on Systems, Man, and Cybernetics (SMC), pp. 2606–2610 (2013)Google Scholar
- 5.Shima, T., Schumacher, C.: Assignment of cooperating UAVs to simultaneous tasks using genetic algorithms. Defense Technical Information Center (2005)Google Scholar
- 7.Weinstein, A.L., Schumacher, C.: UAV scheduling via the vehicle routing problem with time windows. In: Proceedings of AIAA Infotech @ Aerospace Conference and Exhibit. Rohnert Park, California (2007)Google Scholar
- 10.Nielsen, I., Bocewicz, G., Do, N.A.D.: Production and resource scheduling in mass customization with dependent setup consideration. In: Brunoe, T.D., Nielsen, K., Joergensen, K.A., Taps, S.B. (eds.) Proceedings of the 7th World Conference on Mass Customization, Personalization, and Co-creation (MCPC 2014), pp. 461–472. Springer International Publishing, Aalborg, Denmark, Feb 4–7th 2014 (2014)Google Scholar
- 11.Fox, M.S., Sadeh, N.M.: Why is scheduling difficult? a CSP perspective. In: Proceedings of ECAI, pp. 754–767 (1990)Google Scholar
- 12.Bocewicz, G., Wójcik, R., Banaszak, Z.: Cyclic scheduling of multimodal concurrently flowing processes. Advances in Systems Science, pp. 587–598. Springer (2014)Google Scholar
- 16.Bocewicz, G., Wójcik, R., Banaszak, Z.A., Pawlewski, P.: Multimodal processes rescheduling: cyclic steady states space approach. Mathematical Problems in Engineering (2013)Google Scholar
- 19.Caseau, Y., Laburthe, F.: Improved CLP scheduling with task intervals. In: Proceedings of ICLP, pp. 369–383. Citeseer (1994)Google Scholar
- 20.Sadeh, N., Fox, M.: Preference propagation in temporal constraints graphs. Technical Report. Intelligent Systems Laboratory, The Robotics Institute, Carnegie-Mellon University Pittsburgh, PA (1988)Google Scholar