scholarly journals Achieving task allocation in swarm intelligence with bi-objective embodied evolution

2021 ◽  
Author(s):  
Qihao Shan ◽  
Sanaz Mostaghim
Keyword(s):  
Random Walk ◽  
Swarm Intelligence ◽  
Task Allocation ◽  
Fitness Function ◽  
Pareto Frontier ◽  
Weighted Sum ◽  
Objective Functions ◽  
Nsga Ii ◽  
Self Organized ◽  
Baseline Algorithm

AbstractIn this paper, we seek to achieve task allocation in swarm intelligence using an embodied evolutionary framework, which aims to generate divergent and specialized behaviors among a swarm of agents in an online and self-organized manner. In our considered scenario, specialization is encouraged through a bi-objective composite fitness function for the genomes, which is the weighted sum of a local and a global fitness function. The former depends only on the behavior of an agent itself, while the latter depends on the effectiveness of cooperation among all nearby agents. We have tested two existing variants of embodied evolution on this scenario and compared their performances against those of an individual random walk baseline algorithm. We have found out that those two embodied evolutionary algorithms have good performances at the extreme cases of weight configurations, but are not adequate when the two objective functions interact. We thus propose a novel bi-objective embodied evolutionary algorithm, which handles the aforementioned scenario by controlling the proportion of specialized behaviors via a dynamic reproductive isolation mechanism. Its performances are compared against those of other considered algorithms, as well as the theoretical Pareto frontier produced by NSGA-II.

NECESSITY FROM CHANCE: SELF-ORGANIZED REPLICATION OF SYMMETRIC PATTERNS THROUGH SYMMETRIC RANDOM INTERACTIONS

2009 ◽  
Vol 19 (04) ◽  
pp. 1185-1225
Author(s):  
ANDRÉ BARBÉ
Keyword(s):  
Random Walk ◽  
Fitness Function ◽  
Basic Algorithm ◽  
Random Interactions ◽  
Self Organized ◽  
Symmetric Configuration ◽  
Geometric Symmetry ◽  
Absorbing States ◽  
State Configuration ◽  
Symmetric Patterns

We present an algorithm, completely random in nature, that, without invoking a fitness function or purposeful design, produces symmetric replicas in a population of so-called cellicules. Cellicules consist of "cells" arranged in a structure with geometric symmetry S. Each cell has one of two possible states, thus defining a state-configuration pattern on a cellicule. The algorithm acts recurrently on a population of cellicules, possibly randomly initialized, through a random "copying interaction" between two randomly selected cellicules that first undergo a random reorientation in accordance with the symmetry S. The dynamics of the algorithm is analyzed in detail for several symmetries. This shows that it is a random walk with absorbing states which correspond to a population in which all cellicules have an identical S-symmetric configuration pattern. We discuss some aspects concerning the evolution of cellicule-populations under mixing and mutation, and some variations on the basic algorithm.

A Space Division Multiobjective Evolutionary Algorithm Based on Adaptive Multiple Fitness Functions

2016 ◽  
Vol 30 (03) ◽  
pp. 1659005 ◽  
Author(s):  
Mingzhao Wang ◽  
Yuping Wang ◽  
Xiaoli Wang
Keyword(s):  
Pareto Front ◽  
Multiobjective Programming ◽  
Fitness Function ◽  
Weighted Sum ◽  
Objective Functions ◽  
Nondominated Solutions ◽  
Fitness Functions ◽  
Space Division ◽  
Objective Space ◽  
Distributed Solutions

The weighted sum of objective functions is one of the simplest fitness functions widely applied in evolutionary algorithms (EAs) for multiobjective programming. However, EAs with this fitness function cannot find uniformly distributed solutions on the entire Pareto front for nonconvex and complex multiobjective programming. In this paper, a novel EA based on adaptive multiple fitness functions and adaptive objective space division is proposed to overcome this shortcoming. The objective space is divided into multiple regions of about the same size by uniform design, and one fitness function is defined on each region by the weighted sum of objective functions to search for the nondominated solutions in this region. Once a region contains fewer nondominated solutions, it is divided into several sub-regions and one additional fitness function is defined on each sub-region. The search will be carried out simultaneously in these sub-regions, and it is hopeful to find more nondominated solutions in such a region. As a result, the nondominated solutions in each region are changed adaptively, and eventually are uniformly distributed on the entire Pareto front. Moreover, the complexity of the proposed algorithm is analyzed. The proposed algorithm is applied to solve 13 test problems and its performance is compared with that of 10 widely used algorithms. The results show that the proposed algorithm can effectively handle nonconvex and complex problems, generate widely spread and uniformly distributed solutions on the entire Pareto front, and outperform those compared algorithms.

Multi-criteria optimization of the four-finger gripper mechanism

2020 ◽  
Vol 8 (4) ◽  
pp. 276-286
Author(s):  
Vu Duc Quyen ◽  
Andrey Ronzhin
Keyword(s):  
Multicriteria Optimization ◽  
Kinematic Model ◽  
Objective Functions ◽  
Nsga Ii ◽  
Suction Nozzle

