NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

Similar documents
Solving two-person zero-sum game by Matlab

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming

A New Approach For the Ranking of Fuzzy Sets With Different Heights

GSLM Operations Research II Fall 13/14

Mathematics 256 a course in differential equations for engineering students

Intra-Parametric Analysis of a Fuzzy MOLP

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation

Biostatistics 615/815

Cluster Analysis of Electrical Behavior

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

An Optimal Algorithm for Prufer Codes *

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

A Binarization Algorithm specialized on Document Images and Photos

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

AC : TEACHING SPREADSHEET-BASED NUMERICAL ANAL- YSIS WITH VISUAL BASIC FOR APPLICATIONS AND VIRTUAL IN- STRUMENTS

Programming in Fortran 90 : 2017/2018

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Machine Learning. Topic 6: Clustering

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Smoothing Spline ANOVA for variable screening

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Unsupervised Learning

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS

S1 Note. Basis functions.

Network Coding as a Dynamical System

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Support Vector Machines

The Methods of Maximum Flow and Minimum Cost Flow Finding in Fuzzy Network

Network Intrusion Detection Based on PSO-SVM

An Improved Image Segmentation Algorithm Based on the Otsu Method

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Numerical model describing optimization of fibres winding process on open and closed frame

Load Balancing for Hex-Cell Interconnection Network

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Structural Optimization Using OPTIMIZER Program

Parallelism for Nested Loops with Non-uniform and Flow Dependences

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A NOTE ON FUZZY CLOSURE OF A FUZZY SET

Optimum Synthesis of Mechanisms For Path Generation Using a New Curvature Based Deflection Based Objective Function

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

Predator-Prey Pigeon-Inspired Optimization for UAV Three-Dimensional Path Planning

OPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM

Optimization of integrated circuits by means of simulated annealing. Jernej Olenšek, Janez Puhan, Árpád Bűrmen, Sašo Tomažič, Tadej Tuma

Support Vector Machines

A Statistical Model Selection Strategy Applied to Neural Networks

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Cracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Complex System Reliability Evaluation using Support Vector Machine for Incomplete Data-set

On Some Entertaining Applications of the Concept of Set in Computer Science Course

SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Virtual Machine Migration based on Trust Measurement of Computer Node

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

International Journal of Mathematical Archive-3(11), 2012, Available online through ISSN

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

A Facet Generation Procedure. for solving 0/1 integer programs

International Journal of Industrial Engineering Computations

Problem Set 3 Solutions

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

OPL: a modelling language

A new segmentation algorithm for medical volume image based on K-means clustering

Minimization of the Expected Total Net Loss in a Stationary Multistate Flow Network System

EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS

Meta-heuristics for Multidimensional Knapsack Problems

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit

Design for Reliability: Case Studies in Manufacturing Process Synthesis

The Research of Support Vector Machine in Agricultural Data Classification

Two-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture

Review of approximation techniques

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

X- Chart Using ANOM Approach

An Optimization Approach for Path Synthesis of Four-bar Grashof Mechanisms

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Classifier Selection Based on Data Complexity Measures *

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Research Article. ISSN (Print) s k and. d k rate of k -th flow, source node and

5 The Primal-Dual Method

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Multi-objective Design Optimization of MCM Placement

Fast Computation of Shortest Path for Visiting Segments in the Plane

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

Design of Structure Optimization with APDL

TESTING AND IMPROVING LOCAL ADAPTIVE IMPORTANCE SAMPLING IN LJF LOCAL-JT IN MULTIPLY SECTIONED BAYESIAN NETWORKS

The Comparison of Calibration Method of Binocular Stereo Vision System Ke Zhang a *, Zhao Gao b

