Skip to content

Research Reproduction · Python

Genetic-Algorithm-Based-Recovery-to-a-Nominal-Planner-Path

A GA-powered planner used to recover from corner case ADAS scenarios

What it is

This repository implements a genetic algorithm-based approach to recover a nominal planner path for a kinematic bicycle vehicle, as specified in ga_nominal_path_recovery_spec.pdf. It includes modules for path representation, vehicle dynamics, scenario generation, objective function, validation, and the GA optimizer, along with experiments and visualization tools.

Scored at4ac8e1313 Nov 2026Changes since

Merit describes the code at this commit. Later pushes count once the owner rescans. How merit is scored

Where it counts

  • Machine Learning80%
  • AI Agents20%
  • Data Science10%

How much of the project is about each field, as scoring counts it. It ranks in the field it is most about.

What the judge found

Read from the project's code at its scored commit.

Strengths3

  • Modular and well-organized codebase separating concerns (path, vehicle, scenario, objective, GA, etc.).
  • Comprehensive experimentation framework with CLI, configuration system, and ablation studies.
  • Includes an independent validator to ensure the feasibility of GA-generated solutions.

Limitations

The owner keeps this project's limitations private.

Around it on the Machine Learning board

Whole board
  1. 28, shared ranksilico-e4b-sae-runML Application · Python62.0/100AdvancedRick
  2. 28, shared rankvid-factoryML Application · JavaScript62.0/100AdvancedJarad Peckenpaugh
  3. 31Genetic-Algorithm-Based-Recovery-to-a-Nominal-Planner-PathResearch Reproduction · Python61.5/100AdvancedSuceveanu Mircea Dan Sandu
  4. 32GithubStarsManagerML Application · TypeScript61.0/100Advancedtamina
  5. 33, shared rankEmblaV2Training Experiment · HTML60.8/100Advancedeze770

More from Suceveanu Mircea Dan Sandu