1 February 2020 in Journal of Physics: Conference Series
A novel algorithm which is an ensemble of two metaphor-less algorithms is presented in this paper. The algorithm is inspired by Rao-1 and Jaya algorithms. Since the algorithm always plays around with the best and worst solutions; the algorithm is named as Best-Worst-Play (BWP) algorithm. The algorithm does not require any algorithm specific parameters, however, algorithm control parameters are required. To test the effectiveness and performance of the proposed algorithm, a number of unconstrained and constrained benchmark functions are considered. It is found that proposed algorithm has outperformed several well-established metaphor based algorithms. The proposed BWP algorithm may be used by researchers to solve the unconstrained and constrained optimization problems
1 January 2015 in Aquatic Procedia
30 October 2023 in Adaptive Behavior
Any odor cue can be traced to find its release source. So-called “source localization” has been observed in animals in many important tasks including finding food or mates. In particular, the scientific community for a long time focused on unraveling the complex behavior of moths while in pursuit of sex pheromones emitted by their distant female counterpart. These studies have provided many insights including details of the flight paths, sensory organs, and pheromone processing. In turn, this knowledge has provided inspiration to engineers and researchers to devise source-seeking algorithms, whereas sensory organs/-mechanisms led to insect-machine hybrid systems. Therefore, this review revolves around these last two approaches specifically (1) the implementation of moth-inspired algorithms in robotic platforms and the (2) use of biosensors such as antennae or insect-machine hybrid systems.
1 April 2020 in International Journal of Ambient Computing and Intelligence
Algorithms with limited intelligence are unable to localize an odor source in an indoor environment with weak or no airflow. Stage wise solutions to odor source localization has been provided with a novel engineered algorithm called veco-taxis for plume traversal. It finds turn angles by calculating concentration gradients using vector algebra-based search algorithms. Levy walk is used in the plume finding phase. The concept of last chemical detection points (LCDPs) has been adopted for source declaration. The success rate of implemented algorithms is quantified using minimum and maximum move lengths—a key parameter—during source localization. A unified success and performance index (SPI) of the search algorithm is presented for the first time. SPI uncovers implicit parameters accountable for success in locating source and considers a qualitative performance. Higher SPIs are observed when the move length in plume finding is minimum and kept smaller than the plume traversal move length by some factor. It has been also demonstrated through simulations that veco-taxis is superior to the E. coli algorithm. Request access from your librarian to read this article's full text.