Search algorithms for procedural optimal control


This paper studies a generalized structure of the state traversal algorithms and the methods of their adaptation to procedural optimal control of the multidimensional dynamic systems. Based on the developed structure, new special scoring functions, the methods of vector encoding control and state space discretization are proposed. Furthermore, through the test problem solved the capability of such algorithms to solve the optimal control problems, as well as the improved efficiency over the existing algorithms, is demonstrated.

Publication year: 
С. 7–14, укр., Іл. 8. Табл. 2. Бібліогр.: 5 назв.

1. Dijkstra E. W. A note on two problems in connexion with graphs. – Numerische Mathematik. – 1959. – N1. – P. 269–271.
2. Nilsson N.J. Problem solving methods in artificial intelligence. – McGraw Hill, 1971. – 225 р.
3. Koenig S., Likhachev M. Real-Time Adaptive A* // Proc. of the Intern. Joint Conf. on Autonomous Agents and Multiagent Systems (AAMAS). – 2006. – P. 281–288.
4. Pinch E.R. Optimal Control and the Calculus of Variations. – Oxford: University Press, 1993. – 240 р.
5. Apostolyuk V. Application of State-Space Search Algorithms to Optimal Control // Proc. of VI Intl. Conf. on Gyro Technology, Navigation, and Motion Control. – K., 2007. – Vol. 2. – P. 104–110.

2008-2-2.pdf176.64 KB

Тематичні розділи журналу