Variations in evolution of subsumption architectures using genetic programming: the wall following robot revisited

Authors:
Steven J. Ross;Jason M. Daida;Chau M. Doan;Tommaso F. Bersano-Begey;Jeffrey J. McClain
Affiliations:
The University of Michigan, Ann Arbor, Michigan;The University of Michigan, Ann Arbor, Michigan;The University of Michigan, Ann Arbor, Michigan;The University of Michigan, Ann Arbor, Michigan;The University of Michigan, Ann Arbor, Michigan
Venue:
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Year:
1996

Citing 6
Cited 1

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
Evolution of obstacle avoidance behavior: using noise to promote robust solutions

Advances in genetic programming
The automatic generation of plans for a mobile robot via genetic programming with automatically defined functions

Advances in genetic programming
Evolution of a subsumption architecture that performs a wall following task for an autonomous mobile robot

Proceedings of the workshop on Computational learning theory and natural learning systems (vol. 2) : intersections between theory and experiment: intersections between theory and experiment
A Distributed Model for Mobile Robot Environment-Learning and Navigation

A Distributed Model for Mobile Robot Environment-Learning and Navigation

Associative model for solving the wall-following problem

MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

The wall following robot is examined as a potential benchmark problem for applications of genetic programming (GP) to emergent robotic behavior. This paper describes experiments that were performed to characterize the performance, solution space, search space, and robustness using GP with and without automatically defined functions (ADFs). GP with ADFs was unable to significantly outperform GP without ADFs on this problem. A sub-optimal modality was discovered across all four program architectures. Many of the optimal solutions that were discovered tended to limit the number of sensors used for wall-following behavior; some used as few as three sensors. Tests for robustness indicate a "handedness" to the evolved solutions, which does seem to contribute to solution brittleness.