Abstract
The paper proposes an agent-based constraint programming architecture that we have successfully applied to solve large, particularly combinatorial, operations problems. The architecture is based on the asynchronous team (A-Team) in which multiple problem solving agents cooperate with each other by exchanging results to produce a set of non-dominated solutions. We extend the A-Team by introducing CSP-specific agents, explicitly defining solution states, and enabling solution decomposition/composition, and thereby improve the performance, reliability, and automation of constraint programming significantly.
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
Bistarelli, S.: Semirings for Soft Constraint Solving and Programming. LNCS, vol. 2962, pp. 1–20. Springer, Heidelberg (2004)
Alguire, K.M., Gomes, C.P.: Technology for Planning and Scheduling under Complex Constraints. In: Proceedings of Society for Optical Engineering, Boston, USA, pp. 101–107 (1997)
Beck, J.C., Fox, M.S.: Supply chain coordination via mediated constraint relaxation. In: Proceedings of 1st Canadian Workshop on Distributed Artificial Intelligence, Banff, AB, pp. 61–72 (1994)
Liu, J.S., Sycara, K.P.: Multiagent coordination in tightly coupled task scheduling. In: Proceedings of 2nd International Conference on Multiagent Systems, Kyoto, Japan, pp. 164–171 (1996)
Talukdar, S.N., Baerentzen, L., Gove, A., Souza, P.D.: Asynchronous Teams: Cooperation Schemes for Autonomous Agents. Journal of Heuristics 4(4), 295–321 (1998)
Zheng, Y.J., Xue, J.Y.: MISCE: A Semi-Automatic Development Environment for Logistic Information Systems. In: Proceedings of IEEE International Conference on Service Operations and Logistics, and Informatics, Beijing, China, pp. 1020–1025 (2005)
Tsang, E.P.K.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
Zheng, Y.J., Wang, L.L., Xue, J.Y.: A Constraint Programming Framework for Integrated Materiel Logistic Support. Journal of Nanjing University 40(10), 30–35 (2005)
Akkiraju, R., Keskinocak, P., Murthy, S., Frederick, W.: An Agent-Based Approach for Scheduling Multiple Machines. Applied Intelligence 14, 135–144 (2001)
Pepper, P., Smith, D.R.: A High-level Derivation of Global Search Algorithms (with Constraint Propagation). Science of Computer Programming. special issue on FMTA (Formal Methods: Theory and Applications), vol. 28, pp. 247–271 (1996)
Focacci, F., Lodi, A., Milano, M.: Optimization-Oriented Global Constraints. Constraints 7, 351–365 (2002)
Zweben, M., Daun, B., Davis, E., Deale, M.: Scheduling and rescheduling with iterative repair. In: Zweben, M., Fox, M.S. (eds.) Intelligent Scheduling, pp. 241–255. Morgan Kaufmann, San Francisco (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, Y., Wang, L., Xue, J. (2006). An A-Team Based Architecture for Constraint Programming. In: Shi, ZZ., Sadananda, R. (eds) Agent Computing and Multi-Agent Systems. PRIMA 2006. Lecture Notes in Computer Science(), vol 4088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802372_58
Download citation
DOI: https://doi.org/10.1007/11802372_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36707-9
Online ISBN: 978-3-540-36860-1
eBook Packages: Computer ScienceComputer Science (R0)