Bflier's: A Novel Butterfly Inspired Multi-robotic Model in Search of Signal Sources

The diversified ecology in nature had various forms of swarm behaviors in many species. The butterfly species is one of the prominent and a bit insightful in their random flights and converting that into an artificial metaphor would lead to enormous possibilities. This paper considers one such metaphor known as Butterfly Mating Optimization (BMO). In BMO, the Bfly follows the patrolling mating phenomena and simultaneously captures all the local optima of multimodal functions. To imitate this algorithm, a mobile robot (Bflybot) was designed to meet the features of the Bfly in the BMO algorithm. Also, the multi-Bflybot swarm is designed to act like butterflies in nature and follow the algorithm's rules. The real-time experiments were performed on the BMO algorithm in the multi-robotic arena and considered the signal source as the light source. The experimental results show that the BMO algorithm is applicable to detect multiple signal sources with significant variations in their movements i.e., static and dynamic. In the case of static signal sources, with varying initial locations of Bflybots, the convergence is affected in terms of time and smoothness. Whereas the experiments with varying step-size leads to their variation in the execution time and speed of the bots. In this work, experiments were performed in a dynamic environment where the movement of the signal source in both maneuvering and non-maneuvering scenarios. The Bflybot swarm is able to detect the single and multi-signal sources, moving linearly in between two fixed points, in circular, up and down movements.To evaluate the BMO phenomenon, various ongoing and prospective works such as mid-sea ship detection, aerial search applications, and earthquake prediction were discussed.Comment: 12 pages, 17 figure

Data-Driven Predictive Modeling to Enhance Search Efficiency of Glowworm-Inspired Robotic Swarms in Multiple Emission Source Localization Tasks

In time-sensitive search and rescue applications, a team of multiple mobile robots broadens the scope of operational capabilities. Scaling multi-robot systems (\u3c 10 agents) to larger robot teams (10 – 100 agents) using centralized coordination schemes becomes computationally intractable during runtime. One solution to this problem is inspired by swarm intelligence principles found in nature, offering the benefits of decentralized control, fault tolerance to individual failures, and self-organizing adaptability. Glowworm swarm optimization (GSO) is unique among swarm-based algorithms as it simultaneously focuses on searching for multiple targets. This thesis presents GPR-GSO—a modification to the GSO algorithm that incorporates Gaussian Process Regression (GPR) based data-driven predictive modeling—to improve the search efficiency of robotic swarms in multiple emission source localization tasks. The problem formulation and methods are presented, followed by numerical simulations to illustrate the working of the algorithm. Results from a comparative analysis show that the GPR-GSO algorithm exceeds the performance of the benchmark GSO algorithm on evaluation metrics of swarm size, search completion time, and travel distance

Retina Based Glowworm Swarm Optimization for Random Cryptographic Key Generation

