Abstract
This paper presents the usage of cooperative self-organization to design adaptive artificial systems. Cooperation can be viewed as a local criterion for agents to self-organize and then to perform a more adequate collective function. This paper shows an application of cooperative behaviors to a dynamic distributed timetabling problem, ETTO, in which the constraint satisfaction is distributed among cooperative agents. This application has been prototyped and shows positive results on adaptation, robustness and efficiency of this kind of approach.
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.
Similar content being viewed by others
References
Kohonen, T.: Self-Organising Maps. Springer, Heidelberg (2001)
Bonabeau, E., Theraulaz, G., Deneubourg, J.L., Aron, S., Camazine, S.: Self-Organization in Social Insects. Trends in Ecology and Evolution 12, 188–193 (1997)
Capera, D., Georgé, J., Gleizes, M.P., Glize, P.: The AMAS Theory for Complex Problem Solving Based on Self-organizing Cooperative Agents. In: 1st International TAPOCS Workshop at IEEE 12th WETICE, pp. 383–388. IEEE, Los Alamitos (2003)
Georgé, J.P., Edmonds, B., Glize, P.: Making Self-Organising Adaptive Multiagent Systems Work. In: Methodologies and Software Engineering for Agent Systems, pp. 321–340. Kluwer, Dordrecht (2004)
Bistarelli, S., Fargier, H., Mantanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based constraints CSPs and valued CSPs: frameworks, properties, and comparison. Constraints: an International Journal 4, 199–240 (1999)
Dechter, Meiri, Pearl: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)
Yokoo, M., Durfee, E., Ishida, Y., Kubawara, K.: The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Transactions on Knowledge and Data Engineering 10, 673–685 (1998)
Socha, K., Knowles, J., Sampels, M.: A MAX-MIN Ant System for the University Timetabling Problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 1–13. Springer, Heidelberg (2002)
Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing Conflicts: a Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems 58, 160–205 (1992)
Müller, T., Rudova, H.: Minimal Perturbation Problem in Course Timetabling. In: Proc. of the 5th International Conference of the Practice and Theory of Automated Timetabling (PATAT), Pittsburg, USA (2004)
Cambazard, H., Demazeau, F., Jussien, N., David, P.: Interactively Solving School Timetabling Problems using Extensions of Constraint Programming. In: Proc. of the 5th International Conference of the Practice and Theory of Automated Timetabling (PATAT), Pittsburg, USA (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Picard, G., Bernon, C., Gleizes, MP. (2005). Emergent Timetabling Organization. In: Pěchouček, M., Petta, P., Varga, L.Z. (eds) Multi-Agent Systems and Applications IV. CEEMAS 2005. Lecture Notes in Computer Science(), vol 3690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11559221_44
Download citation
DOI: https://doi.org/10.1007/11559221_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29046-9
Online ISBN: 978-3-540-31731-9
eBook Packages: Computer ScienceComputer Science (R0)