Bayesian deep learning predicts satellite collisions.
problem Space debris poses planetary risk.
method Bayesian deep learning with LSTM networks.
result Predicts conjunction event evolution with uncertainties.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “satellite collisions”
Machine learning competition predicts spacecraft collision risks.
problem Predicting future collision risks between orbiting satellites.
method Machine learning models trained on satellite collision data.
result Models accurately predicted collision risks with high precision.
Space debris warnings follow a predictable pattern, allowing timely satellite maneuvers.
problem Estimating when fresh information about space debris will arrive.
method Statistical learning model of the message arrival process, specifically a Bayesian Poisson process.
result The average prediction error for the next message arrival time is smaller than baseline predictions.
Due to the lack of information such as the space environment condition and resident space objects' (RSOs') body characteristics, current orbit predictions that are solely grounded on physics-based models may fail to achieve required accuracy for collision avoidance and have led to satellite collisions already. This pap…
Residual neural networks improve collision prediction in planetary simulations.
problem Accurate prediction of planetary collisions in N-body simulations.
method Residual neural networks trained on collision data.
result Residual neural networks outperform existing methods in prediction accuracy and generalization.
Study nonholonomic systems with collisions using variational principles.
problem Variational problems on nonholonomic systems with collisions.
method Extended variational principle, introduced connection on principal bundles, applied Lagrange–Poincaré–Pontryagin reduction.
result Implicit Lagrange–d'Alembert–Pontryagin equations for nonholonomic systems with collisions.
Paper analyzes dynamics of nonholonomic systems with collisions using variational techniques.
problem Analyzing the dynamics of nonholonomic mechanical systems with impacts.
method Variational techniques extended to nonsmooth context for collisions.
result Variational formulation for implicit nonholonomic mechanical systems with energy-momentum preserving collisions.
Model forecasts motor vehicle collision rates with high accuracy.
problem Forecasting motor vehicle collision rates with high accuracy.
method Adopted Heston Stochastic Volatility model and extended it to account for seasonality and accelerated safety periods.
result Short-term forecasts show high accuracy (over 95%) and outperform existing models.
Near-optimal algorithms for private estimation and sequential testing of collision probabilitystat.ML
New algorithms estimate and test collision probability with near-optimal sample complexity.
problem Estimating and testing collision probability in discrete distributions.
method Developed algorithms for -local differential privacy and sequential testing.
result Achieved nearly optimal sample complexity for estimating and testing collision probability.
One approach to designing decision making logic for an aircraft collision avoidance system frames the problem as a Markov decision process and optimizes the system using dynamic programming. The resulting collision avoidance strategy can be represented as a numeric table. This methodology has been used in the developme…
No-collision maps improve manifold learning for image data.
problem Lack of geometric feature sensitivity in traditional distance measures.
method Developed no-collision transportation maps and distances.
result No-collision distances provide isometry for translations and dilations.
A new metric for uncertainty quantification using class collisions.
problem Fine-grained uncertainty quantification in classification problems.
method Introducing the collision matrix and estimating it from one-hot labeled data.
result The collision matrix uniquely recovers the posterior class probability distribution.
Reduces necessary conditions for collision avoidance on curved spaces.
problem Finding non-intersecting trajectories for multiple agents on curved spaces.
method Reduction by Lie group symmetries of variational collision avoidance problems.
result Derives necessary conditions for reduced extremals.
New algorithm for multi-player bandits with collision-dependent rewards.
problem Stochastic multi-player multi-armed bandits with collision-dependent reward distributions.
method Error-Correction Collision Communication (EC3) algorithm.
result EC3 algorithm achieves optimal regret approaching centralized MP-MAB regret.
The paper addresses the Multiplayer Multi-Armed Bandit (MMAB) problem, where decision makers or players collaborate to maximize their cumulative reward. When several players select the same arm, a collision occurs and no reward is collected on this arm. Players involved in a collision are informed about this collis…
Algorithm reduces regret in multi-player bandits with unknown collision rewards.
problem Reducing regret in multi-player multi-armed bandits with unknown collision rewards.
method Proposes an algorithm that combines a modified successive elimination strategy with a communication protocol to estimate suboptimality gaps and coordinate among players.
result Achieves logarithmic regret for the problem when collision reward is unknown.
An important application of intelligent vehicles is advance detection of dangerous events such as collisions. This problem is framed as a problem of optimal alarm choice given predictive models for vehicle location and motion. Techniques for real-time collision detection are surveyed and grouped into three classes: ran…
A new algorithm reduces regret in multi-player bandits without collision info.
problem Decentralized multi-player multi-armed bandits with no collision info.
method EC-SIC algorithm using optimal error correction coding for reward statistics.
result Regret approaches that of centralized with collision info.
A new algorithm RESYNC for defenders against malicious attackers in multi-player bandits.
problem Malicious players colliding with cooperative players to prevent rewards.
method Decentralized and robust algorithm RESYNC for defenders.
result RESYNC algorithm is order-optimal, performing gracefully as the number of collisions increases.
Formula for τ-invariant of satellite knots derived from L-space satellite operators.
problem Calculating the τ-invariant of satellite knots using L-space satellite operators.
method Algorithm to compute knot Floer complexes and formula for τ-invariant.
result Formula recovers existing formulas and proves new properties of τ-invariant.
New algorithms tackle adversarial multi-player bandits with forced-collision communication.
problem No-sensing adversarial multi-player multi-armed bandits (MP-MAB) problem.
method Adversary-Adaptive Collision-Communication (A2C2) algorithms, attackability-aware and unaware settings, information-theoretic tools, error-correction coding.
result Asymptotic attackability-dependent sublinear regret achieved, with or without knowing attackability.
New strategy achieves optimal regret without communication or collisions in multi-player bandit.
problem Cooperative multi-player stochastic multi-armed bandit with shared randomness.
method Combination of combinatorial approach to generalize geometric intuition.
result Achieves near-optimal regret for any number of players and arms without collisions.
In this paper, we construct two families of satellite constructions for Brunnian links, called the satellite sum and the satellite tie. An interesting fact is that by applying the satellite sum and the satellite tie constructions, we can build infinitely many new Brunnian links from any given Brunnian links. With the h…
Novel method decomposes configuration space for improved collision checking.
problem Improving collision checking in high-degree-of-freedom robot motion planning.
method Proposes a configuration space decomposition method to build a composite classifier.
result Composite classifier outperforms state-of-the-art single classifier methods.
Satellite knots can be trivialized by a single band move.
problem Satellite knots and their trivialization.
method Infinite family of satellite knots and a single band move.
result No disjoint band unknotting exists for satellite knots.
This study analyzes satellite communication latency using a stochastic geometry model.
problem Latency analysis of LEO satellite relay communication systems.
method Stochastic geometry framework with spherical BPP models, suboptimal satellite relay selection strategy.
result Derives distance distributions and analytical expressions for transmission delays.
Satellite links of fully positive braids are characterized.
problem Characterizing satellite links of fully positive braids.
method Analyzing fully positive braids and their satellites.
result Satellite links of fully positive braids are characterized by specific conditions.
Any knot in a solid torus, called a pattern or satellite operator, acts on knots in the 3-sphere via the satellite construction. We introduce a generalization of satellite operators which form a group (unlike traditional satellite operators), modulo a generalization of concordance. This group has an action on the set o…
Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.
problem How transformers classify symbols without naming them.
method Logistic classification analysis of transformer-kernel regime, colored collision graph.
result Decomposes learned predictor into ideal template-level classifier and finite-sample perturbation.
We study multiplayer stochastic multi-armed bandit problems in which the players cannot communicate and if two or more players pull the same arm, a collision occurs and the involved players receive zero reward. We consider two feedback models: a model in which the players can observe whether a collision has occurred an…
Satellite links with many twists have simpler companions.
problem Relationship between satellite and companion links' complexity.
method Constructing satellite links with multiple full twists and analyzing their companion links.
result Satellite links with many twists have simpler companion links.
The configuration manifold of a mechanical system consisting of two unconstrained rigid bodies in , , is a manifold with boundary (typically with singularities.) A complete description of the system requires boundary conditions that specify how orbits should be continued after collisions. A b…
Develops a new framework for integrating satellite allocations in small portfolios.
problem Feasibility constraints in small portfolios, not return predictability, are the primary concerns.
method A four-layer feasibility framework: physical, economic, structural, and epistemic.
result Closed-form feasibility bounds on satellite size, turnover, and breadth without return forecasts.
Study motion planning for points avoiding obstacles in a plane.
problem Avoiding collisions for multiple points in a plane with unknown obstacles.
method Algebraic and topological tools for motion planning.
result New topological complexity for planar motion planning.
FedSpace optimizes ML training on satellites and ground stations.
problem Training machine learning models on satellites with limited bandwidth.
method Federated Learning framework that dynamically schedules model aggregation based on satellite orbits.
result Reduces training time by 1.7 days over state-of-the-art algorithms.
New proof for minimizing tunnel systems in satellite chain links.
problem Minimizing the tunnel number of satellite chain links.
method Proving the tunnel number is minimized for links with a specific number of components and bridge number.
result The result is sharp for satellite chain links over a 2-bridge knot.
The Gluck twist preserves the diffeomorphism type of certain satellite 2-knots.
problem Preserving the diffeomorphism type of satellite 2-knots under the Gluck twist.
method Using new descriptions of satellite 2-knots, the paper shows that the Gluck twist does not change the diffeomorphism type of certain satellite 2-knots in three ways.
result The Gluck twist preserves the diffeomorphism type of certain satellite 2-knots.
Researchers compute Khovanov polynomials for satellite knots.
problem Computing Khovanov polynomials for satellite knots.
method Explicit computation using a computer program for two families of satellite knots.
result Khovanov polynomials can be expressed as a linear combination of pattern and companion invariants, with a jump at a critical point.
Satellites and Lorenz knotsmath.GT
New satellite knots counter a conjecture about Lorenz knots.
problem A conjecture about satellite knots and Lorenz knots was disproven.
method Constructed infinitely many counterexamples of satellite knots that are not cables.
result The conjecture was amended and shown to hold for many Lorenz knots.
Formula for satellite operators using knot Floer homology.
problem Computing knot Floer homology for satellite knots.
method Using Heegaard Floer Dehn surgery formulas and formal knot Floer complexes.
result Formulas to compute knot Floer homology for satellite knots.
Satellite formula connects knot concordance invariants to surgery.
problem Understanding knot concordance invariants.
method Excision theorem for real Floer homotopy types.
result Concordance invariants depend only on zero-framed surgery.
We give sufficient conditions for a satellite knot to admit an L-space surgery, and use this result to give new infinite families of patterns which produce satellite L-space knots.
The study computes invariants of satellite knots using bordered Floer homology.
problem Computing invariants of satellite knots with specific patterns.
method Using bordered Floer homology and the immersed curve interpretation of the bordered pairing theorem.
result Satellites with thin fibered companions or specific patterns have thin knot Floer homology.
Necessary and sufficient conditions are given for a satellite knot to be fibered. Any knot embeds in an unknotted solid torus with arbitrary winding number in such a way that no satellite knot with pattern is fibered. In particular, there exist nonfibered satellite knots wit…
A simplified proof for satellite knot signatures.
problem Proving Litherland's formula for satellite knots.
method Uses linear algebra and basic knot theory.
result A new, elementary proof of the signature formula.
Unsupervised method removes satellite noise without paired data.
problem Image artifacts from satellite sensor noises affect quality and applications.
method Wavelet subband cycleGAN using adversarial and cycle-consistency losses.
result Effectively removes satellite noise while preserving high frequency features.
Classifiers for centrality determination in proton-nucleus and nucleus-nucleus collisionsphysics.data-an
Centrality, as a geometrical property of the collision, is crucial for the physical interpretation of nucleus-nucleus and proton-nucleus experimental data. However, it cannot be directly accessed in event-by-event data analysis. Common methods for centrality estimation in A-A and p-A collisions usually rely on a single…
We conjecture that satellite operations are either constant or have infinite rank in the concordance group. We reduce this to the difficult case of winding number zero satellites, and use gauge theory to provide a general criterion sufficient for the image of a satellite operation to generate an infinite rank s…