Abstract
The partitioning of sets or graphs is an exhaustively researched topic in classic and modern computer science. We consider this area from a new point of view by developing algorithms for partitioning with only very limited abilities and knowledge of the individual elements, restricted to the direct, local environment of the single elements (locality). In our approach the elements or vertices of the graph are represented by agents and the edges illustrate communication lines between two agents. Several partitioning strategies will be presented and compared with each other and we will explain the most promising one for multiple target partitioning in a detailed way.
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.
References
M. R. Garey, D.S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci., 1, 237–267, 1976
Bruce Hendrickson and Robert Leland, A multilevel algorithm for partitioning graphs, Proc. Supercomputing’ 95, San diego, ACM Press, New York, 1995
A. J. Soper, C. Walshaw and M. Cross, A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning, Journal of Global Optimization 29, 225–241, 2004
C. A. Jones, Vertex and Edge Partitions of Graphs, PdS thesis, Penn State, Dept. Computer Science, State College, PA, 1992
Vincenzo Gervasi, Giuseppe Prencipe, Coordination without Communication: The Case of the Flocking Problem, Elsevier Science, January 2003
Eric Bonabeau, Marco Dorigo, Guy Theraulaz, Swarm Intelligence-From natural to artificial Systems, Oxford University Press, 1999
James Kennedy, Russel C. Eberhart, Swarm Intelligence, Morgan Kaufmann, 2001
Craig W. Reynolds, Flocks, herds and schools: A distributed behaviour model, Proceedings of SIGGRAPH’87. Reprinted in Computer Graphics 21 (4):25–34, 1987
Wei-Min Shen, Cheng-Ming Chuong, Peter Will, Simulating Self-Organization for Multi-Robot Systems, Int. Conference on Intelligent and Robotic Systems, Switzerland, 2002
D. W. Palmer, M. Kirschenbaum et. al. Using a Collection of Humans as an Execution Testbed for Swarm Algorithms, IEEE Swarm Intelligence Symposium, p.58–64, 2003
Andreas Goebels, Hans Kleine Büning, Steffen Priesterjahn, Alexander Weimer, Towards Online Partitioning of Agent Sets based on Local Information, Proceedings of the International Conference on Parallel and Distributed Computing and Networks (PDCN), 2005
David J. Bruemmer, Donald D. Dudenhoeffer, et al., A Robotic Swarm for Spill Finding and Perimeter Formation, Spectrum 2002, Reno, NV, 2002
P.-P. Grassé, La théorie de la stigmergie: essai d’interprétation du comportement des termites constructeurs, Insectes Sociaux, 1959
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
Goebels, A., Büning, H.K., Priesterjahn, S., Weimer, A. (2005). Multi Target Partitioning of Sets Based on Local Information. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_133
Download citation
DOI: https://doi.org/10.1007/3-540-32391-0_133
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25055-5
Online ISBN: 978-3-540-32391-4
eBook Packages: EngineeringEngineering (R0)