A Taxonomy of Cooperative Search Algorithms

Author(s):  
Mohammed El-Abd ◽  
Mohamed Kamel
2004 ◽  
Vol 30 (1) ◽  
pp. 57-79 ◽  
Author(s):  
Michel Toulouse ◽  
Teodor Gabriel Crainic ◽  
Brunilde Sansó

2000 ◽  
Vol 26 (1) ◽  
pp. 91-112 ◽  
Author(s):  
Michel Toulouse ◽  
Teodor Gabriel Crainic ◽  
K Thulasiraman

MENDEL ◽  
2020 ◽  
Vol 26 (2) ◽  
pp. 1-8
Author(s):  
Tarek El-Mihoub ◽  
Christoph Tholen ◽  
Lars Nolle

Localisation errors have a great impact on Autonomous Underwater Vehicles (AUVs) as search agents. Different approaches for solving the localisation problem can be used and combined together for greater accuracy in estimating AUVs’ locations. The effect of localisation errors on locating a target can be lightened by designing a search algorithm that avoids extensive use of exact lo-cation information. In this paper, two cooperative search algorithms are proposed and evaluated. In these algorithms, a high-level mechanism is employed for building a global view of the search space using minimum possible search information. These algorithms rely on low-level search algorithms with exploring roles. Particle Swarm Optimisation (PSO) and all-to-one Self-Organising Migrating Algorithm (SOMA) are selected as high-level mechanisms. The conducted experiments demonstrate that both algorithms show a robust behaviour within a range of localisation errors.


2010 ◽  
Vol 33 (7) ◽  
pp. 1127-1139
Author(s):  
Da-Ming ZHU ◽  
Shao-Han MA ◽  
Ping-Ping ZHANG

Author(s):  
S. V. Skvortsov ◽  
◽  
T. A. Fetisova ◽  
D. V. Fetisov ◽  
◽  
...  

2020 ◽  
Vol 37 (2) ◽  
pp. 1-8
Author(s):  
David Schmidtz

Abstract This essay introduces basic issues that make up the topic of freedom of thought, including newly emerging issues raised by the current proliferation of Internet search algorithms.


Sign in / Sign up

Export Citation Format

Share Document