Core Concepts
Simple Braitenberg-style heuristics can emerge to efficiently navigate a complex partially observable visual labyrinth task, without the need for complex deep learning architectures or explicit memory mechanisms.
Abstract
The paper investigates the ability to evolve navigation strategies for the ViZDoom 'My Way Home' (MWH) labyrinth task, which requires an agent to navigate through a complex partially observable visual environment to reach a goal. The authors use the Tangled Program Graphs (TPG) genetic programming approach, which is constrained to a simple instruction set of arithmetic operations, to discover emergent Braitenberg-style behaviors for the task.
The key findings are:
TPG agents are able to successfully navigate the MWH labyrinth, while a baseline Deep Q-Network (DQN) agent fails to do so. This suggests that the TPG approach is able to discover simple yet effective navigation heuristics.
Analysis of the TPG champion agents reveals that they have developed Braitenberg-style behaviors, such as:
Seeking out a room's wall after spawning in the center of a room
Alternating the direction of a slow arcing trajectory after pursuing a wall-following behavior
Reorienting after encountering a room's corner
The TPG solutions are remarkably simple, indexing less than 1% of the original high-dimensional visual state space per decision. This is in contrast to previous work that required complex deep learning architectures and memory mechanisms to solve similar tasks.
Further experiments in an empty room scenario without a goal demonstrate that the TPG agent's navigation heuristic is a general reactive behavior, not dependent on the presence of the goal.
The authors conclude that the constraints imposed on the TPG approach, such as the limited instruction set, introduce a bias towards discovering simple Braitenberg-style heuristics for navigation, rather than more complex deep learning solutions. This highlights the potential of such approaches to uncover emergent behaviors that are efficient, interpretable, and suitable for deployment on resource-constrained platforms.