Application of the interval explosion method

Аuthors

Panovskiy V. N.

Moscow Aviation Institute (National Research University), 4, Volokolamskoe shosse, Moscow, А-80, GSP-3, 125993, Russia

e-mail: panovskiy.v@gmail.com

Abstract

In the given work the interval explosion method, which was created by the author, for the solution of the problem of determination of optimum program control of the discrete and continuous dynamic systems is considered (the problems about spacecraft orientation and stabilization and «smooth landing» are solved as the example).
In the modern mathematics a great attention is given to a solution of problems of global optimization and synthesis of optimum control of dynamic system. These problems arise during designing of designs of planes, helicopters, spacecrafts when arises the necessity of optimization of characteristic parameters and of creation of control systems.
Existing numerical methods use various approaches, but their use is connected with various difficulties: the big computing loadings, requirements to problem statement, difficulties in reaching of convergence. Thus, working out of new methods of the optimization, which combine the newest mathematic approaches, is the extremely important.
Besides, it is necessary to notice that it is the extremely important to use and develop heuristic methods. Despite the lack of its strict substantiation, these methods give an acceptable solution of a problem in the majority of almost significant cases. Heuristic algorithms do not guarantee finding the solution and can give an incorrect solution in certain cases. However an essential advantage of such algorithms is their lowest computing complexity that allows to apply them to a solution of problems of the raised difficulty (for example, the problems belonging to NP class). In aggregate with key singularities of the interval analysis (handling of ranges instead of isolated points, low insistence to problem statement) working out of heuristic interval algorithms is the extremely perspective direction.
The main feature of the developed method is combination of interval analysis and explosion heuristics. Method has two search procedures: global and clarifying. This helps to find areas where the global minima can be situated and then to locate its position.
In the given work the algorithm and the software of the interval explosion method for a solution of a problem of determination of optimum programmed control by the discrete and continuous determined dynamic systems were created, applied examples on which efficiency of the developed method is shown were solved. Besides, some recommendations about possible improvements of the created method and its further development were made.

Keywords:

interval analysis, global optimization, heuristic algorithm, explosion method, optimal control, dynamic system

References

1. Ratschek H., Rokne J. New Computer Methods for Global Optimization, Horwood, Chichester, 2007, 229 p.
2. Dussel R. Einschließung des Minimalpunktes einer streng konvexen Funktion auf einem n-dimensiomalen Quader (Enclosure of the Minimum Point of a Strictly Convex Function to an N-Dimensional Cube), Karlsruhe, KIT, 1972, 165 p.
3. Hansen E. Global optimization using interval analysis, Marcel Dekker, New York, 2004, 515 p.
4. Shary S.P. Randomized Algorithms in Interval Global Optimization, Numerical Analysis and Applications, 2008, vol. 1, no. 4, pp. 376-389.
5. Shary S.P. Materialy XII Baikal’skoi mezhdunarodnoi konferentsii «Metody optimizatsii i ikh prilozheniya», Irkutsk, 2001, vol. 1, pp. 289-295.
6. Panov N.V., Sharyi S.P. Izvestiya Altaiskogo gosudarstvennogo universiteta, 2011, vol. 2, no. 1(69), pp. 108-113.
7. Moore R.E. Methods and applications of interval analysis, SIAM, Philadelphia, 1979, 190 p.
8. Panovskiy V.N. Youth and the future of aviation and cosmonautics. Konkurs nauchno-tekhnicheskikh rabot i proektov, tez.dokl. (Youth and the future of aviation and cosmonautics, Abstracts of Paper), Moscow, MAI, 2012, 196 p.
9. Panovskiy V.N. Electronnyi zhurnal «Trudy MAI», 2012, no.51, available at: http://www.mai.ru/science/trudy/published.php?ID=28948 (accessed 26.03.1012).
10. Tan Y., Zhu Y. Fireworks. Lecture Notes in Computer Science, Advances in Swarm Intelligence, 2010, vol. 6145, pp. 355-364.
11. GEM: A Novel Evolutionary Optimization Method with Improved Neighborhood Search, Applied Mathematics and Computation, 2009, vol. 210, no. 2, pp. 376-386.
12. Moore R.E. Interval analysis, Prentice Hall, Englewood Cliffs, 1966, 145 p.
13. Jaulin L., Kieffer M., Didrit O., Walter E. Applied Interval Analysis, Springer, Berlin, 2001, 384 p.
14. Sharyi S.P. Konechnomernyi interval’nyi analiz (Finite-dimensional Interval Analysis), Novosibirsk, XYZ, 2010, 606 p.
15. Krylov I.A. Vychislitel’naya matematika i matematicheskaya fizika, 1968, vol. 8, no. 1, pp. 203–208.
16. Panteleev A.V., Letova T.A. Metody optimizatsii. Prakticheskii kurs (Methods of Optimization. Practical Course), Мoscow, Logos, 2011, 425 p.
17. Panteleev A.V., Metlitskaya D.V., Aleshina E.A. Metody global’noi optimizatsii. Metaevristicheskie strategii i algoritmy (Methods of Global Optimization. Metaheuristic Strategies and Algorithms), Moscow, Vuzovskaya kniga, 2013, 248 p.
18. Panteleev A.V. Primenenie evolyutsionnykh metodov global’noi optimizatsii v zadachakh optimal’nogo upravleniya determinirovannymi sistemami (Application of Evolutionary Methods of Global Optimization in Problems of Finding the Optimal Control of Determined Systems), Moscow, MAI, 2013, 160 p.

Download