The two missing ingredients, according to the team, are time and topology. Most existing approaches treat a trajectory as a sequence of spatial points and compare those sequences geometrically, while handling the temporal dimension only crudely, if at all. The problem is that a trip down the same street at 8 a.m. and the same trip at 8 p.m. can be radically different experiences, shaped by rush-hour congestion, signal timing, and traffic flow patterns that change across the day and the week. Existing methods, the authors note, neither explicitly integrate the temporal information of GPS trajectories with the topology of the road network, nor adapt flexibly to dynamically changing time granularity, because they rely on fixed time slices. A framework locked into rigid hourly buckets, for example, cannot smoothly distinguish a pattern that repeats every fifteen minutes from one that unfolds over a whole day.

The proposed solution is called STTF, short for Spatial-Temporal and Topological Fusion. The framework begins by constructing a knowledge graph that captures relationships among multiple nodes in a road network, effectively aligning raw GPS trajectories with the streets they actually travel on. This is an important shift in perspective. Rather than treating a trajectory as a free-floating cloud of latitude-longitude points, STTF grounds every observation in the physical structure of the city, where intersections connect to road segments and segments connect to one another in a rich web of spatial relationships. Map-matching techniques of the kind long used in navigation systems make this alignment possible, but STTF goes further by encoding the network itself as a graph that the model can learn from.

Once the knowledge graph is built, the framework turns to Knowledge Graph Embedding, or KGE, techniques borrowed from the field of representation learning. These methods, popularized in artificial intelligence research for encoding entities and relations in large knowledge bases, learn compact numerical vectors, or embeddings, for each node and each relation in the graph. In STTF, the result is a fused graph in which the geometry of the road network and the movement patterns of trajectories are expressed in a shared mathematical space. Road segments that play similar roles in the network, or that carry similar traffic, end up with similar embeddings, giving the model a topological vocabulary it can use when comparing trips that may never visit exactly the same points.

The second major innovation addresses the temporal dimension through multi-granularity encoding. Instead of committing to a single fixed time slice, STTF applies both a day encoding matrix and a week encoding matrix, allowing the model to represent time at multiple scales simultaneously. A day encoding captures where a trip falls within the daily rhythm of the city, distinguishing the morning commute from the midnight lull, while a week encoding distinguishes weekday patterns from weekend ones. Because these encodings operate at multiple granularities, the framework can adapt to dynamically changing temporal patterns rather than forcing all phenomena into one arbitrary resolution. This flexibility matters for real applications, where the meaningful timescale of a pattern, whether it is a fifteen-minute delivery window or a weekly shopping rhythm, varies from one dataset to the next.

At the heart of the framework sits a spatial-temporal topology fusion module, the component that explicitly marries temporal information with road network topology. The module uses an attention mechanism, the same class of technique that powers modern language models, to learn topological embeddings from the fused graph, deciding which parts of the network context deserve emphasis for a given trajectory. It then jointly models four kinds of information: segment embeddings describing the road segments traversed, temporal embeddings capturing when the movement occurred, positional embeddings encoding where each observation sits within the sequence, and road type information describing the character of the streets involved, such as highways versus local roads. The output is a single fused representation of the entire trajectory, a vector that condenses space, time, and network structure into one comparable form.

Training the model requires no manually labeled examples of similar and dissimilar trajectories, a significant practical advantage given how expensive such labels are to produce. Instead, STTF learns through self-supervised learning driven by two loss functions. The first is a contrastive loss, an approach inspired by recent breakthroughs in self-supervised image representation learning, which teaches the model to pull representations of related trajectories closer together while pushing unrelated ones apart. The second is a masked language model loss, adapted from the pre-training recipe behind models like BERT, in which parts of the input are hidden and the model must reconstruct them, forcing it to internalize the statistical structure of movement through the road network. Together, these objectives let the framework learn meaningful trajectory representations directly from raw data.

The researchers evaluated STTF on two real-world datasets, pitting it against six mainstream baseline methods for trajectory similarity computation. The framework consistently surpassed all of them, achieving state-of-the-art performance. The baselines it outperformed represent the main lineages of prior work: classical geometric measures that compare point sequences directly, graph-based neural approaches that model road networks with architectures such as graph attention networks and residual LSTMs, and earlier self-supervised frameworks that fused spatial and temporal signals but, in the authors’ assessment, failed to integrate them with network topology explicitly or to handle time granularity adaptively. The consistent margin across datasets suggests that the fusion of topology and multi-granular time is not a marginal refinement but a substantive source of modeling power.

