Advertisement

Evolving a Pareto Front for an Optimal Bi-objective Robust Interception Problem with Imperfect Information

  • Gideon Avigad
  • Erella Eisenstadt
  • Valery Y. Glizer
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 175)

Abstract

In this paper, a multi-objective optimal interception problem with imperfect information is solved by using a Multi-Objective Evolutionary Algorithm (MOEA). The traditional setting of the interception problem is aimed either at minimizing a miss distance for a given interception duration or at minimizing an interception time for a given miss distance. In contrast with such a setting, here the problem is posed as a simultaneous search for both objectives. Moreover, it is assumed that the interceptor has imperfect information on the target. This problem can be considered as a game between the interceptor, who is aiming at a minimum final distance between himself and the target at a minimal final time, and an artificial opponent aiming at maximizing these values. The artificial opponent represents the effect of the interceptor’s imperfect information (measurement inaccuracies) on the success of the interception. Both players utilize neural net controllers that evolve during the evolutionary optimization. This study is the first attempt to utilize evolutionary multi-objective optimization for solving multi-objective differential games, and as far as our review went, the first attempt to solve multi-objective differential games in general.

Keywords

Pareto Front Ideal Point Differential Game Objective Space Imperfect Information 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Glizer, V.Y., Shinar, J.: On the Structure of a Class of Time Optimal Trajectories. Optimal Control Applications & Methods 14, 271–279 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Laumanns, M., Thiele, L., Zitzler, E., Welzl, E., Deb, K.: Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 44–53. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Zelikovsky, A., Dmitrii, L., Solomon, D.: Multiobjective games and determining Pareto-Nash equilibria. Buletinul Academiei De Stiinte, A Republicii Moldova Matematica (3), 115–122 (2005)Google Scholar
  4. 4.
    Somasundaram, K., Baras, J.S.: Pareto Nash Replies for Multi-Objective Games. The Institute for Systems Research ISR technical report 2009-4 (2009)Google Scholar
  5. 5.
    Zeleny, M.: Games with multiple payoffs. International Journal of Game Theory 4(4), 179–191 (1975)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Contini, B.M.: A decision model under uncertainty with multiple payoffs. In: Mensch, A. (ed.) Theory of Games; Techniques and Applications, pp. 50–63. American Elsevier Pub. Co. (1966)Google Scholar
  7. 7.
    Susan, X.L.: Interactive strategy sets in multiple payoff games. Computers & Industrial Engineering 37(3), 613–630 (1999)CrossRefGoogle Scholar
  8. 8.
    Sakawa, M.: Genetic Algorithms and Fuzzy Multiobjective Optimization. Kluwer Academic Publishers, Boston (2002)zbMATHGoogle Scholar
  9. 9.
    Avigad, G., Eisenstadt, E., Weiss, M.: Optimal Strategies for Multi Objective Games and Their Search by Evolutionary Multi Objective Optimization. In: Proceedings of the Conference on Computational Intelligence in Games (CIG 2011), Seoul, South Korea, August 31-September 4 (2011) ISBN: 978-14577-0009-5Google Scholar
  10. 10.
    Avigad, G., Branke, J.: Embedded Evolutionary Multi-Objective Optimization for Worst Case Robustness. In: 2008 Genetic and Evolutionary Computation Conference (GECCO 2008), pp. 617–624. ACM Press, USA (2008) ISBN 978-1-60558-131-6CrossRefGoogle Scholar
  11. 11.
    Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Gideon Avigad
    • 1
  • Erella Eisenstadt
    • 1
  • Valery Y. Glizer
    • 1
  1. 1.Department of Mechanical EngineeringOrt Braude CollegeKarmielIsrael

Personalised recommendations