Advertisement

Branching to Find Feasible Solutions in Unmanned Air Vehicle Mission Planning

  • Cristian Ramírez-Atencia
  • Gema Bello-Orgaz
  • Maria D. R-Moreno
  • David Camacho
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8669)

Abstract

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.

Keywords

unmanned aircraft systems mission planning temporal constraint satisfaction problems branch and bound 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Chiang, W.C., Russell, R.A.: Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research 63, 3–27 (1996)CrossRefzbMATHGoogle Scholar
  3. 3.
    Doherty, P., Kvarnström, J., Heintz, F.: A temporal logic-based planning and execution monitoring framework for Unmanned Aircraft Systems. Autonomous Agents and Multi-Agent Systems 19(3), 332–377 (2009)CrossRefGoogle Scholar
  4. 4.
    Fabiani, P., Fuertes, V., Piquereau, A., Mampey, R., Teichteil-Konigsbuch, F.: Autonomous flight and navigation of VTOL UAVs: from autonomy demonstrations to out-of-sight flights. Aerospace Science and Technology 11(2-3), 183–193 (2007)CrossRefGoogle Scholar
  5. 5.
    Fonseca, C., Fleming, P.: Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation. IEEE Transactions on Systems, Man and Cybernetics 28(1), 26–37 (1998)CrossRefGoogle Scholar
  6. 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. 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. 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. 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. 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
  11. 11.
    Rollon, E., Larrosa, J.: Bucket Elimination for Multiobjective optimization problems. Journal of Heuristics 12(4-5), 307–328 (2006)CrossRefzbMATHGoogle Scholar
  12. 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. 13.
    Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling and Programming with Gecode (2010), http://www.gecode.org/
  14. 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
  15. 15.
    Schwalb, E., Vila, L.: Temporal constraints: A survey. Constraints 3(2-3), 129–149 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 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

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Cristian Ramírez-Atencia
    • 1
  • Gema Bello-Orgaz
    • 1
  • Maria D. R-Moreno
    • 2
  • David Camacho
    • 1
  1. 1.Departamento de Ingeniería InformáticaUniversidad Autónoma de MadridMadridSpain
  2. 2.Departamento de AutomáticaUniversidad de AlcaláMadridSpain

Personalised recommendations