The implications reach well beyond the benchmark tables. Trajectory similarity is a foundational primitive for downstream applications including trajectory clustering, data compression, and intelligent route planning, so improvements at this level propagate outward. Better similarity measures could sharpen anomaly detection, helping cities spot unusual traffic events or suspicious movement patterns; they could improve ride-sharing matching by identifying trips that genuinely overlap in space and time; and they could make route recommendation systems more sensitive to when a journey happens, not just where. The self-supervised design is particularly consequential for deployment, because it means the framework can be trained on whatever trajectory data a city or logistics operator already possesses, without the bottleneck of human annotation.

The work also illustrates a broader trend in machine learning research: the migration of techniques between domains. Knowledge graph embeddings arrived from semantic web and question-answering research, attention mechanisms and masked pre-training from natural language processing, and contrastive learning from computer vision. STTF assembles these ingredients around a problem with distinctly geographic structure, the topology of a road network, and in doing so demonstrates how multimodal fusion, the deliberate combination of heterogeneous information sources, can outperform models that consider space and time in isolation. The authors report no competing interests and received no external funding for the study. As urban datasets continue to swell, frameworks that respect both the geometry of streets and the rhythms of the clock are likely to become the standard against which future trajectory models are measured.

Subject of Research: Trajectory similarity computation using spatial-temporal and topological fusion with knowledge graph embeddings and self-supervised learning

Article Title: A spatial-temporal and topological fusion framework for trajectory similarity computation

Article References: A spatial-temporal and topological fusion framework for trajectory similarity computation. (n.d.). https://doi.org/10.1007/s10489-026-07472-y

Image Credits: AI Generated

DOI: 10.1007/s10489-026-07472-y

Keywords: trajectory similarity, knowledge graph embedding, self-supervised learning, road network topology, spatial-temporal fusion, attention mechanism, contrastive learning, masked language model, GPS trajectories, urban data analysis, route planning, trajectory clustering

The appeal of so-called frozen orbits is well established. These are orbits whose size, shape, and orientation remain nearly constant in a frame rotating with the Moon, requiring almost no propellant to maintain. The Lunar Reconnaissance Orbiter demonstrated the payoff: by carefully selecting a polar frozen orbit, the mission used only 33.9 kilograms of hydrazine over twelve years for all of its station-keeping, phasing, and momentum management. Frozen orbits could similarly support extended surface observation campaigns, communications relays, and even the tracking of orbital debris or derelict hardware from past missions, such as the Apollo-era lunar module ascent stages that may still circle the Moon.

Traditionally, frozen orbits have been found analytically. Researchers construct an averaged dynamical model that strips out short-period oscillations, then solve for equilibrium points in the averaged equations. These classical analyses predict that frozen orbits occur under specific conditions: when the mean argument of perilune, the point of closest approach, sits near plus or minus 90 degrees; when the mean eccentricity is zero; or when the argument of perilune equals 0 or 180 degrees. The trouble is that averaging discards real physics, and the resulting predictions must be verified by propagating trajectories in a high-fidelity model that includes a detailed lunar gravity field and the true ephemerides of the Earth and Sun. Scaling that verification across the whole phase space has always been the bottleneck.

Bosanac and Miceli attacked the bottleneck directly. They defined over 1.1 million initial conditions at a fixed epoch, sampling orbital elements coarsely across semi-major axes up to 2,038 kilometers, eccentricities, inclinations from 0 to 180 degrees, and the full range of nodal longitudes and arguments of perilune. Each initial state was propagated for up to 180 days in a demanding dynamical model: a 100 by 100 degree-and-order spherical harmonic lunar gravity field, drawn from the GRGM900C model derived from GRAIL data, combined with the point-mass gravity of the Earth and Sun positioned according to the DE421 ephemerides. Integrations used a high-order Runge-Kutta scheme with tight tolerances of ten to the minus eleventh, terminating early if the spacecraft struck a spherical Moon of radius 1,738 kilometers.

Of the initial conditions tested, 638,181 trajectories survived at least three lunar rotational periods, roughly 81.9 days, and entered the analysis. Rather than storing every point along every path, the researchers represented each trajectory by its sequence of perilunes, the moments of closest approach, which capture the long-period evolution of the orbit’s eccentricity and orientation. Each perilune was described by two compact coordinates, p and q, equal to the eccentricity times the cosine and sine of the argument of perilune. These coordinates encode both the shape of the orbit and the direction in which its low point points, and they trace out distinctive loops and curves as the orbit evolves in the Moon-fixed frame.

