Evolving Generalised Maze Solvers

نویسندگان

  • David Peter Shorten
  • Geoff S. Nitschke
چکیده

This paper presents a study of the efficacy of comparative controller design methods that aim to produce generalised problem solving behaviours. In this case study, the goal was to use neuro-evolution to evolve generalised maze solving behaviours. That is, evolved robot controllers that solve a broad range of mazes. To address this goal, this study compares objective, non-objective and hybrid approaches to direct the search of a neuro-evolution controller design method. The objective based approach was a fitness function, the non-objective based approach was novelty search, and the hybrid approach was a combination of both. Results indicate that, compared to the fitness function, the hybrid and novelty search evolve significantly more maze solving behaviours that generalise to larger and more difficult maze sets. Thus this research provides empirical evidence supporting novelty and hybrid novelty-objective search as approaches for potentially evolving generalised problem solvers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Physical maze solvers. All twelve prototypes implement 1961 Lee algorithm

We overview experimental laboratory prototypes of maze solvers. We speculate that all maze solvers implement Lee algorithm by first developing a gradient of values showing a distance from any site of the maze to the destination site and then tracing a path from a given source site to the destination site. All prototypes approximate a set of many-source-one-destination paths using resistance, ch...

متن کامل

Maze solvers demystified and some other thoughts

There is a growing interest towards implementation of maze solving in spatially-extended physical, chemical and living systems. Several reports of prototypes attracted great publicity, e.g. maze solving with slime mould and epithelial cells, maze navigating droplets. We show that most prototypes utilise one of two phenomena: a shortest path in a maze is a path of the least resistance for fluid ...

متن کامل

A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic

The branch-and-bound framework has already been successfully applied in SAT-modulo-theories (SMT) solvers to check the satisfiability of linear integer arithmetic formulas. In this paper we study how it can be used in SMT solvers for non-linear integer arithmetic on top of two real-algebraic decision procedures: the virtual substitution and the cylindrical algebraic decomposition methods. We im...

متن کامل

Deployment of a Large-scale Peer-to-Peer Social Network

We present the design and architecture of the Maze filesharing and social network. Maze is one of the first large-scale deployments of an academic research project, with over 210,000 registered users and more than 10,000 users online at any time, sharing over 140 million files. Maze includes an evolving incentive structure, and simple mechanisms for providing network locality. We outline the Ma...

متن کامل

Evolving Effective Incremental Solvers for Sat with a Hyper-heuristic Framework Based on Genetic Programming

Hyper-heuristics could simply be defined as heuristics to choose other heuristics. In other words, they are methods for combining existing heuristics to generate new ones. In this paper, we use a grammar-based genetic programming hyperheuristic framework. The framework is used for evolving effective incremental solvers for SAT. The evolved heuristics perform very well against well-known local s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015