Discrete time dynamic estimation model for passenger origin/destination matrices on transit networks

1988 ◽  
Vol 22 (4) ◽  
pp. 251-260 ◽  
Author(s):  
S. Nguyen ◽  
E. Morello ◽  
S. Pallottino
Author(s):  
Benoit Duvocelle ◽  
János Flesch ◽  
Hui Min Shi ◽  
Dries Vermeulen

AbstractWe consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.


Author(s):  
Hoora Moradian ◽  
Weichi Yao ◽  
Denis Larocque ◽  
Jeffrey S. Simonoff ◽  
Halina Frydman

Author(s):  
S. Kalender ◽  
H. Flashner

An approach for robust control of periodically time-varying systems is proposed. The approach combines the point-mapping formulation and a parameterization of the control vector to formulate an equivalent time-invariant discrete-time representation of the system. The discrete-time representation of the dynamic system allows for the application of known sampled-data control design methodologies. A perturbed, discrete-time dynamic model is formulated and plant parametric uncertainty are obtained using a truncated point-mapping algorithm. The error bounds due to point-mapping approximation are computed and a robustness analysis problem of the system due to parametric uncertainties is formulated using structured singular value theory. The proposed approach is illustrated by two design examples. Simulation studies show good performance robustness of the control system to parameter perturbations and system nonlinearities.


10.5772/14281 ◽  
2011 ◽  
Author(s):  
Kenichi Fujimoto ◽  
Mio Kobayashi ◽  
Tetsuya Yoshinag

Author(s):  
João P. Hespanha

This chapter focuses on the computation of the saddle-point equilibrium of a zero-sum discrete time dynamic game in a state-feedback policy. It begins by considering solution methods for two-player zero sum dynamic games in discrete time, assuming a finite horizon stage-additive cost that Player 1 wants to minimize and Player 2 wants to maximize, and taking into account a state feedback information structure. The discussion then turns to discrete time dynamic programming, the use of MATLAB to solve zero-sum games with finite state spaces and finite action spaces, and discrete time linear quadratic dynamic games. The chapter concludes with a practice exercise that requires computing the cost-to-go for each state of the tic-tac-toe game, and the corresponding solution.


Sign in / Sign up

Export Citation Format

Share Document