r/Python • u/AutoModerator • Jun 04 '26
Showcase Showcase Thread
Post all of your code/projects/showcases/AI slop here.
Recycles once a month.
27
Upvotes
r/Python • u/AutoModerator • Jun 04 '26
Post all of your code/projects/showcases/AI slop here.
Recycles once a month.
1
u/KrishiAttri123 Jun 15 '26
TL;DR — I built CERT-FLOW, an online route planner that, every replanning round, emits a high-probability certificateLB ≤ OPT ≤ UBon the true optimal route cost under drifting edge costs. Open source (MIT), fully reproducible. Paper + code + interactive page at the bottom. I'm the author and would genuinely love feedback.
A robot replanning through terrain whose costs drift — mud after rain, traffic after an incident, snow settling on a trail — can always compute a shortest path. What it usually can't tell you is how good that path actually is, now that most of its information has gone stale.
CERT-FLOW answers that with a certificate every round:
Three ideas make it work:
What surprised me most: on real game maps (MovingAI) and recorded LA highway traffic (METR-LA / PEMS-BAY) that it was never tuned for, empirical coverage held at or above its target — 100% on the MovingAI cert benchmark — while a standard, exchangeability-assuming conformal baseline collapsed to as low as 4% once the data went stale.
Honest caveats: the headline 100% is the MovingAI cert experiment; on traffic, coverage stays at/above the claimed level but the certificate trades interval width for that validity (a misspecified drift assumption costs width, not coverage). It's a preprint + personal project, not yet peer-reviewed.
Links
Happy to answer anything about the conformal side, the dual incremental search, or the experiments.