The information path functional approach for solution of a controllable stochastic problem

نویسنده

  • Vladimir S. Lerner
چکیده

We study a stochastic control system, described by Ito’s controllable equation, and evaluate the solutions by an entropy functional (EF), defined by the equation’s functions of controllable drift and diffusion. Considering a control problem for this functional, we solve the EF control’s variation problem (VP), which leads to both a dynamic approximation of the process’ entropy functional by an information path functional (IPF) and to an information dynamic model (IDM) of the stochastic process. The IPF variation equations allow finding the optimal control functions, applied to both stochastic system and the IDM for a joint solution of the identification and optimal control problems, combined with a state’s consolidation. In this optimal dual strategy, the IPF optimum predicts each current control action not only in terms of a total functional path goal, but also by setting for each following control action the renovated values of this functional’s controllable drift and diffusion, identified during the optimal movement, which concurrently correct this goal. The VP information invariants allow optimal encoding of the identified dynamic model’s operator and control. The introduced method of cutting off the process by applying an impulse control estimates the cut off information, accumulated by the process’ inner connections between its states. It has shown that such a functional information measure contains more information than the sum of Shannon’s entropies counted for all process’ separated states, and provides information measure of Feller’s kernel. Examples illustrate the procedure of solving these problems, which has been implemented in practice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Mathematical Approach based on Conic Quadratic Programming for the Stochastic Time-Cost Tradeoff Problem in Project Management

In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...

متن کامل

The entropy functional, the information path functional's essentials and their connections to Kolmogorov's entropy, complexity and physics

Introduction The entropy functional, defined on a Markov diffusion process, plays an important roll in theory of information and statistical physics [1-3], informational macrodynamics and control systems [4]. However in the known references, we did not find the mathematical results related to the entropy functional’s connections with the Kolmogorov’s entropy, complexity, and the Lyapunov’s char...

متن کامل

A Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases

The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...

متن کامل

Designing a quantum genetic controller for tracking the path of quantum systems

Based on learning control methods and computational intelligence, control of quantum systems is an attractive field of study in control engineering. What is important is to establish control approach ensuring that the control process converges to achieve a given control objective and at the same time it is simple and clear. In this paper, a learning control method based on genetic quantum contr...

متن کامل

Model and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand

The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011