Branching to Find Feasible Solutions in Unmanned Air Vehicle Mission Planning
Mission Planning is a classical problem that has been traditionally studied in several cases from Robotics to Space missions. This kind of problems can be extremely difficult in real and dynamic scenarios. This paper provides a first analysis for mission planning to Unmanned Air Vehicles (UAVs), where sensors and other equipment of UAVs to perform a task are modelled based on Temporal Constraint Satisfaction Problems (TCSPs). In this model, a set of resources and temporal constraints are designed to represent the main characteristics (task time, fuel consumption, ...) of this kind of aircrafts. Using this simplified TCSP model, and a Branch and Bound (B&B) search algorithm, a set of feasible solutions will be found trying to minimize the fuel cost, flight time spent and the number of UAVs used in the mission. Finally, some experiments will be carried out to validate both the quality of the solutions found and the spent runtime to found them.
Keywordsunmanned aircraft systems mission planning temporal constraint satisfaction problems branch and bound
Unable to display preview. Download preview PDF.
- 1.Barták, R.: Constraint programming: In pursuit of the holy grail. In: Proceedings of the Week of Doctoral Students, pp. 555–564 (1999)Google Scholar
- 6.Gonzalez-Pardo, A., Camacho, D.: A new CSP graph-based representation for ant colony optimization. In: 2013 IEEE Conference on Evolutionary Computation (CEC 2013), vol. 1, pp. 689–696 (2013)Google Scholar
- 7.Kvarnström, J., Doherty, P.: Automated planning for collaborative UAV systems. In: Control Automation Robotics & Vision, pp. 1078–1085 (December 2010)Google Scholar
- 8.Leary, S., Deittert, M., Bookless, J.: Constrained UAV mission planning: A comparison of approaches. In: 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops), pp. 2002–2009 (November 2011)Google Scholar
- 9.Ramirez-Atencia, C., Bello-Orgaz, G., R-Moreno, M.D., Camacho, D.: A simple CSP-based model for Unmanned Air Vehicle Mission Planning. In: IEEE International Symposium on INnovations in Intelligent SysTems and Application (2014)Google Scholar
- 10.Rasmussen, S., Shima, T.: Branch and bound tree search for assigning cooperating uavs to multiple tasks. In: American Control Conference, pp. 6–14 (2006)Google Scholar
- 12.Rollon, E., Larrosa, J.: Multi-objective Russian doll search. In: Proceedings of the National Conference on Artificial Intelligence, vol. 22, p. 249. AAAI Press, MIT Press, Menlo Park, Cambridge (1999, 2007)Google Scholar
- 13.Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling and Programming with Gecode (2010), http://www.gecode.org/
- 14.Schumacher, C., Chandler, P., Pachter, M., Pachter, L.: UAV Task Assignment with Timing Constraints via Mixed-Integer Linear Programming. Tech. rep., DTIC Document (2004)Google Scholar
- 16.Torrens, M., Faltings, B.: Using Soft CSPs for Approximating Pareto-Optimal Solution Sets. In: AAAI Workshop Proceedings Preferences in AI and CP: Symbolic Approaches. AAAI Press (2002)Google Scholar