Computing the reachable set bounda for an abstract control system: revisited
    
    
  
  
  
      
      
      
        
Ural mathematical journal, Tome 9 (2023) no. 2, pp. 99-108
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			A  control system can be treated as a mapping that maps a control to a trajectory (output) of the system. From this point of view, the reachable set, which consists of the ends of all trajectories at a given time, can be considered an image of the set of admissible controls into the state space under a nonlinear mapping. The paper discusses some properties of such abstract reachable sets. The principal attention is paid to the description of the set boundary.
			
            
            
            
          
        
      
                  
                    
                    
                    
                        
Keywords: 
Reachable set, nonlinear mapping, control system, extremal problem, maximum principle.
                    
                    
                    
                  
                
                
                @article{UMJ_2023_9_2_a7,
     author = {Mikhail I. Gusev},
     title = {Computing the reachable set bounda for an abstract control system: revisited},
     journal = {Ural mathematical journal},
     pages = {99--108},
     publisher = {mathdoc},
     volume = {9},
     number = {2},
     year = {2023},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/UMJ_2023_9_2_a7/}
}
                      
                      
                    Mikhail I. Gusev. Computing the reachable set bounda for an abstract control system: revisited. Ural mathematical journal, Tome 9 (2023) no. 2, pp. 99-108. http://geodesic.mathdoc.fr/item/UMJ_2023_9_2_a7/