30 research outputs found

    Navigation system and method

    Get PDF
    In a global positioning system (GPS), such as the NAVSTAR/GPS system, wherein the position coordinates of user terminals are obtained by processing multiple signals transmitted by a constellation of orbiting satellites, an acquisition-aiding signal generated by an earth-based control station is relayed to user terminals via a geostationary satellite to simplify user equipment. The aiding signal is FSK modulated on a reference channel slightly offset from the standard GPS channel. The aiding signal identifies satellites in view having best geometry and includes Doppler prediction data as well as GPS satellite coordinates and identification data associated with user terminals within an area being served by the control station and relay satellite. The aiding signal significantly reduces user equipment by simplifying spread spectrum signal demodulation and reducing data processing functions previously carried out at the user terminals

    Nonzero-sum Stochastic Games

    Get PDF
    This paper treats of stochastic games. We focus on nonzero-sum games and provide a detailed survey of selected recent results. In Section 1, we consider stochastic Markov games. A correlation of strategies of the players, involving ``public signals'', is described, and a correlated equilibrium theorem proved recently by Nowak and Raghavan for discounted stochastic games with general state space is presented. We also report an extension of this result to a class of undiscounted stochastic games, satisfying some uniform ergodicity condition. Stopping games are related to stochastic Markov games. In Section 2, we describe a version of Dynkin's game related to observation of a Markov process with random assignment mechanism of states to the players. Some recent contributions of the second author in this area are reported. The paper also contains a brief overview of the theory of nonzero-sum stochastic games and stopping games which is very far from being complete

    Continuous-Time Markov Decision Processes with Discounted Rewards: The Case of Polish Spaces

    No full text

    Time-average and asymptotically optimal flow control policies in networks with multiple transmitters

    Full text link
    We consider M transmitting stations sending packets to a single receiver over a slotted time-multiplexed link. For each phase consisting of T consecutive slots, the receiver dynamically allocates these slots among the M transmitters. Our objective is to characterize policies that minimize the long-term average of the total number of messages awaiting service at the M transmitters. We establish necessary and sufficient conditions on the arrival processes at the transmitters for the existence of finite cost time-average policies; it is not enough that the average arrival rate is strictly less than the slot capacity. We construct a pure strategy that attains a finite average cost under these conditions. This in turn leads to the existence of an optimal time-average pure policy for each phase length T , and to upper and lower bounds on the cost this policy achieves. Furthermore, we show that such an optimal time-average policy has the same properties as those of optimal discounted policies investigated by the authors in a previous paper. Finally, we prove that in the absence of costs accrued by messages within the phase, there exists a policy such that the time-average cost tends toward zero as the phase length T →∞.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/44208/1/10479_2005_Article_BF02025184.pd
    corecore