Three posterior algorithms NSGA-II, MOGWO and MOPSO to solve the problem of multicriteria optimization of the robotic gripper design are considered. The description of the kinematic model of the developed prototype of the four-fingered gripper for picking tomatoes, its limitations and objective functions used in the optimization of the design are given. The main advantage of the developed prototype is the use of one actuator for the control of the fingers and the suction nozzle. The results of optimization of the kinematic model and the dimensions of the elements of robotic gripper using the considered posterior algorithms are presented.

Multi-Objective Trajectory Optimization of Free-Floating Space Manipulator Using NSGA-II

2015 ◽  
Vol 713-715 ◽  
pp. 800-804 ◽  
Author(s):  
Gang Chen ◽  
Cong Wei ◽  
Qing Xuan Jia ◽  
Han Xu Sun ◽  
Bo Yang Yu
Keyword(s):  
Trajectory Optimization ◽  
Interpolation Method ◽  
Optimal Solution ◽  
Optimization Method ◽  
Joint Space ◽  
Motion Path ◽  
Objective Functions ◽  
Nsga Ii ◽  
Space Manipulator ◽  
Multi Objective

In this paper, a kind of multi-objective trajectory optimization method based on non-dominated sorting genetic algorithm II (NSGA-II) is proposed for free-floating space manipulator. The aim is to optimize the motion path of the space manipulator with joint angle constraints and joint velocity constraints. Firstly, the kinematics and dynamics model are built. Secondly, the 3-5-3 piecewise polynomial is selected as interpolation method for trajectory planning of joint space. Thirdly, three objective functions are established to simultaneously minimize execution time, energy consumption and jerk of the joints. At last, the objective functions are combined with the NSGA-II algorithm to get the Pareto optimal solution set. The effectiveness of the mentioned method is verified by simulations.

Multi Objective Design Optimization of Two Bar Truss Using NSGA II and TOPSIS

2014 ◽  
Vol 984-985 ◽  
pp. 419-424
Author(s):  
P. Sabarinath ◽  
M.R. Thansekhar ◽  
R. Saravanan
Keyword(s):  
Design Optimization ◽  
Optimization Problems ◽  
Optimization Methods ◽  
Optimal Solutions ◽  
Objective Functions ◽  
Nsga Ii ◽  
Multi Objective ◽  
Total Displacement ◽  
Design Variables ◽  
Conflicting Objectives

Arriving optimal solutions is one of the important tasks in engineering design. Many real-world design optimization problems involve multiple conflicting objectives. The design variables are of continuous or discrete in nature. In general, for solving Multi Objective Optimization methods weight method is preferred. In this method, all the objective functions are converted into a single objective function by assigning suitable weights to each objective functions. The main drawback lies in the selection of proper weights. Recently, evolutionary algorithms are used to find the nondominated optimal solutions called as Pareto optimal front in a single run. In recent years, Non-dominated Sorting Genetic Algorithm II (NSGA-II) finds increasing applications in solving multi objective problems comprising of conflicting objectives because of low computational requirements, elitism and parameter-less sharing approach. In this work, we propose a methodology which integrates NSGA-II and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for solving a two bar truss problem. NSGA-II searches for the Pareto set where two bar truss is evaluated in terms of minimizing the weight of the truss and minimizing the total displacement of the joint under the given load. Subsequently, TOPSIS selects the best compromise solution.

scholarly journals Generalized swarm intelligence algorithms with domain-specific heuristics

2021 ◽  
Vol 10 (1) ◽  
pp. 157
Author(s):  
P. Matrenin ◽  
V. Myasnichenko ◽  
N. Sdobnyakov ◽  
D. Sokolov ◽  
S. Fidanova ◽  
...  
Keyword(s):  
Swarm Intelligence ◽  
Minimum Distance ◽  
Heuristic Algorithms ◽  
Population Based ◽  
Scheduling Problem ◽  
Domain Specific ◽  
Hybrid Approaches ◽  
Self Organized ◽  
Swarm Algorithms ◽  
Tasks Scheduling

<span lang="EN-US">In recent years, hybrid approaches on population-based algorithms are more often applied in industrial settings. In this paper, we present the approach of a combination of universal, problem-free Swarm Intelligence (SI) algorithms with simple deterministic domain-specific heuristic algorithms. The approach focuses on improving efficiency by sharing the advantages of domain-specific heuristic and swarm algorithms. A heuristic algorithm helps take into account the specifics of the problem and effectively translate the positions of agents (particle, ant, bee) into the problem's solution. And a Swarm algorithm provides an increase in the adaptability and efficiency of the approach due to stochastic and self-organized properties. We demonstrate this approach on two non-trivial optimization tasks: scheduling problem and finding the minimum distance between 3D isomers.</span>

scholarly journals A review of swarm intelligence algorithms deployment for scheduling and optimization in cloud computing environments

