Journal of Automation and Information Sciences
Выходит 12 номеров в год
ISSN Печать: 1064-2315
ISSN Онлайн: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
Routing of the Step-by-step Circuit of a Mobile Sets System Using Dynamic Programming under Conditions of Bellman's Function Inexact Computation
Том 31,
Выпуск 7-9, 1999,
pp. 82-92
DOI: 10.1615/JAutomatInfScien.v31.i7-9.310
Краткое описание
The problem of route optimization is considered. The problem is connected with the investigation of the step-by-step circuit of sets under the conditions of possible multivariant transfers from one set to another. It is assumed the case when the goal sets are realized in the making "trajectory". The estimations are found which determine the influence of errors of the computation of the Bellman function on the result and development of a route problem.
475 Просмотры статей
2 Загрузка статей
Метрики
Статьи с похожим содержанием:
Последний выпуск
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020