DocumentCode
3253612
Title
Extending the shortest-path swarm algorithm to cycle detection
Author
Berridge, Kevin ; Seitzer, Jennifer
fYear
2005
fDate
7-10 Aug. 2005
Firstpage
931
Abstract
Swarm programming is a method that uses many simple agents to collectively perform a complex task. The approach is based on the emergent behavior of a swarm of simple agents as they interact with each other and the environment. The swarming algorithms of our work extend the shortest path swarm agent algorithm. In this paper, we present four swarm algorithms used to discover graph cycles, along with respective performance analyses
Keywords
multi-agent systems; particle swarm optimisation; software agents; cycle detection; graph cycles; shortest-path swarm agent algorithm; swarm programming; Algorithm design and analysis; Animals; Birds; Insects; Performance analysis; Problem-solving; Shortest path problem; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2005. 48th Midwest Symposium on
Conference_Location
Covington, KY
Print_ISBN
0-7803-9197-7
Type
conf
DOI
10.1109/MWSCAS.2005.1594255
Filename
1594255
Link To Document