Abstract
In this paper, a multiagent algorithm for dynamic clustering is presented. This kind of clustering is intended to manage mobile data and so, to be able to continuously adapt the built clusters. First of all, potential applications of this algorithm are presented. Then the specific constraints for this kind of clustering are studied. A multiagent architecture satisfying these constraints is described. It combines an ants algorithm with a cluster agents layer which are executed simultaneously. Finally, the first experimental results of our work are presented. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Fournier, D., Simon, G., & Mermet, B. (2007). A dynamic clustering algorithm for mobile objects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4702 LNAI, pp. 422–429). Springer Verlag. https://doi.org/10.1007/978-3-540-74976-9_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
