A. A. Mel'Nikova
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
A. A. Mel'Nikova has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Pavel A. Tochilin
Faculty of Computational Mathematics and Cybernetics, Lomonosov Moscow State University, Moscow, Russia
4 shared publications - Alexander N. Daryin
Lomonosov Moscow State University
2 shared publications Дарьин А. Н
Московский государственный университет имени М.В. Ломоносова
1 shared publication
Latest Publications
- 15 November 2024
- Published by The Russian Academy of Sciences in Дифференциальные уравнения
- Vol. 60 (11) , 1484-1498
ON THE PROPERTIES OF THE SOLVABILITY SET FOR A LINEAR SYSTEM WITH UNCERTAINTY
The work is devoted to the problem of verifying that the state of a linear controlled system of differential equations will hit the target set over a finite time interval, despite the uncertainties (noise). Some geometric, pointwise convex constraints on uncertainties are imposed. In the case of a two-dimensional state space a method is proposed for constructing a solvability set without the calculation of the convex hulls of the functions necessary to construct a support function of the geometric difference of the sets. A Hamilton–Jacobi–Bellman type equation is obtained, which is satisfied by the distance function to the solvability set.
- 15 November 2024
- Published by The Russian Academy of Sciences in Дифференциальные уравнения
- Vol. 60 (11) , 1484-1498
ON THE PROPERTIES OF THE SOLVABILITY SET FOR A LINEAR SYSTEM WITH UNCERTAINTY
The work is devoted to the problem of verifying that the state of a linear controlled system of differential equations will hit the target set over a finite time interval, despite the uncertainties (noise). Some geometric, pointwise convex constraints on uncertainties are imposed. In the case of a two-dimensional state space a method is proposed for constructing a solvability set without the calculation of the convex hulls of the functions necessary to construct a support function of the geometric difference of the sets. A Hamilton–Jacobi–Bellman type equation is obtained, which is satisfied by the distance function to the solvability set.
- 1 November 2024
- Published by Pleiades Publishing Ltd in Differential Equations
- Vol. 60 (11) , 1557-1571
On the Properties of the Solvability Set for a Linear System with Uncertainty
The work is devoted to the problem of verifying the fact that the state of a linear controlled system of differential equations hits the target set over a finite time interval despite the uncertainty (noise). Some geometric, pointwise convex constraints on uncertainties are imposed. In the case of a two-dimensional state space a method is proposed for constructing the solvability set without the calculation of the convex hulls of the functions necessary to construct a support function of the geometric difference of the sets. A Hamilton–Jacobi–Bellman type equation is obtained that is satisfied by the distance function to the solvability set.
- 1 November 2024
- Published by Pleiades Publishing Ltd in Differential Equations
- Vol. 60 (11) , 1557-1571
On the Properties of the Solvability Set for a Linear System with Uncertainty
The work is devoted to the problem of verifying the fact that the state of a linear controlled system of differential equations hits the target set over a finite time interval despite the uncertainty (noise). Some geometric, pointwise convex constraints on uncertainties are imposed. In the case of a two-dimensional state space a method is proposed for constructing the solvability set without the calculation of the convex hulls of the functions necessary to construct a support function of the geometric difference of the sets. A Hamilton–Jacobi–Bellman type equation is obtained that is satisfied by the distance function to the solvability set.
- 15 November 2023
- Published by The Russian Academy of Sciences in Дифференциальные уравнения
- Vol. 59 (11) , 1533-1540
On a Problem of Calculating the Solvability Set for a Linear System with Uncertainty
We consider a linear-convex control system defined by a set of differential equations with continuous matrix coefficients. The system may have control parameters, as well as uncertainties (interference) the possible values of which are subject to strict pointwise constraints. For this system, over a finite period of time, taking into account the constraints, we study the problem of guaranteed hitting the target set from a given initial position despite the effect of uncertainty. The main stage of solving the problem is the construction of an alternating integral and a solvability set. To construct the latter, the greatest computational complexity is the calculation of the geometric difference between the target set and the set determined by the uncertainty. A two-dimensional example of this problem is considered for which a method is proposed for finding the solvability set without the need to calculate the convex hull of the difference of the support functions of the sets.
- 15 November 2023
- Published by The Russian Academy of Sciences in Дифференциальные уравнения
- Vol. 59 (11) , 1533-1540
On a Problem of Calculating the Solvability Set for a Linear System with Uncertainty
We consider a linear-convex control system defined by a set of differential equations with continuous matrix coefficients. The system may have control parameters, as well as uncertainties (interference) the possible values of which are subject to strict pointwise constraints. For this system, over a finite period of time, taking into account the constraints, we study the problem of guaranteed hitting the target set from a given initial position despite the effect of uncertainty. The main stage of solving the problem is the construction of an alternating integral and a solvability set. To construct the latter, the greatest computational complexity is the calculation of the geometric difference between the target set and the set determined by the uncertainty. A two-dimensional example of this problem is considered for which a method is proposed for finding the solvability set without the need to calculate the convex hull of the difference of the support functions of the sets.
- 1 November 2023
- Published by Pleiades Publishing Ltd in Differential Equations
- Vol. 59 (11) , 1538-1546
On a Problem of Calculating the Solvability Set for a Linear System with Uncertainty
We consider a linear-convex control system defined by a set of differential equations with continuous matrix coefficients. The system may have control parameters, as well as uncertainties (interference) the possible values of which are subject to strict pointwise constraints. For this system, over a finite period of time, taking into account the constraints, we study the problem of guaranteed hitting the target set from a given initial position despite the effect of uncertainty. The main stage of solving the problem is the construction of an alternating integral and a solvability set. To construct the latter, the greatest computational complexity is the calculation of the geometric difference between the target set and the set determined by the uncertainty. A two-dimensional example of this problem is considered for which a method is proposed for finding the solvability set without the need to calculate the convex hull of the difference of the support functions of the sets.
- 1 November 2023
- Published by Pleiades Publishing Ltd in Differential Equations
- Vol. 59 (11) , 1538-1546
On a Problem of Calculating the Solvability Set for a Linear System with Uncertainty
We consider a linear-convex control system defined by a set of differential equations with continuous matrix coefficients. The system may have control parameters, as well as uncertainties (interference) the possible values of which are subject to strict pointwise constraints. For this system, over a finite period of time, taking into account the constraints, we study the problem of guaranteed hitting the target set from a given initial position despite the effect of uncertainty. The main stage of solving the problem is the construction of an alternating integral and a solvability set. To construct the latter, the greatest computational complexity is the calculation of the geometric difference between the target set and the set determined by the uncertainty. A two-dimensional example of this problem is considered for which a method is proposed for finding the solvability set without the need to calculate the convex hull of the difference of the support functions of the sets.