scholarly journals Search for a moving target in a competitive environment

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):  
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.


2009 ◽  
Vol 34 (12) ◽  
pp. 1529-1533 ◽  
Author(s):  
Mai-Ying ZHONG ◽  
Shuai LIU ◽  
Hui-Hong ZHAO

Sign in / Sign up

Export Citation Format

Share Document