CDC2000 Communications and Games

Communications and Games
Home Full List of Titles 1: Proceedings of CDC2000 Discrete Event Systems Control in Communication Systems Optimal Control and Applications I Optimisation Approaches and Methods Model Predictive Control Advances in Linear Estimation Stochastic and Uncertain Systems Nonlinear Control and Applications Nonlinear Estimation and Filtering Formation Control and its Applications New Approaches to Fuzzy Control Manufacturing Systems Automotive Applications Stability Issues in Hybrid Control Recent Advances in Stochastic Networks Optimal Control and Applications II Robust Controller Design - mu, L1 and H2 Constrained and Receding Horizon Control Identification and Control around the World Markov Decision Processes Nonlinear Optimisation Observers for Nonlinear Systems Motion Planning Neural / Fuzzy Stability and Control Motor Control Control of Quantum Phenomena I Hybrid Systems Methods Control in Communication Networks Robustness and Optimisation Bumpless Transfer, Antiwindup and Saturation Adaptive Control: Linear Systems Estimation and Closed Loop Identification Control of Markov Processes Nonlinear Filtering and Control Modelling, Identification and Validation of Nonlinear Systems Differential Geometric Control Theory for Mechanical Systems Nonlinear Output Feedback Control Pneumatics and Compression Systems Control of Quantum Phenomena II Stability of Hybrid Systems Performance Analysis in Communication Networks Adaptive Control of Nonlinear Systems LMI Methods in Design Robust Control of Time Delay Systems Subspace Identification Methods Nonlinear Stochastic Filtering and Estimation Bifurcations, Chaos and Control I New Progress in Synthesis of Nonlinear Systems I Implementation Issues of Sliding Mode Control Theory Control of Mixing in Shear Flows Novel Neural Network Control Techniques for Industrial Motion Control Systems Physiological Control Systems Optimal Control of Hybrid Systems Stochastic Models for Communication Networks Control and Stabilisation of Nonlinear Systems New Directions in Robust Control Linear Systems Theory Advanced Topics in Systems Theory Estimation in Action Bifurcations, Chaos and Control II New Progress in Synthesis of Nonlinear Systems II Numerical Design and Analysis Techniques for Nonlinear Systems Analysis and Control of Underactuated Systems Sliding Mode Control I Challenges in the Application of Control to Computer Systems Estimation and Diagnosis of Discrete Event Systems Communications and Games Optimal Control Stochastic Systems Model Reduction Methodologies Identification and Subspace Methods Applications of Nonlinear Adaptive Control Advances in Nonlinear Output Feedback Design The Behavioural Approach to Systems and Control Vision Based Estimation and Control: Recent Advances and Open Problems Agile Control of Military Operations Sliding Mode Control II Model-based Fault Diagnosis of Industrial Processes Discrete Event Systems / Petri Nets System Identification and Confidence Estimation New Approaches to H-Infinity Control I Probabilistic Approaches to Robust Control Time Delay System Stabilisation Identification Methods Controlled Stochastic Processes Output Feedback of Nonlinear Systems Topics in Nonlinear Stabilisation Mobile Robots: Tracking Control Robust Control of Nonlinear Systems Power Systems Stabilisation and Control Disk Drive Control Hybrid Control Applications Discrete Time Systems New Approaches to H-Infinity Control II Linear Systems with Saturating Actuators New Theories in Distributed Parameter Systems Applications of Estimation and Identification Stochastic Control and Tuning Methodologies Control of Nonlinear Systems Iterative Learning and Control Coordinating Robot Systems Nonlinear Time Varying Systems Novel Applications of Neural Networks Aerospace Applications Switched Systems Implicit and Descriptor Systems LQG Periodic Systems and Disturbances New Horizons for Distributed Parameter Systems State Estimation Learning and Neuro-Control Nonlinear Control and Stabilisation I Tracking Vision Servoing Controllability of Nonlinear Systems Control of Flexible Systems Electro-Mechanical Systems Robust Control Methods and Applications Fault Detection and Diagnosis Optimisation and Applications Robust Stability Analysis Numerical Methods in Control Filtering in Continuous Time Stochastic Systems Interplay between Control and Signal Processing Fault Detection and Analysis Nonlinear Dynamical Systems Nonlinear Time Delay Systems Computational Issues in Nonlinear Control Disturbance Rejection Process Control Industry Applications Linear Parameter Varying Systems Linear Control Systems Dynamic and Nonlinear Programming Model Reduction Applications New Techniques for Control and Systems: Numerical Linear Algebra Estimation and Identification using Hidden Markov Models Applications of Stochastic Control Topics in Linear Design Nonlinear Control and Stabilisation II Ambulatory Robot Systems Chaotic and Oscillatory Systems Biomedical System Control Integrated Control and CPU Scheduling Linear Design Techniques Adaptive Disturbance / Noise Compensation Nonlinear Model Predictive Control Sensitivity Design, Analysis and Limitations Analysis of Linear Systems Linear Matrix Inequalities in Design Lyapunov's 2nd Method Robotics: Tracking Control Lagrangian and Hamiltonian Theory Variable Structure Control Machine Vision Signal Processing Methods in Control Applied Nonlinear Control Author Index A B C D E F G H I J K L M N O P Q R S T U V W X Y Z	Probabilistic Pursuit-Evasion Games: A One-Step Nash Approach Authors: João P. Hespanha, Maria Prandini, Shankar Sastry, Volume: 1, Page 2272 Paper number 1810 Abstract: This paper addresses the control of a team of autonomous agents pursuing a smart evader in a non-accurately mapped terrain. By describing the problem as a partial information Markov game, we are able to integrate map-learning and pursuit. We propose receding horizon control policies, in which the pursuers and the evader try to respectively maximize and minimize the probability of capture at the next time instant. Because this probability is conditioned to distinct observations for each team, the resulting game is nonzero-sum. When the evader has access to the pursuers' information, we show that a Nash solution to the one-step nonzero-sum game always exists. Moreover, we propose a method to compute the Nash equilibrium policies by solving an equivalent zero-sum matrix game. A simulation example shows the feasibility of the proposed approach. CD001810.PDF (From Author) TOP Nonstationary Zero Sum Stochastic Games with Incomplete Observation Authors: D. Leão, João B.R. do Val, Marcelo D. Fragoso, Volume: 1, Page 2278 Paper number 1937 Abstract: We study in this paper a discrete-time, two-players, zero-sum stochastic dynamic game similar to that introduced by Schal (1981). The novelty here, regarding previous works, is that besides the fact that the players do not have access to the opponent's earlier choices, they do not have all information about the state of the game. The main results are a minimax theorem and the existence of optimal strategy for one player. CD001937.PDF (From Author) TOP Internet Pricing: Comparison and Examples Authors: Xi-Ren Cao, Hong-Xia Shen, Volume: 1, Page 2284 Paper number 1397 Abstract: The central issue of Internet economics is pricing. In [1], we studied the Internet pricing based on the leader-follower game, the cooperative game, and the two-person game theory. In this paper, we continue our study by comparing different pricing schemes with the above approaches. These schemes include Paris Metro Pricing (PMP) and pricing with priority. We show that PMP does not provide better social welfare thus does not provide better cooperative solutions. Numerical examples indicate that the leader-follower game leads to an optimal solution with the same price for both "classes" of users in PMP. This contradicts to the intention of the original design of the scheme. CD001397.PDF (From Author) TOP Internets in the Sky: Capacity of 3-D Wireless Networks Authors: Piyush Gupta, Panganamala R. Kumar, Volume: 1, Page 2290 Paper number 1739 Abstract: Consider n nodes located in a sphere of volume V cubic meters, each capable of transmitting at a rate of W bits/sec. Under a protocol based model for successful receptions, the entire network can carry only (Theta)(W V^1/3 n^2/3) bit-meters/sec, where 1 bit carried a distance of 1 meter is counted as 1 bit-meter. This is the best possible even assuming the node locations, traffic patterns, and the range/power/timing of each transmission, are all optimally chosen. If the node locations and their destinations are randomly chosen, and all transmissions employ the same power/range, then each node only obtains a throughput of (Theta)(W /(n^1/3 (log n)^2/3)) bits/sec, if the network is optimally operated. Similar results hold under an alternate physical model where a minimum signal-to-interference ratio is specified for successful receptions. The proofs of these results require determination of the VC-dimensions of certain geometric sets, which may be of independent interest. CD001739.PDF (From Author) CD001739.PDF (Scanned) TOP Pricing of Dialup Services: an Example of Congestion-Dependent Pricing in the Internet Authors: Stephen D. Patek, Enrique Campos-Náñez, Volume: 1, Page 2296 Paper number 1309 Abstract: Recent research on dynamic pricing of multiclass loss networks has shown that the performance of optimal static pricing approaches that of optimal dynamic (congestion-dependent) pricing in the many small sources limit. In our own work with similar models, we have found it difficult to obtain large gains over static pricing in realistic settings, even when the many small sources assumption is violated. In this paper we give an example which is a stochastic control model for congestion-dependent pricing of Internet services. Our formulation captures the basic tradeoff in allocating bandwidth to two classes of users in maximizing average net revenue. Optimal pricing requires that the ISP anticipate and respond to changes in bandwidth consumption. Our goal is to quantify the gain that can be achieved through dynamic pricing over open loop pricing strategies which may or may not account for time-of-day effects. We frame the problem as a continuous-time Markov decision process for which we numerically compute optimal solutions. CD001309.PDF (From Author) TOP Stochastic Routing in Ad Hoc Wireless Networks Authors: Christopher G. Lott, Demosthenis Teneketzis, Volume: 1, Page 2302 Paper number 1303 Abstract: We investigate a network routing problem where a probabilistic local broadcast model for wireless transmission is used. We present results showing that an index policy is optimal for this problem. We extend the original model to allow for power control, and assert that the index nature of the optimal routing policy remains unchanged. We further allow time-varying system parameters in the original model, and discover conditions under which a time-varying index routing policy is optimal. Finally, we present a distributed implementation of the routing policy and provide results on its convergence properties. CD001303.PDF (From Author) TOP