The clustering itself relied on DBSCAN, a density-based algorithm that groups points lying in sufficiently crowded neighborhoods while labeling isolated points as noise. Because the dataset was too large to process at once, it was split into 64 partitions of roughly 10,000 trajectories each. Within each partition, trajectories were grouped if their perilune sequences moved through the pq-plane along similar paths at similar times, judged by unit tangent vectors sampled every half day. Local clusters were then merged across partitions and across different initial phasings, using shape-based feature vectors and a graph structure whose connected components defined the final groupings. The outcome was striking: 638,181 trajectories collapsed into just 885 global clusters, a reduction of three orders of magnitude in the information an analyst must examine.

From selected clusters, the team manually extracted sets of long-lifetime orbits, defined as trajectories showing limited drift in the pq-plane over the full 180 days. These orbits appear at discrete combinations of initial semi-major axis and inclination, and in many cases, shifting the initial longitude of the ascending node rotates the entire groundtrack geometry without changing the underlying orbital evolution. At a semi-major axis of 1,808 kilometers and an inclination of 85 degrees, for example, three different nodal longitudes produced long-lifetime orbits whose perilune groundtracks circled the north pole, circled the south pole, or swept across both hemispheres, all while the eccentricity and argument of perilune evolved in nearly identical fashion. That flexibility matters for mission design, because the groundtrack determines which terrain a spacecraft observes.

The comparison with classical theory was largely reassuring, with intriguing exceptions. Most of the recovered long-lifetime orbits cluster around arguments of perilune near plus or minus 90 degrees or encircle zero eccentricity in the pq-plane, exactly as analytical frozen orbit theories predict. The overall shapes of the mean eccentricity curves as a function of inclination also match the families derived by Lara in 2011 and later refined by Yarndley and colleagues. But at initial inclinations of 65 and 115 degrees, the numerical search surfaced low-drift orbits with mean arguments of perilune as far as 30 to 60 degrees away from the predicted minus 90 degrees. When the authors extended two of these trajectories to nearly twenty years, some remained tightly bounded, hinting at frozen orbits that the averaged theories miss, while others drifted substantially under longer-period oscillations governed by multiple frequencies.

The method also recovered orbits that analytical approaches cannot touch by construction. Resonant trajectories, whose perilune sequences form looping paths in the pq-plane, are typically excluded from averaged derivations, yet the clustering search found them naturally at low inclinations. Several results echoed earlier numerical work: orbits at 95 degrees inclination showed oscillation periods of 27.43 to 27.54 days, close to the 27.35-day repeat groundtrack period reported by Russell and Lara in 2007, and near-equatorial long-lifetime orbits resembled those designed for the DARE radio astronomy concept by Plice and colleagues.

The authors are careful to frame the work as a proof of concept. The initial conditions were sampled coarsely, at a single epoch, and only over 180 days, so some families may be missing and some orbits may not persist indefinitely. Extracting representative orbits from clusters is still manual, and automating that step is ongoing work. Even so, the demonstration is compelling: a data-mining pipeline can compress a million brute-force simulations into a compact, interpretable summary that agrees with decades of theory while exposing solutions theory overlooked. As NASA and its partners plan sustained lunar operations under Artemis, tools like this could quietly become as important as the rockets, ensuring that the spacecraft placed around the Moon stay there without burning fuel they cannot spare.

Subject of Research: Numerical identification of long-lifetime low lunar orbits using trajectory clustering in a high-fidelity lunar gravity model

Article Title: Numerical exploration of low lunar, long-lifetime orbits

Article References: Bosanac, N., & Miceli, G. E. (2026). Numerical exploration of low lunar, long-lifetime orbits. Celestial Mechanics and Dynamical Astronomy, 138(5), Article 61. https://doi.org/10.1007/s10569-026-10334-x

Image Credits: AI Generated

DOI: 10.1007/s10569-026-10334-x

Keywords: lunar orbits, frozen orbits, trajectory clustering, celestial mechanics, lunar gravity field, mission design, DBSCAN, perilune, space situational awareness, astrodynamics, Lunar Reconnaissance Orbiter, ephemeris model