Abstract
Motivated by the pitfalls of collaborative problem solving in [121], [123], solution quality and communication efficiency, in this chapter [113], [117] we set forth some important requirements to avoid these pitfalls and inspect the literature for possible solutions. We state a lack of self-organization research on the individual level of agency rather than on the social level. On this basis, the AuReCon problem of finding a good configuration for a given distributed constraint optimization problem is formalized as a constraint optimization problem itself and proven to be at least NP-complete.
In the main section our concept to solve this problem is presented - the controlled usage of local reconfiguration operations called agent melting and agent splitting. In a detailed analysis we investigate the properties of this concept, namely its relation to the structure of the AuReCon problem, its impact on the underlying collaborative problem solving process and its sufficiency to solve the AuReCon problem. In addition, we investigate concurrency and autonomy issues in AuReCon.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2002). 4. Autonomous Dynamic Reconfiguration — Improving Collaborative Problem Solving. In: Hannebauer, M. (eds) Autonomous Dynamic Reconfiguration in Multi-Agent Systems. Lecture Notes in Computer Science(), vol 2427. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45834-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-45834-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44312-4
Online ISBN: 978-3-540-45834-0
eBook Packages: Springer Book Archive