Temat: dynamic graph - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Solving Markov decision processes by d-graph algorithms
Autorzy:: Kátai, Z.
Powiązania:: https://bibliotekanauki.pl/articles/205688.pdf
Data publikacji:: 2012
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: Markov decision processes
dynamic programming
graph representation
graph algorithms
optimization problems
Opis:: Markov decision processes (MDPs) provide a mathematical model for sequential decisionmaking (sMDP/dMDP: stochastic/ deterministic MDP). We introduce the concept of generalized dMDP (g-dMDP) where each action may result in more than one next (parallel or clone) state. The common tools to represent dMDPs are digraphs, but these are inadequate for sMDPs and g-dMDPs. We introduce d-graphs as general tools to represent all the above mentioned processes (stationary versions). We also present a combined d-graph algorithm that implements dynamic programming strategies to find optimal policies for the finite/infinite horizon versions of these Markov processes. (The preliminary version of this paper was presented at the Conference MACRo 2011.)
Źródło:: Control and Cybernetics; 2012, 41, 3; 577-593
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Dynamic flows with supply and demand
Autorzy:: Ciurea, E.
Powiązania:: https://bibliotekanauki.pl/articles/205598.pdf
Data publikacji:: 2000
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: algorytm grafowy
przepływ dynamiczny
sieć
dynamic flows
graph algorithms
networks
Opis:: We are given a network G = (N, A, h, c) with node set N, arc set A, time function h, capacity function c, and P the set of periods, s the source and s' the sink of the network G. Associated with s, there is a non-negative real number q(t) called the supply of source s at time t, and with s' - a nonnegative real number q'(t) called the demand of sink s' at time t, t [belongs to] P. The objective is to determine the existence of a dynamic flow in G for p periods, so that the demands at sink s' can be fulfilled from the supplies at the source s. A numerical example is presented.
Źródło:: Control and Cybernetics; 2000, 29, 4; 895-903
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Time Petri nets state space reduction using dynamic programming
Autorzy:: Popova-Zeugmann, L.
Powiązania:: https://bibliotekanauki.pl/articles/970865.pdf
Data publikacji:: 2006
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: programowanie dynamiczne
time Petri net
dynamic programming
state space reduction
integer state
reachability graph
Opis:: In this paper a parametric description for the state space of an arbitrary TPN is given. An enumerative procedure for reducing the state space is introduced. The reduction is defined as a truncated multistage decision problem and solved recursively. A reachability graph is denned in a discrete way by using the reachable integer-states of the TPN.
Źródło:: Control and Cybernetics; 2006, 35, 3; 721-748
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja