Abstract
This paper describes the application of reinforcement learning (RL) to the difficult real world problem of elevator dispatching. The elevator domain poses a combination of challenges not seen in most RL research to date. Elevator systems operate in continuous state spaces and in continuous time as discrete event dynamic systems. Their states are not fully observable and they are nonstationary due to changing passenger arrival rates. In addition, we use a team of RL agents, each of which is responsible for controlling one elevator car. The team receives a global reinforcement signal which appears noisy to each agent due to the effects of the actions of the other agents, the random nature of the arrivals and the incomplete observation of the state. In spite of these complications, we show results that in simulation surpass the best of the heuristic elevator control algorithms of which we are aware. These results demonstrate the power of RL on a very large scale stochastic dynamic optimiz...
Keywords
Affiliated Institutions
Related Publications
Pulse distortion and Hilbert transformation in multiply reflected and refracted body waves
abstract Many seismic body waves are associated with rays which are not minimum travel-time paths. Such arrivals contain pulse deformation due to a phase shift in each frequency...
A Dynamic Theory of Organizational Knowledge Creation
This paper proposes a paradigm for managing the dynamic aspects of organizational knowledge creating processes. Its central theme is that organizational knowledge is created thr...
Distributed Geodesic Control Laws for Flocking of Nonholonomic Agents
We study the problem of flocking and coordination of a group of kinematic nonholonomic agents in 2 and 3 dimensions. By analyzing the velocity vectors of agents on a circle (for...
Formation Control and Collision Avoidance for Multi-Agent Systems and a Connection between Formation Infeasibility and Flocking Behavior
A feedback control strategy that achieves convergence of a multi-agent system to a desired formation configuration avoiding at the same time collisions is proposed. The collisio...
Consensus and Cooperation in Networked Multi-Agent Systems
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> This paper provides a theoretical framework for analysis of consensus algorithms...
Publication Info
- Year
- 1995
- Type
- article
- Volume
- 8
- Pages
- 1017-1023
- Citations
- 493
- Access
- Closed