Numerical construction of viable sets for autonomous conflict control systems (Q401964): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
Summary: A conflict control system with state constraints is under consideration. A method for finding viability kernels (the largest subsets of state constraints where the system can be confined) is proposed. The method is related to differential games theory essentially developed by N. N. Krasovskii and A. I. Subbotin. The viability kernel is constructed as the limit of sets generated by a Pontryagin-like backward procedure. This method is implemented in the framework of a level set technique based on the computation of limiting viscosity solutions of an appropriate Hamilton-Jacobi equation. To achieve this, the authors adapt their numerical methods formerly developed for solving time-dependent Hamilton-Jacobi equations arising from problems with state constraints. Examples of computing viability sets are given.
Property / review text: Summary: A conflict control system with state constraints is under consideration. A method for finding viability kernels (the largest subsets of state constraints where the system can be confined) is proposed. The method is related to differential games theory essentially developed by N. N. Krasovskii and A. I. Subbotin. The viability kernel is constructed as the limit of sets generated by a Pontryagin-like backward procedure. This method is implemented in the framework of a level set technique based on the computation of limiting viscosity solutions of an appropriate Hamilton-Jacobi equation. To achieve this, the authors adapt their numerical methods formerly developed for solving time-dependent Hamilton-Jacobi equations arising from problems with state constraints. Examples of computing viability sets are given. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 49N70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A23 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 34H15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 34H05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 93C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 49L20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 49L25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6334886 / rank
 
Normal rank
Property / zbMATH Keywords
 
differential game
Property / zbMATH Keywords: differential game / rank
 
Normal rank
Property / zbMATH Keywords
 
state constraint
Property / zbMATH Keywords: state constraint / rank
 
Normal rank
Property / zbMATH Keywords
 
viability kernel
Property / zbMATH Keywords: viability kernel / rank
 
Normal rank
Property / zbMATH Keywords
 
backward procedure
Property / zbMATH Keywords: backward procedure / rank
 
Normal rank
Property / zbMATH Keywords
 
value function
Property / zbMATH Keywords: value function / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamilton-Jacobi equation
Property / zbMATH Keywords: Hamilton-Jacobi equation / rank
 
Normal rank

Revision as of 16:35, 29 June 2023

scientific article
Language Label Description Also known as
English
Numerical construction of viable sets for autonomous conflict control systems
scientific article

    Statements

    Numerical construction of viable sets for autonomous conflict control systems (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2014
    0 references
    Summary: A conflict control system with state constraints is under consideration. A method for finding viability kernels (the largest subsets of state constraints where the system can be confined) is proposed. The method is related to differential games theory essentially developed by N. N. Krasovskii and A. I. Subbotin. The viability kernel is constructed as the limit of sets generated by a Pontryagin-like backward procedure. This method is implemented in the framework of a level set technique based on the computation of limiting viscosity solutions of an appropriate Hamilton-Jacobi equation. To achieve this, the authors adapt their numerical methods formerly developed for solving time-dependent Hamilton-Jacobi equations arising from problems with state constraints. Examples of computing viability sets are given.
    0 references
    differential game
    0 references
    state constraint
    0 references
    viability kernel
    0 references
    backward procedure
    0 references
    value function
    0 references
    Hamilton-Jacobi equation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references