Transcription:

ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana Mustafna and Vladmr Vaytev Bashkr State Unversty, Address: 3, Valdy Str., Ufa, Russa E-Mal: grgoryevgor@mal.ru ABSTRACT In the artcle based on the method of varatons n the space of controls the algorthm s developed and program was mplemented to determne the optmal control problems wth free rght end. As an llustraton method, presents the results of numercal soluton of the three examples wth constrants on the control and phase varables. The advantage of ths algorthm s the lack of requrements for the selecton of the ntal approxmaton control parameter and phase varables. The algorthm has good convergence and can be used to solve a large class of applcatons n varous branches of the economy. By usng the developed algorthm determned the optmum trajectory and the numercal values of the control parameter for the test problems. A comparatve analyss of the results of the numercal soluton of the examples for dfferent values of ntal approxmaton control and precson. Keywords: method of varatons, optmal control, phase varables. 1. INTRODUCTION Methods of the optmum control theory are ntensvely used n varous applcaton areas. Control theory s applcaton-orented mathematcs that deals wth the basc prncples underlyng the analyss and desgn of (control) systems. Systems can be engneerng systems, economc systems, bologcal systems and so on. To control means that one has to nfluence the behavour of the system n a desrable way: for example, n the case of an ar condtoner, the am s to control the temperature of a room and mantan t at a desred level, whle n the case of an arcraft, we wsh to control ts alttude at each pont of tme so that t follows a desred trajectory. As a result, more and more people wll beneft greatly by learnng to solve the optmal control problems numercally. Ths work s devoted to an actual problem - development of effcent and unversal algorthms of numercal problem solvng of optmal control.. PROBLEM STATEMENT Consder the followng optmal control mnnmze I u Subject to G x t (1) dx f ( t, x( t), u( t)), t t 0, T, x(0) x0, () dt u 0 (3) Where u t R s the functon characterzng the n operatng nfluence, x t R s functon descrbng a condton of process and t s tme. Let s consder varous algorthms for problem solvng of optmal control..1 Performance crteron A performance crteron (also called cost functonal or smply cost) must be specfed for evaluatng the performance of a system quanttatvely. By analogy to the problems of the calculus of varatons, the cost functonal I : U[ t0, t1] R may be defned n the socalled Lagrange form: t1 I ( u) f ( t, x( t), u( t)) dt. (4) t0 0 3. THE ALGORITHM OF THE METHOD OF VARIATIONS The algorthm conssts of 9 steps: 1. Guess an ntal approxmaton of control U 0.. Break nterval [ t 0, t k ] to n parts, consttutng a unform system of unts. 3. Select startng node t 0, whch wll be a varaton of controls. 4. Compute U ( t 0 ) U. 5. Compute x (t), u(t) by solvng (3). 6. Calculate I (u) accordng to (4). 7. Go to t 1 and go to step 4 for all remanng ponts t. 8. Determne the mnmum value of the crteron calculated for all ponts t and defne a new control U1 corresponds to the lowest value crteron. 9. Set U U. Then, wth the control U 1, go to step 3 untl wll not fnd varaton n whch the performance crteron wll not be mproved. 4. DISCUSSIONS The software for the numercal calculatons presented below n ths artcle was developed n Borland 30

ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. Delph envronment. For each of the followng cases, we wll compute the Eucldean norm of the soluton error: x x ( t ), x x ( t ), x1 u 1 u u ( t). 1 x Example-1: Consder the followng optmal x u( t), x(0) 0, x(1) 0.5, x R, u R, t 0,1. (5) 1 I u t x t dt mn. (6) 0 The optmal control problem s to fnd a control law u whch mnmzes cost functonal (6). The analytcal soluton of ths problem s presented n []. Fgure-1 show the comparson between numercal soluton and approxmate soluton for u 0 0.. Table-1 presents smulaton results for dfferent ntal guess and accuracy of ths problem. The performance measure s: Fgure-1. Comparson between numercal soluton and approxmate soluton, Example 1. Table-1. Smulaton results for dfferent ntal guess and accuracy, Example 1.. u0 Accuracy Elapsed tme, s. u 1 0 0,1 0,36 1,4 0,93 0 0,01 0,74 0,99 0,04 3 0 0,001 1, 0,083 0,006 4-0,6 0,001 1,4 0,004 0,00 5-0,9 0,0001 4,75 0,0004 0,0005 6 0,1 0,00001 6,43 0,00008 0,00013 x Example-: Consder the followng optmal x 1t x t, x t u t 0.5 u t ; x 0 0, 0 0, 1 x 0 t 1, 0 u 1. (7) 31

ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. The performance measure s: x x x 1 max. I (8) 1, 1 The optmal control problem s to fnd a control law u whch mnmzes cost functonal (8). The analytcal soluton of ths problem s presented n [3]. Fgure- shows the comparson between numercal soluton and approxmate soluton for u 0 0. 6. Table- presents smulaton results for dfferent ntal guess and accuracy of ths problem. At the same tme the estmated value of the control parameter n the range 0 t 1 has a constant value equal to 1. Fgure-. The suboptmal states. Table-. Smulaton results for dfferent ntal guess and accuracy, Example.. u0 Accuracy Elapsed tme, s. u x 1 1 0,6 0,1,3 1,06 1,105 0,85 0,6 0,01 6,43 1,009 0,04 0,108 3 0,6 0,001 9,45 1 0,001 0,018 4 0,8 0,001 11,58 1 0,003 0,009 5 0,8 0,0001 18,3 1 0,0033 0,0091 6 0,6 0,00001 3,85 1 0,0000 0,00007 x Example-3: Consder the followng optmal x 1t x t, x t x1 t u t ; x 0 0, 0 0, 1 x 0 t, u 1. The performance measure s: x x x mn. 1, (9) I (10) The optmal control problem s to fnd a control law u whch mnmzes cost functonal (10). 1, t 0.5, The exact soluton are: u ( t) 0, 0.5 t, 1, t.5. Fgure-3, Fgure-4 shows the comparson between numercal soluton and approxmate soluton for u 0 0.1. Table 3 presents smulaton results for dfferent ntal guess and accuracy of ths problem. 3

ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. Fgure-3. The suboptmal states. Fgure-4. The suboptmal control. Table-3. Smulaton results for dfferent ntal guess and accuracy, Example 3.. u0 Accuracy Elapsed tme, s. u x 1 1 0 0,1,06 3,06 1,11 1,1 0 0,01,85,99 0,14 0,15 3 0 0,001 4,1,987 0,018 0,019 4-0,6 0,001 3,94,854 0,019 0,016 5-0,9 0,0001 1,06,004 0,1086 0,1089 6 0,1 0,00001 3,35,003 0,1093 0,1088 x 33

ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. 5. CONCLUSIONS For many optmal control problems, the method of varatons s the best opton we have. The advantage of ths algorthm s that t does not have requrements wth ntal guess. The algorthm has good convergence and can be used to solve a large class of applcatons n varous felds of natonal economy. REFERENCES Igor Grgoryev, Svetlana Mustafna, Oleg Larn. 016. «Numercal soluton of optmal control problems by the method of successve approxmatons». Internatonal Journal of Pure and Appled Mathematcs. 111(4): 617-6. do:10.173/jpam.v1114.8 Igor Grgoryev, Svetlana Mustafna. 016. «Global optmzaton of functons of several varables usng parallel technologes». Internatonal Journal of Pure and Appled Mathematcs. 106(1): 301-306. do: 10.173/jpam.v1061.4. Gulnaz Shangareeva, Igor Grgoryev, Svetlana Mustafna. 016. «Comparatve Analyss of Numercal Soluton of Optmal Control Problems». Internatonal Journal of Pure and Appled Mathematcs. 110(4): 645-649. do: 10.173/j-pam.v1104.6. Igor Grgoryev, Eldar Mftakhov, Svetlana Mustafna. 016. «Mathematcal Modellng of the Copolymerzaton of Styrene wth Malec Anhydrde n a Homogeneous Envronment». Internatonal Journal of Chemcal Scences. 14(1): 381-386. Mustafna S., Mftakhov E., Mkhalova T. 014. «Solvng the drect problem of butadene-styrene copolymerzaton». Internatonal Journal of Chemcal Scences. 1(): 564-57. 34