C++20, Python, ROS2 (Nav2, plugin development), Git and CI/CD, Docker
Isaac Sim, MuJoCo, Gazebo, Unity, sim-to-real transfer
PyTorch, TensorFlow, TensorRT, computer vision, LLM integration
JD humanoid, Unitree Go1, Jetson Nano, ESP32 and LoRa, bare-metal C/C++
Eight of these run here, in your browser.
Six are the project's own algorithm, ported line for line, and recompute the results committed in its repository; one serves the committed certified intervals and grades a score against them; one is a toy with the C++ core's costs. A test in this site's own repository checks each of the seven against its repository on every change.
1 · Safety verifierDraw a route. The verifier judges it.
Lay waypoints on a real occupancy map, or load what two language models proposed, and the same checks that gate Nav2 say safe or rejected, with the waypoint that failed.
Reproduces all 80 recorded verdicts, two models on six maps
2 · Navigation shieldWatch a bad route get repaired, or halted.
Verify the proposal, plan a recovery on the inflated grid, re-verify with both judges. Seal the goal and it halts rather than invent a path.
Reproduces 50 recorded decisions and 38 recovered paths waypoint for waypoint
3 · ESP32-CAM firmwareWave at your camera. The firmware decides.
The shipped downsampler and detector, running on your frames in this tab: 192 block means, the cells that changed, the alert line. Nothing leaves the browser.
The exact pipeline from the repository, with a synthetic scene if there is no camera
4 · Plan checkerEdit a robot's plan and watch where it breaks.
Pick a trap, read what a model answered, then change the plan: skip a door, carry the knife into the nursery, and the checker names the step and the rule.
Reproduces all 1,350 recorded verdicts across four models
5 · Tool-call validatorBreak a tool call. See which layer catches it.
Rename the tool, break the schema, point at an object that does not exist; the structural and the contract layer answer separately, as recorded.
Reproduces every recorded bucket and all 262 constructed cases
6 · Exact predicatesMove a point by one ulp. Float lies. Exact does not.
Adversarial cases from the committed corpus, with the floating-point and the exact predicate run side by side and the determinants shown.
Every corpus case: exact verdict as committed, float wrong where recorded
7 · Certified intervalsType a planner's score. The band says what it means.
Thirty-two certified intervals by world and budget: inside the band, below a trajectory that exists, or above a ceiling that nothing can cross.
Served data equals the committed suite row for row, zero violations
8 · D* Lite against A*Block the robot. Count what each planner redoes.
A wall lands in the route; D* Lite repairs the plan it has, A* starts from nothing, and the cell counts sit side by side. Both checked against Dijkstra.
A toy with the C++ core's exact integer costs; not a repository result
Start with these four.
The four that say most about how I work. Each has its code, its tests and its limits on its own page.
An LLM proposes a route, a deterministic verifier checks it, and a provably correct planner recovers a safe one. When no safe path exists it halts, in 10/10 such cases, and invents nothing. Code
A deterministic gate between LLM planners and Nav2. Collision, continuity and map-bounds checks reject hallucinated trajectories before a controller sees them. Code
Every instruction either admits a valid plan or plants exactly one trap, and a deterministic checker scores each model reply with no human or LLM judge. Code
An upper bound on legibility over every admissible trajectory under a path cost budget, not only the ones somebody tried. Code
Deterministic firmware for a commercial intrusion-detection prototype, built under contract for Muxtronics. No ML and no vision libraries anywhere. Code
A* and D* Lite as Nav2 plugins over a ROS-free core, validated against Dijkstra with exact integer arithmetic across 185,237 fuzzed replans. Code
LLM tool calls that parse, type-check and validate, and still break the contract. A schema check, which is what most agent frameworks do, passes 39 of 40 of these calls. Code
Geometric predicates that cannot be wrong, grown from a real D* Lite bug where two keys that should have been equal differed by the smallest step a double can take. Exactness costs about 2x here, not orders of magnitude. Code
Legibility against path cost and constraints, computed exactly. Three language models called 116 of 120 trajectories legible, including all 25 that were not physically possible. Code
A school management system that runs Safina International day to day: seven roles, prorated billing, payroll, and an append-only audit trail. I am the sole engineer. Showcase repo
A sim-to-real pipeline on the JD humanoid so a gestural and a spoken condition could be delivered identically to 20 participants; under review at Robotics (MDPI). Write-up (PDF)
Ten of these projects are also explained without the jargon, with the same numbers and the same stated limits. A side interest in numerical analysis lives there too: finite-time blowup in one-dimensional fluid models.
All code on GitHubPlain-language guides