Hamiltonian systems discrete-time approximation: Losslessness, passivity and composability

2017 ◽  
Vol 110 ◽  
pp. 9-14 ◽  
Author(s):  
Said Aoues ◽  
Michael Di Loreto ◽  
Damien Eberard ◽  
Wilfrid Marquis-Favre
2001 ◽  
Vol 47 (4) ◽  
pp. 2485-2495 ◽  
Author(s):  
Anna Gerardi ◽  
Paola Tardelli

2007 ◽  
Vol 41 (1) ◽  
pp. 61-81 ◽  
Author(s):  
Amir Azaron ◽  
Masatoshi Sakawa ◽  
Reza Tavakkoli-Moghaddam ◽  
Nima Safaei

1986 ◽  
Vol 18 (03) ◽  
pp. 724-746
Author(s):  
W. J. R. Eplett

The theory of allocation indices for defining the optimal policy in multi-armed bandit problems developed by Gittins is presented in the continuous-time case where the projects (or ‘arms’) are strong Markov processes. Complications peculiar to the continuous-time case are discussed. This motivates investigation of whether approximation of the continuous-time problems by discrete-time versions provides a valid technique with convergent allocation indices and optimal expected rewards. Conditions are presented under which the convergence holds.


2009 ◽  
Vol 164 (2-3) ◽  
pp. 490-496 ◽  
Author(s):  
G.L.L. Reniers ◽  
A. Audenaert ◽  
B.J.M. Ale ◽  
N. Pauwels ◽  
K. Soudan

1984 ◽  
Vol 16 (1) ◽  
pp. 15-16
Author(s):  
A. Hordijk ◽  
F. A. Van Der Duyn Schouten

The method of discrete-time approximation is widespread in control and decision theory. However, little attention has been paid to the conditions on parameters and control under which the discrete-time systems come close to the continuous-time system.


Sign in / Sign up

Export Citation Format

Share Document