A multi-objective synthesis of optimal control system by the network operator method 1 A.I. Diveev Institution of Russian Academy of Sciences Dorodnicyn.

Slides:



Advertisements
Similar presentations
Analysis of Algorithms CS 477/677
Advertisements

Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.
1 Finite Constraint Domains. 2 u Constraint satisfaction problems (CSP) u A backtracking solver u Node and arc consistency u Bounds consistency u Generalized.
Approximation Algorithms Chapter 14: Rounding Applied to Set Cover.
Chapter 6 Eigenvalues and Eigenvectors
PROCESS MODELLING AND MODEL ANALYSIS © CAPE Centre, The University of Queensland Hungarian Academy of Sciences Analysis of Dynamic Process Models C13.
1.2 Row Reduction and Echelon Forms
Problem statement; Solution structure and defining elements; Solution properties in a neighborhood of regular point; Solution properties in a neighborhood.
Boolean Unification EE219B Presented by: Jason Shamberger March 1, 2000.
Data Flow Analysis Compiler Design Nov. 8, 2005.
1.2 – Open Sentences and Graphs
Hardness Results for Problems
Chapter 2 Functions and Graphs
MATH – High School Common Core Vs Kansas Standards.
February 17, 2015Applied Discrete Mathematics Week 3: Algorithms 1 Double Summations Table 2 in 4 th Edition: Section th Edition: Section th.
Copyright © 2011 Pearson, Inc. 1.2 Functions and Their Properties.
Genetic Programming.
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
System of Linear Equations Nattee Niparnan. LINEAR EQUATIONS.
Presentation on Matrices and some special matrices In partial fulfillment of the subject Vector calculus and linear algebra ( ) Submitted by: Agarwal.
Systems of Linear Equation and Matrices
Inequalities and Proof
Solving fixpoint equations
MATH 224 – Discrete Mathematics
4.4 Equations as Relations
A matrix equation has the same solution set as the vector equation which has the same solution set as the linear system whose augmented matrix is Therefore:
Chapter 1 A Beginning Library of Elementary Functions
Functions. Quick Review What you’ll learn about Numeric Models Algebraic Models Graphic Models The Zero Factor Property Problem Solving Grapher.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
1 C ollege A lgebra Systems and Matrices (Chapter5) 1.
Copyright © Cengage Learning. All rights reserved. CHAPTER 10 GRAPHS AND TREES.
Solving Polynomial Equations – Factoring Method A special property is needed to solve polynomial equations by the method of factoring. If a ∙ b = 0 then.
Chapter 5 – Relations and Functions. 5.1Cartesian Products and Relations Definition 5.1: For sets A, B  U, the Cartesian product, or cross product, of.
1.1 Functions This section deals with the topic of functions, one of the most important topics in all of mathematics. Let’s discuss the idea of the Cartesian.
Solving Network Coding Problems with Genetic Algorithmic Methods Anthony Kim Advisers: Muriel Medard and Una-May O’Reilly.
Approximation Algorithms Department of Mathematics and Computer Science Drexel University.
1.6. DEFINITIONS  An equation is a statement that two expressions are equal.  Usually contains 1 or more variables  A variable is a symbol that represents.
Table of Contents Solving Polynomial Equations – Factoring Method A special property is needed to solve polynomial equations by the method of factoring.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
CSCI 115 Chapter 1 Fundamentals. CSCI 115 §1.1 Sets and Subsets.
Optimization of Nonlinear Singularly Perturbed Systems with Hypersphere Control Restriction A.I. Kalinin and J.O. Grudo Belarusian State University, Minsk,
5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
State Equations BIOE Processes A process transforms input to output States are variables internal to the process that determine how this transformation.
1 1.2 Linear Equations in Linear Algebra Row Reduction and Echelon Forms © 2016 Pearson Education, Ltd.
Solving Quadratic Functions by Factoring. Factoring Review.
Section Recursion 2  Recursion – defining an object (or function, algorithm, etc.) in terms of itself.  Recursion can be used to define sequences.
1 SYSTEM OF LINEAR EQUATIONS BASE OF VECTOR SPACE.
Matrices Introduction.
CSE15 Discrete Mathematics 03/06/17
Automatic Test Generation
Decision Trees DEFINITION: DECISION TREE A decision tree is a tree in which the internal nodes represent actions, the arcs represent outcomes of an action,
Applied Discrete Mathematics Week 2: Functions and Sequences
Computable Functions.
CEN352 Dr. Nassim Ammour King Saud University
5 Systems of Linear Equations and Matrices
Data Structures and Algorithms
Overview Part 1 – Gate Circuits and Boolean Equations
Enough Mathematical Appetizers!
The Curve Merger (Dvir & Widgerson, 2008)
Chapter 4 Systems of Linear Equations; Matrices
Applied Discrete Mathematics Week 6: Computation
Section 1.3 Solving Equations Using a Graphing Utility
Linear Algebra Lecture 3.
Presented By Farheen Sultana Ist Year I SEM
5.4 T-joins and Postman Problems
Chapter 7: Systems of Equations and Inequalities; Matrices
Linear Algebra Lecture 7.
Basics Prof. Hsin-Mu (Michael) Tsai (蔡欣穆)
Discrete Mathematics CS 2610
Linear Algebra Lecture 28.
Presentation transcript:

A multi-objective synthesis of optimal control system by the network operator method 1 A.I. Diveev Institution of Russian Academy of Sciences Dorodnicyn Computing Centre of RAS, Moscow, Russia (

Classical problem of optimal control 2 The mathematical model of object of control is set Initial values Functional is criterion optimization A solution is optimal control Terminal condition Synthesizing function

3 Synthesis of optimal control

Problem statement 4 Initial values are in closed bounded domain It is necessary to find the admissible control that satisfies the restrictions oris vector of parameterswhere Pareto set is considered to be the solution of problem

Theorem 1. Assume 5 is a finite denumerable set Supposeis the solution of the multi-objective synthesis problem. and Then is the solution of the same problem, but with the set of initial condition

The network operator 6 The set of variables The set of parameters The set of unary operations The set of binary operations Commutative Associative Unit element

Унарные операции 7

Binary operations 8

The network operator 9 Network operator is a directed graph with following properties: a)graph should be circuit free; b) there should be at least one edge from the source node to any non- source node; c) there should be at least one edge from any non-source node to sink node ; d) every source node corresponds to the item of set of variables or of parameters ; e) every non-source node corresponds to the item of binary operations set ; f) every edge corresponds to the item of unary operations set.

10 Definition 1. Program notation of mathematical equation is a notation of equation with the help of elements of constructive sets X, Q,O 1,O 2. Definition 2. Graphic notation of mathematical equations is the notation of program notation that fulfills the following conditions: a) binary operation can have unary operations or unit element of this binary operation as its arguments; b) unary operation can have binary operation, parameter or variable as its argument; c) binary operation cannot have unary operations with equal constants or variables as its arguments. Theorem 2. Any program notation can be transformed in graphic notation.

11

An example Program notation Graphic notation Network operator 12

Network operator matrix (NOM) 13 Definition 4 Network operator matrix (NOM) is an integer upper- triangular matrix that has as its diagonal elements numbers of binary operations and non-diagonal elements are zeros or numbers of unary operations, besides if we replace diagonal elements with zeros and nonzero non-diagonal elements with ones we shall get an vertex incident matrix of the graph that satisfies conditions a-c of network operator definition.. NOM vertex incidence matrix

Network operator matrix (NOM) 14 vector of numbers of nodes for input variables vector of numbers of nodes for parameters vector of numbers of nodes for output variables a node vector if

Theorem 3. If we have the NOM numbers of nodes for variables parameters and outputs the mathematical expression is described by NOM and vectors of then it is sufficient to calculate 15

16 Small variations of network operator: 0 - replacement of unary operation by the edge of the graph; 1 - replacement of binary operation in the node; 2 - addition of the edge with unary operation; 3 - removal of unary operation with the edge of the graph. Vector of variations specifies the number of variation, is the number of node that the edge comes out, is the number of node that the edge comes in, is number of unary or binary operation.

The principle of basic solution 17 When solving optimization problems, initially we set the basic solution that is one of admissible solutions, then define small variations of basic solution and create search algorithm that searches for the optimal solution on the set of small variations

The genetic algorithm 18 The basic solution is a basic NOM A structural part of chromosome NOM for chromosome i A parametrical part of chromosome is number of bit for integer partis number of bit for fractional part Vector of parameters Grey code

An example 19

20

Pareto set 21

the solution 22

23

24