2021 ◽  
Vol 7 ◽  
pp. e696
Author(s):  
Yousef Qawqzeh ◽  
Mafawez T. Alharbi ◽  
Ayman Jaradat ◽  
Khalid Nazim Abdul Sattar
Keyword(s):  
Cloud Computing ◽  
Swarm Intelligence ◽  
Optimization Problems ◽  
Collective Intelligence ◽  
Pso Algorithm ◽  
Cloud Computing Environment ◽  
Bee Colony ◽  
Self Organized ◽  
Intelligent Behavior ◽  
New Si

Background This review focuses on reviewing the recent publications of swarm intelligence algorithms (particle swarm optimization (PSO), ant colony optimization (ACO), artificial bee colony (ABC), and the firefly algorithm (FA)) in scheduling and optimization problems. Swarm intelligence (SI) can be described as the intelligent behavior of natural living animals, fishes, and insects. In fact, it is based on agent groups or populations in which they have a reliable connection among them and with their environment. Inside such a group or population, each agent (member) performs according to certain rules that make it capable of maximizing the overall utility of that certain group or population. It can be described as a collective intelligence among self-organized members in certain group or population. In fact, biology inspired many researchers to mimic the behavior of certain natural swarms (birds, animals, or insects) to solve some computational problems effectively. Methodology SI techniques were utilized in cloud computing environment seeking optimum scheduling strategies. Hence, the most recent publications (2015–2021) that belongs to SI algorithms are reviewed and summarized. Results It is clear that the number of algorithms for cloud computing optimization is increasing rapidly. The number of PSO, ACO, ABC, and FA related journal papers has been visibility increased. However, it is noticeably that many recently emerging algorithms were emerged based on the amendment on the original SI algorithms especially the PSO algorithm. Conclusions The major intention of this work is to motivate interested researchers to develop and innovate new SI-based solutions that can handle complex and multi-objective computational problems.

Kinematic Multi-Objective Optimization of Circular-Toothed Gerotor Pumps by Genetic Algorithm

2017 ◽  
Author(s):  
Andrew J. Robison ◽  
Andrea Vacca
Keyword(s):  
Genetic Algorithm ◽  
Design Method ◽  
Third Party ◽  
Low Flow ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Generation Algorithm ◽  
Multi Objective ◽  
Pareto Curve

A gerotor gear generation algorithm has been developed that evaluates key performance objective functions to be minimized or maximized, and then an optimization algorithm is applied to determine the best design. Because of their popularity, circular-toothed gerotors are the focus of this study, and future work can extend this procedure to other gear forms. Parametric equations defining the circular-toothed gear set have been derived and implemented. Two objective functions were used in this kinematic optimization: maximize the ratio of displacement to pump radius, which is a measure of compactness, and minimize the kinematic flow ripple, which can have a negative effect on system dynamics and could be a major source of noise. Designs were constrained to ensure drivability, so the need for additional synchronization gearing is eliminated. The NSGA-II genetic algorithm was then applied to the gear generation algorithm in modeFRONTIER, a commercial software that integrates multi-objective optimization with third-party engineering software. A clear Pareto front was identified, and a multi-criteria decision-making genetic algorithm was used to select three optimal designs with varying priorities of compactness vs low flow variation. In addition, three pumps used in industry were scaled and evaluated with the gear generation algorithm for comparison. The scaled industry pumps were all close to the Pareto curve, but the optimized designs offer a slight kinematic advantage, which demonstrates the usefulness of the proposed gerotor design method.

Comparison of Multi-Objective Evolutionary Algorithms to Prioritize Regression Test Cases

2021 ◽  
Vol 9 (12) ◽  
pp. 1445-1454
Keyword(s):  
Fault Detection ◽  
Evolutionary Algorithms ◽  
Fitness Function ◽  
Optimal Solution ◽  
Test Suite ◽  
Test Case ◽  
Test Cases ◽  
Nsga Ii ◽  
Multi Objective ◽  
Regression Test

Regression testing is one of the most critical testing activities among software product verification activities. Nevertheless, resources and time constraints could inhibit the execution of a full regression test suite, hence leaving us in confusion on what test cases to run to preserve the high quality of software products. Different techniques can be applied to prioritize test cases in resource-constrained environments, such as manual selection, automated selection, or hybrid approaches. Different Multi-Objective Evolutionary Algorithms (MOEAs) have been used in this domain to find an optimal solution to minimize the cost of executing a regression test suite while obtaining maximum fault detection coverage as if the entire test suite was executed. MOEAs achieve this by selecting set of test cases and determining the order of their execution. In this paper, three Multi Objective Evolutionary Algorithms, namely, NSGA-II, IBEA and MoCell are used to solve test case prioritization problems using the fault detection rate and branch coverage of each test case. The paper intends to find out what’s the most effective algorithm to be used in test cases prioritization problems, and which algorithm is the most efficient one, and finally we examined if changing the fitness function would impose a change in results. Our experiment revealed that NSGA-II is the most effective and efficient MOEA; moreover, we found that changing the fitness function caused a significant reduction in evolution time, although it did not affect the coverage metric.

Sign in / Sign up

Export Citation Format

Share Document