DocumentCode
1880052
Title
Swarm reasoning
Author
Palmer, Daniel ; Kirschenbaum, Marc ; Shifflet, Jason ; Seiter, Linda
Author_Institution
Math. & Comput. Sci. Dept., John Carroll Univ., Cleveland, OH, USA
fYear
2005
fDate
8-10 June 2005
Firstpage
294
Lastpage
301
Abstract
This paper presents a new technique, the hypothesis swarm problem-solving technique (HSPT), that allows swarms to operate on more complex problems in a general way that produces solutions faster than traditional swarms by emerging compatible sub-solutions cooperatively. Instead of agents simply reacting to their own stimuli, they produce hypotheses about their environment to resolve discovered conflicts. As they gather supporting or refuting evidence for their hypothesis, we force a higher level of social interaction - requiring them to compare their evidence with other agents. They reward compatible hypotheses and devalue conflicting ones, encouraging acceptance of mutually supporting hypotheses. We demonstrate the effectiveness of this approach on graph-coloring and round-robin scheduling problems and also compare its efficiency with other swarm techniques including brute force, reactive swarms and ant colony optimization algorithms.
Keywords
graph colouring; optimisation; problem solving; ant colony optimization algorithm; graph coloring; hypothesis swarm problem-solving technique; round-robin scheduling problem; swarm reasoning; Ant colony optimization; Autonomous agents; Computer science; Detectors; Mathematics; Problem-solving; Resource management; Robots; Round robin; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Swarm Intelligence Symposium, 2005. SIS 2005. Proceedings 2005 IEEE
Print_ISBN
0-7803-8916-6
Type
conf
DOI
10.1109/SIS.2005.1501635
Filename
1501635
Link To Document