Abstract
This paper introduces a problem solving method involving independent agents and a set of partial solutions. In the Iterative Multi-Agent (IMA) method, each agent knows about a subset of the whole problem and can not solve it all by itself. An agent picks a partial solution from the set and then applies its knowledge of the problem to bring that partial solution closer to a total solution. This implies that the problem should be composed of subproblems, which can be attended to and solved independently. When a realworld problem shows these characteristics, then the design and implementation of an application to solve it using this method is straightforward. The solution to each sub-problem can affect the solutions to other sub-problems, and make them invalid or undesirable in some way, so the agents keep checking a partial solution even if they have already worked on it. The paper gives an example of constraint satisfaction problem solving, and shows that the IMA method is highly parallel and is able to tolerate hardware and software faults. Considerable improvements in search speed have been observed in solving the example constraint satisfaction problem.
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
P. S. Eaton, E. C. Freuder, “Agent Cooperation Can Compensate For Agent Ignorance In Constraint Satisfaction”, AAAI-96 Workshop on Agent Modeling, August 4–8, 1996, Portland, Oregon.
J. Knopp and M. Reich, “A Workpool Model for Parallel Computing”, Proceedings of the First International Workshop on High Level Programming Models and Supportive Environments (HIPS), 1996.
B. A. Nadel, “Constraint satisfaction algorithms”, Computational Intelligence, No. 5, 1989.
B.J. Nelson, “Fault-Tolerant Computing: Fundamental Concepts”, IEEE Computer, vol. 23, July 1990
A. S. Tanenbaum, Distributed Operating Systems, Prentice-Hall International, 1995.
M. Yokoo, E. H. Durfee, T. Ishida, K. Kuwabara, “The Distributed Constraint Satisfaction Problem: Formalization and Algorithms”, IEEE Transactions on Knowledge and Data Engineering, vol. 10, No 5, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karimi, K. (2000). The Iterative Multi-agent Method for Solving Complex Search Problems. In: Hamilton, H.J. (eds) Advances in Artificial Intelligence. Canadian AI 2000. Lecture Notes in Computer Science(), vol 1822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45486-1_31
Download citation
DOI: https://doi.org/10.1007/3-540-45486-1_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67557-0
Online ISBN: 978-3-540-45486-1
eBook Packages: Springer Book Archive