Abstract
This paper explores how to design good rules for multiple learning agents in scheduling problems and investigates what kind of factors are required to find good solutions with small computational costs. Through intensive simulations of crew task scheduling in a space shuttle/station, the following experimental results have been obtained: (1) an integration of (a) a solution improvement factor, (b) an exploitation factor, and (c) an exploration factor contributes to finding good solutions with small computational costs; and (2) the condition part of rules, which includes flags indicating overlapping, constraints, and same situation conditions, supports the contribution of the above three factors.
*
Paper submitted to the 2nd Pacific Rim InternationalWorkshop on Multi-Agents (PRIMA’99)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Argyris and D.A. Schön: Organizational Learning, Addison-Wesley, 1978. 131
T.R. Balch and R.C. Arkin: “Communication in reactive multiagent robotic systems,” Autonomous Robots, Vol. 1, No. 1, pp. 27–52, 1995. 127
P. Brucker: Scheduling Algorithm, Springer-Verlag, 1995. 127
M.D. Cohen and L.S. Sproull: Organizational Learning, SAGE Publications, 1995. 131
A. Collinot, A. Drogoul, and P. Benhamou: “Agent Oriented Design of a Soccer Robot Team,” The Second International Conference on Multi-Agent Systems (ICMAS’96), pp. 41–47, 1996. 127
S. Fujita and V.R. Lesser: “Centralized Task Distribution in the Presence of Uncertainty and Time Deadlines,” The Second International Conference on Multiagent Systems (ICMAS’96), pp. 95–102, 1996. 128
D.E. Goldberg: Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989. 127, 131
J.J. Grefenstette: “Credit Assignment in Rule Discovery Systems Based on Genetic Algorithms,” Machine Learning, Vol. 3. pp. 225–245, 1988. 133
J.H. Holland and J. Reitman: “Cognitive Systems Based on Adaptive Algorithms,” in Pattern Directed Inference Systems, D.A. Waterman and F. Hayes-Roth (Eds.), Academic Press, 1978. 131
H. Iima, T. Hara, N. Ichimi, and N. Sonnomiya: “Autonomous Decentralized Scheduling Algorithm for a Job-Shop Scheduling Problem with Complicated Constraints,” The 4th International Symposium on Autonomous Decentralized Systems (ISADS’99), pp. 366–369, 1999. 128
J.G. March: “Exploration and Exploitation in Organizational Learning,” Organizational Science, Vol. 2, No. 1, pp. 71–87, 1991. 131, 138
M.J. Mataric: “Designing and Understanding Adaptive Group Behavior,” Adaptive Behavior, Vol. 4, No. 1, pp. 51–80, 1995. 127
I.H. Osman and J.P. Kerry: Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, 1996. 127
S.J. Russell and P. Norving: Artificial Intelligence: A Modern Approach, Prentice-Hall International, 1995. 132
S. Sen and E.H. Durfee: “Unsupervised Surrogate Agents and Search Bias Change in Flexible Distributed Scheduling,” The First International Conference on Multiagent Systems (ICMAS’95), pp. 336–343, 1995. 128
K. Takadama, S. Nakasuka, and T. Terano: “Multiagent Reinforcement Learning with Organizational-Learning Oriented Classifier System,” The IEEE 1998 International Conference On Evolutionary Computation (ICEC’98), pp. 63–68, 1998. 133
K. Takadama, T. Terano, K. Shimohara, K. Hori, and S. Nakasuka. “Can Multiagents Learn in Organization? Analyzing Organizational-Learning Oriented Classifier System?,” The 16th International Joint Conference on Artificial Intelligence (IJCAI’99) workshop on Agents Learning about, from and with other Agents, 1999. 128
K. Takadama, T. Terano, K. Shimohara, K. Hori, and S. Nakasuka: “Making Organizational Learning Operational: Implication from Learning Classifier System,” Computational and Mathematical Organization Theory (CMOT), Vol. 5, No. 3, pp. 229–252, 1999, to appear. 128, 131, 132, 133
H. Tamaki, M. Ochi, and M. Araki: “Introduction of a State Feedback Structure for Adjusting Priority Rules in Production Scheduling,” Transaction of SICE (the Society of Instrument and Control Engineers), Vol. 35, No. 3, pp. 428–434, 1999, (in Japanese). 128
W. Zhang and T.G. Dietterich: “A Reinforcement Learning Approach to Job-shop Scheduling,” The 14th International Joint Conference on Artificial Intelligence (IJCAI’95), pp. 1114–1120, 1995. 128
M. Zweben, B. Daun, and M. Deale: “Scheduling and Rescheduling with Iterative Reaper,” In Intelligent Scheduling, M. Zweben and M.S. Fox (Eds.), Morgan Kaufmann Publishers, Chapter 8, pp. 241–255, 1994. 128
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takadama, K., Watabe, M., Shimohara, K., Nakasuka, S. (1999). How to Design Good Rules for Multiple Learning Agents in Scheduling Problems?. In: Nakashima, H., Zhang, C. (eds) Approaches to Intelligence Agents. PRIMA 1999. Lecture Notes in Computer Science(), vol 1733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46693-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-46693-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66823-7
Online ISBN: 978-3-540-46693-2
eBook Packages: Springer Book Archive