RT Journal Article
ID 0be5830e346a775e
A1 Chentsov, Alexey A.
A1 Chentsov, Alexander G.
T1 Routing of the Step-by-step Circuit of a Mobile Sets System Using Dynamic Programming under Conditions of Bellman's Function Inexact Computation
JF Journal of Automation and Information Sciences
JO JAI(S)
YR 1999
FD 1999-10-01
VO 31
IS 7-9
SP 82
OP 92
K1 route optimization
K1 step-by-step circuit
K1 extreme
K1 mobile discrete structures
K1 the estimations of deviations
K1 Dynamical Programming
K1 Bellman function
K1 mathematical simulations
K1 the modes of operation
K1 the traveling sales agent problem
K1 neuronets
AB 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.
PB Begell House
LK http://dl.begellhouse.com/journals/2b6239406278e43e,69fb601f3b58afbf,0be5830e346a775e.html