AI Safety4 min read

Solution space path planning: SSPPV for MUAC, 3.69 ms paths

SSPPV with zone-based conflict detection found conflict-free en-route paths in 3.69 ms on average in MUAC Delta sector scenarios on a 5 nmi.

The Brieftide

TL;DR

  • 01SSPPV with zone-based conflict detection found conflict-free en-route paths in 3.69 ms on average in MUAC Delta sector scenarios on a 5 nmi.
  • 02The paper, arXiv:2607.00064, was submitted on 30 Jun 2026 and evaluates the method using scenarios based on the Delta sector of the Maastricht Upper Area Control Centre on a 5 nmi grid.
  • 03The paper develops a conflict-free path-planning algorithm that exposes all feasible safe actions in a solution-space display and is intended to fit how controllers reason about routing.

Yiyuan Zou, Wenying Lyu and Clark Borst present a solution-space path-planning algorithm designed for en-route Air Traffic Control, and they report that SSPPV paired with zone-based conflict detection computed paths in 3.69 ms on average in operational-relevant scenarios. The paper, arXiv:2607.00064, was submitted on 30 Jun 2026 and evaluates the method using scenarios based on the Delta sector of the Maastricht Upper Area Control Centre on a 5 nmi grid.

What did the authors build and why

The paper develops a conflict-free path-planning algorithm that exposes all feasible safe actions in a solution-space display and is intended to fit how controllers reason about routing. The algorithm integrates three intent-based conflict detection methods — distance-based, time-interval-based, and zone-based — inside a solution-space framework, and it proposes two search-node formulations: vertex-based (SSPPV) and edge-based (SSPPE). The design priorities the interpretability and flexibility of solution-space displays and explicitly encodes operational constraints controllers use, such as separation standards, maneuverability limits, waypoint minimization and routing practicality.

How was performance measured and what were the results

SSPPV combined with zone-based conflict detection achieved the best measured performance, computing paths in 3.69 ms on average in the MUAC Delta scenarios on a 5 nmi grid. The study compares computational speed and solution quality across the two node variants, SSPPV and SSPPE, and across the three conflict-detection methods, though the paper flags SSPPV plus zone-based detection as the top performer in the evaluated operational-relevant scenarios.

Why the solution-space approach matters

The authors frame operational adoption as hindered by a mismatch between algorithmic priorities and air traffic controllers' needs. By exposing all feasible safe actions in an interpretable display and by aligning algorithmic logic with controller decision rules, the approach aims to reduce that gap. Faster path computation and explicit support for controller constraints make the method a practical candidate for decision-support tools in tactical control, not merely a theoretical planner.

What to watch

Look for demonstrations or trials beyond the MUAC Delta sector and direct comparisons between SSPPV/SSPPE runs with different conflict-detection methods on the same operational scenarios. Adoption will hinge on whether the solution-space displays and the algorithmic choices translate into usable decision-support in live or high-fidelity simulation environments.

Authors: Yiyuan Zou, Wenying Lyu, Clark Borst. arXiv:2607.00064, submitted 30 Jun 2026.

Solution-space path planning components
Solution-space frameworkSSPPV (vertex-based)SSPPE (edge-based)Distance-based detectionTime-interval-based detectionZone-based detectionOperational constraints (separation, maneuverability, waypoints)MUAC Delta sector scenarios (5 nmi grid)
Advertisement

Written by The Brieftide · Source: arXiv

The Brieftide Daily · 06:00

Briefs like this one, in your inbox every morning.

 

FreeOne email a dayEvery claim sourcedUnsubscribe in one click

Continue reading

More in AI Safety
Advertisement