In 1996, James Sethian showed something almost unfair...you can find shortest routes through a messy world by letting a wave expand once...no trial paths, no search beams, just one growing front.
Here’s how: we solve for an arrival-time field T(x,y) so that T literally means how long the wave needs to reach this point. The rule is ||∇ T|| = 1/F, where the medium is fast (F large) the front sprints, where it’s slow it trudges, and obstacles are speed ≈ 0, so the front wraps around them because that’s the only way forward.
Then comes the satisfying part: once T exists, a path doesn’t need to search at all...drop a bead anywhere and let it follow ẋ ∝ -∇ T, it slides downhill on the time landscape and traces a globally fastest route back to the source. This “wave = optimal control” viewpoint is exactly what Tsitsiklis (1995) made precise from the Hamilton-Jacobi side...compute the value/arrival-time function and the optimal trajectories fall out from it.
#FastMarching #EikonalEquation