Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mutation, Gene Flow, and Genetic Drift01:09

Mutation, Gene Flow, and Genetic Drift

65.6K
In a population that is not at Hardy-Weinberg equilibrium, the frequency of alleles changes over time. Therefore, any deviations from the five conditions of Hardy-Weinberg equilibrium can alter the genetic variation of a given population. Conditions that change the genetic variability of a population include mutations, natural selection, non-random mating, gene flow, and genetic drift (small population size).
65.6K
Mismatch Repair01:20

Mismatch Repair

6.9K
Organisms are capable of detecting and fixing nucleotide mismatches that occur during DNA replication. This sophisticated process requires identifying the new strand and replacing the erroneous bases with correct nucleotides. Mismatch repair is coordinated by many proteins in both prokaryotes and eukaryotes.
The Mutator Protein Family Plays a Key Role in DNA Mismatch Repair
The human genome has more than 3 billion base pairs of DNA per cell. Prior to cell division, that vast amount of genetic...
6.9K
Mismatch Repair01:36

Mismatch Repair

44.5K
Overview
44.5K
Mutations in Microorganisms01:18

Mutations in Microorganisms

999
Mutations are heritable changes in an organism’s genome involving alterations in the base sequence of DNA or RNA. These changes can influence cellular processes and phenotypic traits, potentially transforming the unaltered wild type into a mutant form. Such changes, termed forward mutations, are pivotal in shaping the genetic diversity of organisms.RNA viruses exhibit the highest mutation rates due to the absence of robust proofreading mechanisms during genome replication. In contrast,...
999
In-vitro Mutagenesis01:16

In-vitro Mutagenesis

17.5K
To learn more about the function of a gene, researchers can observe what happens when the gene is inactivated or “knocked out,” by creating genetically engineered knockout animals. Knockout mice have been particularly useful as models for human diseases such as cancer, Parkinson’s disease, and diabetes.
17.5K
Mutations01:39

Mutations

95.7K
Overview
95.7K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Monitoring of ultra-high performance concrete manufacturing for reproducible quality and waste reduction.

Scientific reports·2025
See all related articles

Related Experiment Video

Updated: Mar 15, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

12.3K

Performance impact of mutation operators of a subpopulation-based genetic algorithm for multi-robot task allocation

Chun Liu1, Andreas Kroll2

  • 1School of Automation, Beijing University of Posts and Telecommunications, No 10, Xitucheng Road, 100876 Beijing, China ; Department of Measurement and Control, Mechanical Engineering, University of Kassel, Mönchebergstraße 7, 34125 Kassel, Germany.

Springerplus
|September 3, 2016
PubMed
Summary
This summary is machine-generated.

A new genetic algorithm efficiently solves multi-robot task allocation problems, especially those with cooperative tasks. The study found specific mutation operators, like inversion and swap-inversion, yield superior results for complex industrial inspections.

Keywords:
Constrained combinatorial optimizationGenetic algorithmsMulti-robot task allocationMutation operatorsSubpopulation

More Related Videos

Following the Dynamics of Structural Variants in Experimentally Evolved Populations
04:52

Following the Dynamics of Structural Variants in Experimentally Evolved Populations

Published on: February 3, 2023

1.4K
Optogenetic Random Mutagenesis Using Histone-miniSOG in C. elegans
04:51

Optogenetic Random Mutagenesis Using Histone-miniSOG in C. elegans

Published on: November 14, 2016

9.8K

Related Experiment Videos

Last Updated: Mar 15, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

12.3K
Following the Dynamics of Structural Variants in Experimentally Evolved Populations
04:52

Following the Dynamics of Structural Variants in Experimentally Evolved Populations

Published on: February 3, 2023

1.4K
Optogenetic Random Mutagenesis Using Histone-miniSOG in C. elegans
04:51

Optogenetic Random Mutagenesis Using Histone-miniSOG in C. elegans

Published on: November 14, 2016

9.8K

Area of Science:

  • Robotics
  • Artificial Intelligence
  • Operations Research

Background:

  • Multi-robot task allocation is a complex combinatorial optimization problem.
  • Cooperative tasks in multi-robot systems introduce significant spatial and temporal constraints.
  • Existing methods may struggle with the complexity of cooperative task allocation.

Purpose of the Study:

  • To develop an efficient algorithm for multi-robot task allocation, particularly for cooperative tasks.
  • To analyze the impact of various mutation operators within a genetic algorithm framework.
  • To compare the performance of the proposed algorithm against a standard genetic algorithm.

Main Methods:

  • A subpopulation-based, crossover-free genetic algorithm employing mutation operators and elitism selection was developed.
  • The algorithm was tested on industrial plant inspection problems, including those with cooperative tasks.
  • Various mutation operators (swap, insertion, inversion, displacement, and combinations) were analyzed.

Main Results:

  • The proposed genetic algorithm outperformed a binary tournament genetic algorithm with partially mapped crossover.
  • Inversion mutation was most effective for non-cooperative tasks.
  • A combination of swap and inversion mutations proved superior for cooperative tasks.

Conclusions:

  • The subpopulation-based genetic algorithm is effective for multi-robot task allocation, especially with cooperative constraints.
  • Mutation operator selection is crucial; combined operators (e.g., swap-inversion) offer enhanced performance.
  • The findings suggest using multiple mutation operators for similar combinatorial optimization problems.