|
|
||||||||
School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853
This paper proposes a distributed solution approach to a certain class of dynamic resource allocation problems and develops a dynamic programming-based multiagent decision-making, learning, and communication mechanism. In the class of dynamic resource allocation problems we consider, a set of reusable resources of different types has to be assigned to tasks that arrive randomly over time. The assignment of a resource to a task removes the task from the system, modifies the state of the resource, and generates a contribution. We build a decision-making scheme where the decisions regarding the resources in different sets of states are made by different agents. We explain how to coordinate the actions of different agents using nonlinear functional approximations, and show that in a distributed setting, nonlinear approximations produce sequences of min-cost network flow problems that naturally yield integer solutions. We also experimentally compare the performances of the centralized and distributed solution strategies.
Department of Operations Research and Financial Engineering, Princeton University, Princeton, New Jersey 08544
topaloglu{at}orie.cornell.edu
powell{at}princeton.edu
Subject classifications: dynamic programming: approximate dynamic programming; computers: artificial intelligence; technology transportation: dynamic fleet management.
History: Received March 2001;
revision received October 2003;
accepted December 2003.
This article has been cited by other articles:
![]() |
C. E. Cortes, D. Saez, A. Nunez, and D. Munoz-Carpintero Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem Transportation Science, February 1, 2009; 43(1): 27 - 42. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |