1998
DOI: 10.1155/s1026022698000028
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic system evolution and markov chain approximation

Abstract: In this paper computational aspects of the mathematical modelling of dynamic system evolution have been considered as a problem in information theory. The construction of mathematical models is treated as a decision making process with limited available information.The solution of the problem is associated with a computational model based on heuristics of a Markov Chain in a discrete space–time of events. A stable approximation of the chain has been derived and the limiting cases are discussed. An intrins… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 48 publications
0
9
0
Order By: Relevance
“…An optimization model of the PSM parameters that offers maximized energy saving and simultaneously minimizing the communication delay is presented in this section. We used the priori method [23] in a multi-objective optimization technique to formulate a problem that can simultaneously solve the two parameters i.e. delay and energy saving.…”
Section: Optimization Modelmentioning
confidence: 99%
“…An optimization model of the PSM parameters that offers maximized energy saving and simultaneously minimizing the communication delay is presented in this section. We used the priori method [23] in a multi-objective optimization technique to formulate a problem that can simultaneously solve the two parameters i.e. delay and energy saving.…”
Section: Optimization Modelmentioning
confidence: 99%
“…If we include these constraints into the definition of the Hamiltonian/Lagrangian, the analysis cannot be reduced to only those five case discussed previously in this section. In the general case, the number of speed holding phases for the entire trip can be determined by a posteriori estimations based on a sequential algorithm of information processing accounting for human factors [27]. Recall that in conventional methodologies this number is postulated a priori.…”
Section: Using the Embedding Principle And The Lagrangian Multipliersmentioning
confidence: 99%
“…Naturally, it cannot be reduced to the five cases discussed before. Instead, a sequential (in real time) algorithm is required to incorporate human factors into the model via sequential estimations of a time-perturbed Hamiltonian approximation [26,27] for each time subinterval t ≤ τ ≤ t + ∆t with t ∈ [0, T ]. This formulation is more general than those resulted from conventional methodologies.…”
Section: Hamiltonian Estimations and Human-centered Automationmentioning
confidence: 99%
See 2 more Smart Citations