ان توليد المفاتيح المستندة إلى المقاييس الحيوية يمثل استخدام الميزات المستخرجة من السمات التشريحية (الفسيولوجية) البشرية مثل بصمات الأصابع أو شبكية العين أو السمات السلوكية مثل التوقيع. تتميز القياسات الحيوية لشبكية العين بمتانة متأصلة، وبالتالي، فهي قادرة على توليد مفاتيح عشوائية بمستوى أمان أعلى مقارنة مع السمات الحيوية الأخرى. في السنوات الأخيرة ، اكتسبت خوارزميات التحسين المستوحاة من الطبيعة شعبية كبيرة في معالجة المشكلات الواقعية الصعبة وحل وظائف التحسين المعقدة التي لا تتوفر فيها الحلول الفعلية. في هذه الورقة ، تم اقتراح نظام فعال لتوليد مفاتيح عشوائية آمنة وقوية وفريدة من نوعها تستند إلى ميزات شبكية العين لتطبيقات التشفير. يتم استخراج ميزات شبكية العين باستخدام خوارزمية تحسين سرب الدودة المتوهجة (GSO)  والتي توفر نتائج واعدة من خلال التجارب باستخدام قواعد بيانات شبكية العين القياسية. بالإضافة إلى ذلك، من أجل توفير مفاتيح عشوائية عالية الجودة وغير متوقعة وغير مجددة، تم استخدام الخريطة الفوضوية في النظام المقترح. حيث يتضمن النظام المقترح أربع مراحل رئيسية: التقاط صورة شبكية العين باستخدام أي كاميرا شبكية موجودة في الأسواق, أو باستخدام قاعدة البيانات المتاحة والتي تسمى DRIONS-DB,  ثم معالجتها معالجة اولية، ثم فصل صورة شبكية العين المعالجة مسبقًا إلى أربعة أجزاء باستخدام تحويل مويجات الهار المنفصلة ذات المستوى الواحد (DWHT), بعد ذلك ، يتم استخدام النطاق الفرعي ذو التردد المنخفض (LL) للمرحلة التالية حيث يمثل النطاق الفرعي التشغيلي, بعد ذلك ، يتم استخراج الميزات المثلى باستخدام خوارزمية تحسين سرب الدودة المتوهجة (GSO)، وأخيرًا يتم دمج الميزات المثلى مع الخريطة الفوضوية لإنشاء مفتاح التشفير العشوائي. في النتائج التجريبية، تم استخدام التحليل الإحصائي NIST الذي يتضمن عشرة اختبارات إحصائية للتحقق من عشوائية مفتاح البت الثنائي المولد. مفاتيح التشفير العشوائية التي تم الحصول عليها كانت ناجحة في اختبارات التحليل الإحصائي NIST ، بالإضافة إلى درجة كبيرة من اللامركزية.The biometric-based keys generation represents the utilization of the extracted features from the human anatomical (physiological) traits like a fingerprint, retina, etc. or behavioral traits like a signature. The retina biometric has inherent robustness, therefore, it is capable of generating random keys with a higher security level compared to the other biometric traits. In this paper, an effective system to generate secure, robust and unique random keys based on retina features has been proposed for cryptographic applications. The retina features are extracted by using the algorithm of glowworm swarm optimization (GSO) that provides promising results through the experiments using the standard retina databases. Additionally, in order to provide high-quality random, unpredictable, and non-regenerated keys, the chaotic map has been used in the proposed system. In the experiments, the NIST statistical analysis which includes ten statistical tests has been employed to check the randomness of the generated binary bits key. The obtained random cryptographic keys are successful in the tests of NIST, in addition to a considerable degree of aperiodicity

Review of Metaheuristics and Generalized Evolutionary Walk Algorithm

Metaheuristic algorithms are often nature-inspired, and they are becoming very powerful in solving global optimization problems. More than a dozen of major metaheuristic algorithms have been developed over the last three decades, and there exist even more variants and hybrid of metaheuristics. This paper intends to provide an overview of nature-inspired metaheuristic algorithms, from a brief history to their applications. We try to analyze the main components of these algorithms and how and why they works. Then, we intend to provide a unified view of metaheuristics by proposing a generalized evolutionary walk algorithm (GEWA). Finally, we discuss some of the important open questions.Comment: 14 page

A fuzzy c-means bi-sonar-based Metaheuristic Optimization Algorithm

Fuzzy clustering is an important problem which is the subject of active research in several real world applications. Fuzzy c-means (FCM) algorithm is one of the most popular fuzzy clustering techniques because it is efficient, straightforward, and easy to implement. Fuzzy clustering methods allow the objects to belong to several clusters simultaneously, with different degrees of membership. Objects on the boundaries between several classes are not forced to fully belong to one of the classes, but rather are assigned membership degrees between 0 and 1 indicating their partial membership. However FCM is sensitive to initialization and is easily trapped in local optima. Bi-sonar optimization (BSO) is a stochastic global Metaheuristic optimization tool and is a relatively new algorithm. In this paper a hybrid fuzzy clustering method FCB based on FCM and BSO is proposed which makes use of the merits of both algorithms. Experimental results show that this proposed method is efficient and reveals encouraging results

Root Shoot Coordination Optimization: Conceptualizing Ascent of Sap and Translocation of Solute in Plant

A new nature inspired evolutionary technique called Root Shoot Coordination Optimization (RSCO) has been proposed here. This optimization method has been developed on the basis of conduction procedure of plant. Water and solute i.e. food circulation phenomena maximizes on the fruitful coordination between root and leaves/shoot. This circulation procedure in plant incorporates two vital processes which are ascent of sap and translocation of food. Ascent of sap occurs due to the combined effect of adhesion and cohesion tension of water molecules and transpiration pull for the evaporation of water through stomata of shoot. Translocation of food takes place due to the pressure difference of solute in the shoot and root. This thought has been mathematically modeled as a new soft computing tool. This method has been tested for some benchmark problems. This method showed its effectiveness with encouraging results