The programmed iterations method in a game problem of guidance
    
    
  
  
  
      
      
      
        
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 26 (2016) no. 2, pp. 271-282
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			The solution of a differential game of guidance–evasion on the basis of the programmed iterations method is considered. The basic goal consists in the construction of a set of positional absorption corresponding to alternative partition following from the fundamental alternative theorem of N. N. Krasovskii and A. I. Subbotin. For construction, an operator of programmed absorption defined by the target set in a guidance problem is used. The set defining phase constraints is gradually transformed by the above-mentioned operator; therefore, the sequence for which the corresponding limit coincides with the set of positional absorption is realized. It is assumed that the target set is closed and the set defining phase constraints of initial problem has closed sections corresponding to fixation of time. Properties having the sense of one-sided continuity of the positional absorption set under variation of sets defining initial differential game are established. It is shown that the limit of iterated procedure coincides with the set of successful solvability in a class of set-valued generalized quasistrategies.
			
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Keywords: 
differential game, programmed iterations method, set of positional absorption.
                    
                  
                
                
                @article{VUU_2016_26_2_a12,
     author = {A. G. Chentsov},
     title = {The programmed iterations method in a game problem of guidance},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {271--282},
     publisher = {mathdoc},
     volume = {26},
     number = {2},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2016_26_2_a12/}
}
                      
                      
                    TY - JOUR AU - A. G. Chentsov TI - The programmed iterations method in a game problem of guidance JO - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki PY - 2016 SP - 271 EP - 282 VL - 26 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VUU_2016_26_2_a12/ LA - ru ID - VUU_2016_26_2_a12 ER -
%0 Journal Article %A A. G. Chentsov %T The programmed iterations method in a game problem of guidance %J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki %D 2016 %P 271-282 %V 26 %N 2 %I mathdoc %U http://geodesic.mathdoc.fr/item/VUU_2016_26_2_a12/ %G ru %F VUU_2016_26_2_a12
A. G. Chentsov. The programmed iterations method in a game problem of guidance. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 26 (2016) no. 2, pp. 271-282. http://geodesic.mathdoc.fr/item/VUU_2016_26_2_a12/
