The Wavefront Route

Aircraft routing through wind fields is an optimization problem: find the path that minimizes fuel consumption (and therefore emissions) given that wind speeds and directions vary across space. The standard approach discretizes the airspace into a graph and searches for shortest paths. The discretization limits the solution — the optimal path may not align with the graph edges.

The eikonal equation provides a continuous alternative (arXiv:2603.11830). In optics, the eikonal equation describes how wavefronts propagate through media with varying refractive index. The travel time from a source to any point is the solution of a partial differential equation. Replace the refractive index with the effective ground speed (airspeed plus wind) and the wavefront becomes a fuel-cost front expanding from the departure airport. The optimal path to any destination is the ray perpendicular to the cost front — the continuous analog of Dijkstra’s algorithm without discretization.

The mathematical subtlety lies at cut loci — boundaries where wavefronts from different directions meet. Near a cut locus, two nearly-optimal paths converge from different directions, and small numerical errors can cause the algorithm to follow the wrong one. The authors use finite element error analysis to establish safety zones around cut loci, guaranteeing that for destinations sufficiently far from these boundaries, the computed path is globally optimal.

The eikonal formulation turns flight routing into wave propagation. The optimal path is not computed by searching; it is traced by following the gradient of a field that already encodes all possible routes.