Modular robot path planning using genetic algorithm based on gene pool

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As a new generation of robotics, a modular robot is flexible enough to achieve self-replication by attaching a new modular, or perform self-assembly by transferring into different shapes. However, the path planning for modular robots, the fundamental function is seldom studied until now. In this paper, we improve the path schedule method of Molecubes, by designing a gene pool, to speed the convergence and avoid the uncertain of the original genetic algorithm (GA). Experiments show that the gene-pool based GA outperforms the old one in both success rate and speed in planning the long path. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zhong, H., Li, Z., Zhang, H., Yu, C., & Li, N. (2010). Modular robot path planning using genetic algorithm based on gene pool. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6382 LNCS, pp. 380–389). https://doi.org/10.1007/978-3-642-16493-4_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free