SEED-Nav: a robot that navigates by evolution
SEED-Nav is an autonomous navigation robot that puts genetic algorithms to work on real, low-cost hardware. It evolves its own navigation behavior from experience and stores that experience as virtual DNA — a working demonstration of the ideas in this site's primers, moving across a room.
The idea in one paragraph
Robots navigate badly when the world is cluttered and unpredictable. SEED-Nav's answer is a hybrid: an always-on reactive layer keeps the robot safe (avoid obstacles, don't drive off a ledge), while a genetic algorithm slowly tunes how it navigates — the thresholds and timings that govern its behavior — by treating each outing as an experiment. Every run is scored, the best settings are bred and mutated, and the next generation drives a little better. Its memories are stored as strings of A/T/G/C, a literal genetic encoding.
SEED-Nav — Stored Episodic Evolutionary DNA Navigation: experiential memory as virtual chromosomes, navigation policy refined by a genetic algorithm, perception ready to grow from simple ranging into full LiDAR SLAM.
Where the genetic algorithm comes in
This is the part most relevant to NovaGenetica. SEED-Nav's navigation parameters — obstacle and clearance distances, back/turn/probe timings, speed caps, slew limits — form a bounded vector of numbers. That vector is the genome.
The robot runs an exploration episode for a fixed time budget, then returns home. Each episode produces a summary of how it went — how many obstacles it hit, how much time it spent avoiding them, how far it progressed, whether it made it back — and a fitness score is computed from those numbers:
fitness(episode) =
w_L · distance_progress
− w_O · obstacle_encounters
− w_C · cliff_events
− w_A · time_spent_avoiding
+ w_H · returned_home_successfully
From there it's the textbook genetic-algorithm loop: keep the elite parameter sets, breed new candidates with crossover, apply bounded mutation, and redeploy — but never let an evolved value escape safe limits. Hard bounds and the safety layer mean evolution can tune behavior but can't make the robot reckless.
Keeping evolution healthy
Evaluating a genome means actually driving the robot, so scores are noisy and expensive — exactly the conditions where a GA can collapse onto a mediocre answer too soon (premature convergence). SEED-Nav uses the standard countermeasures from the GA primer: tournament selection from a wide parent pool, a few random "immigrant" genomes each generation, and a mutation boost that kicks in when population diversity drops. Elitism is kept only for stability.
Memory as virtual DNA
SEED-Nav's other distinctive idea is its memory substrate. Every salient event — startup, obstacle, return-home trigger, arrival — is written as a chromosome: a canonical A/T/G/C string that encodes the data, with a small metadata index for fast retrieval. Bytes map to nucleotides two bits at a time, wrapped in an envelope with a checksum.
This is a computational use of "DNA," not a biological one — the appeal is that everything storable (episodes, policies, map fragments) becomes one uniform, inspectable, append-only text format. It also fits the evolution metaphor neatly: the same chromosomes that record experience can be selected, mutated, recombined, and replayed.
The six layers
SEED-Nav is organized as a layered autonomy stack. Lower layers keep the robot safe no matter what the higher layers are doing — a design borrowed from behavior-based robotics.
- L0 Reactive safety & clearance — always on: brake → back → turn → probe.
- L1 Reactive navigation primitives — the basic movement behaviors.
- L2 Perception — touchless range sensors (cliff + overhead) and a low-cost 2D LiDAR scan.
- L3 Mapping / localization — optional 2D LiDAR SLAM for map-based homing.
- L4 Episodic DNA memory — events and episodes written as chromosomes.
- L5 Evolutionary adaptation — the genetic algorithm over navigation parameters, plus post-hoc hazard maps.
Evolving the map, too
Beyond tuning parameters, SEED-Nav can evolve a coarse picture
of its environment. After a batch of episodes, obstacle and
cliff events are aggregated into a hazard/hotspot grid — a
MAP_DELTA chromosome — that biases later
exploration away from repeatedly troublesome spots. It's
incremental environmental knowledge that doesn't require running
full SLAM during the real-time safety loop.
Offline-first, AI-optional
The robot needs no cloud and no Wi-Fi to function — the control loop and memory are entirely local, and it can evolve purely from onboard experience. Because the full history is persisted as chromosomes, heavier analysis (natural-language mission summaries, clustering recurrent failure motifs, re-running SLAM at higher compute) can happen later, when docked or on a workstation, without ever putting a network in the critical path.
Why it belongs on NovaGenetica
SEED-Nav is a compact, honest example of a genetic algorithm doing real work: a clearly defined genome, a fitness function grounded in actual robot runs, the standard selection/crossover/ mutation machinery, and the standard diversity safeguards — all constrained by hard safety bounds. If the GA primer explained the theory, this is the theory with wheels.
Read the full paper
This page summarizes the technical paper "Stored Episodic Evolutionary DNA Navigation (SEED-Nav): DNA-Encoded Memory, Genetic-Algorithm Adaptation, and LiDAR/SLAM-Ready Navigation" by Darin R. Molnar, PhD (Shoreline Consulting Group, February 2026). The full paper includes the complete mathematical and algorithmic specification, the control-loop design, the DNA encoding scheme, and the references — free to read and share.
10 pages · ~190 KB PDF. Please cite as: Molnar, D. R. (2026), Stored Episodic Evolutionary DNA Navigation (SEED-Nav), Shoreline Consulting Group.