DocumentCode
1252056
Title
Searching for optimal trajectory with learning
Author
Khazen, Ellida M.
Volume
31
Issue
6
fYear
2001
fDate
11/1/2001 12:00:00 AM
Firstpage
767
Lastpage
774
Abstract
An algorithm of searching for the optimal trajectory with the minimal cost W(x) of reaching the final state xft n from the initial state x is presented. A system of ODEs is suggested to determine an optimal trajectory x*(t) and an optimal control u*(t). The trajectory x(t) and the control u(t) close to optimal ones are determined by successive approximations. The algorithm represents a development of a gradient method in the function space. Learning consists in estimation of an unknown a priori minimal cost W(x) and ∂W(x)/∂x on the basis of analysis of the trial trajectories x(t) obtained earlier
Keywords
differential equations; dynamic programming; gradient methods; learning (artificial intelligence); optimal control; path planning; position control; search problems; Bellman dynamic programming; gradient method; learning; minimal cost; optimal control; optimal trajectory; principal component analysis; Computational complexity; Control system analysis; Control systems; Cost function; Dynamic programming; Gradient methods; Multidimensional systems; Optimal control; Partial differential equations; Principal component analysis;
fLanguage
English
Journal_Title
Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on
Publisher
ieee
ISSN
1083-4427
Type
jour
DOI
10.1109/3468.983435
Filename
983435
Link To Document