← News
Tech for Good Tech for Good Frontiers

The System That Knows What It Doesn't Know: Rapid Aerial Target Classification Under Uncertainty

The System That Knows What It Doesn't Know: Rapid Aerial Target Classification Under Uncertainty
Evidential Reasoning Framework Method
88% Accuracy (type classification)
93% Accuracy (intent prediction)
Short Sub-Samples Data requirement

The High-Stakes Moment Before a Missile Launch

Imagine a split-second decision that could determine whether a pilot lives or dies. A blip appears on radar — a fast-moving object closing in at high altitude. Is it a civilian airliner off course, a friendly drone conducting reconnaissance, or an enemy missile inbound? The pilot has maybe three seconds to decide: engage, hold fire, or scramble evasively. Every millisecond of deliberation is a millisecond the threat gets closer.

This is the reality of aerial combat, and it's the problem three researchers from the Indian Institute of Technology Madras have taken on. Their approach, published on arXiv in July 2026, doesn't wait for complete information. Instead, it makes probabilistic decisions from the very first moments of data — and keeps refining those decisions as new evidence arrives, like a detective growing more confident as clues accumulate. The result: 88% accuracy in identifying what a target is, and 93% accuracy in predicting what it intends to do. In a world where a single wrong classification could mean catastrophe, those numbers represent something genuinely new.

The Science

Why Current Approaches Fall Short

Modern aerial combat is a high-speed chess match played in three dimensions. Targets can range from supersonic missiles traveling at Mach 5 to lumbering cargo aircraft, from highly maneuverable fighter jets to small drones that barely register on radar. Each behaves differently in the air — a fighter jets can pull sharp turns that would stall a commercial airliner; a missile accelerates in ways no human-piloted craft could survive. Understanding these kinematic signatures — how something moves through space — is fundamental to knowing what you're looking at.

The problem is that traditional classification systems need time to work. They analyze long stretches of radar data, building a picture of the target's trajectory before rendering judgment. This works fine when you're monitoring civilian air traffic, where trajectories are predictable and mistakes carry no immediate mortal consequences. But aerial combat doesn't grant that luxury. A missile takes roughly 30 seconds from launch to impact at typical engagement ranges. If your classification system needs 25 seconds of data to reach acceptable confidence, you've already lost the window for effective response.

"In high-risk environments, uncertainty is preferable to incorrect assessments," the researchers write. This philosophical stance — that it's better to say "I don't know" than to confidently assert the wrong answer — shapes the entire architecture of their system. Rather than forcing a classification the moment data becomes available, their method maintains a belief distribution that can represent genuine uncertainty, only sharpening its conclusion as evidence accumulates.

The existing literature on aerial target classification splits into two camps. The first uses image-based recognition — essentially computer vision applied to visual or infrared sensor data. This approach has intuitive appeal, but it crumbles under combat conditions. Sensors get degraded by weather, range, and aspect angle. Targets can be partially occluded. Generating realistic training datasets for the vast diversity of aerial targets under combat conditions is nearly impossible. The second camp uses kinematic features — the mathematics of motion — but typically requires complete time series and doesn't address intent prediction at all.

What was missing was an integrated framework that could classify what a target is while simultaneously inferring what it plans to do, all from partial observations that arrive in real-time.

The Evidential Reasoning Framework

The solution the researchers developed rests on a branch of mathematical reasoning called Dempster-Shafer Theory (DST), sometimes called the theory of evidence. Unlike classical probability, which forces you to assign all uncertainty to specific outcomes, DST allows you to distribute belief across sets of possibilities.

Consider a simple example. A radar contact is approaching. You're not sure if it's a fighter jet or a bomber — both are fast-moving military aircraft that might appear similar in the early frames. Classical probability would force you to pick one: "70% chance it's a fighter, 30% it's a bomber." But DST lets you say something more honest: "I have 0.6 belief that it's a fighter, 0.2 belief that it's a bomber, and 0.2 belief that it's one of several possible military aircraft — but I can't narrow it down further." That third category — the belief assigned to "one of several possibilities" — is called a focal set, and it's the mathematical representation of uncertainty that hasn't resolved yet.

The mathematical machinery works as follows. If you have two pieces of evidence — say, the output from two different classifiers — DST combines them using Dempster's rule. The rule takes the belief masses from each source and computes how they reinforce or contradict each other. When the evidence agrees, beliefs in shared hypotheses accumulate. When evidence conflicts, the conflict is quantified and managed rather than arbitrarily discarded.

But there's a known pathology in Dempster's rule: when evidence strongly disagrees, the combination can produce counterintuitive results. The rule tries to normalize away the conflict, which can lead to absurd conclusions like assigning high belief to a hypothesis that neither source actually supported.

To address this, the researchers turn to Yager's rule, which takes a different approach to conflict. Rather than trying to normalize conflicting beliefs into agreement, Yager's rule redistributes conflicting mass to a special "complete uncertainty" set — essentially saying "these sources disagree so much that I can't draw any firm conclusion." This is more honest, but it can be too conservative for rapid decision-making.

The innovation in this paper is a hybrid approach that uses a distance metric to quantify how much two pieces of evidence actually disagree. If the distance is small, Dempster's rule is applied and beliefs accumulate normally. If the distance exceeds a threshold — meaning the evidence is genuinely conflicting — the system switches to Yager's rule or a modified combination that preserves uncertainty rather than forcing false agreement. This adaptive switching prevents the propagation of incorrect predictions over time while still allowing confidence to build when evidence is consistent.

The Ensemble of Classifiers

The belief generation itself comes from an ensemble of three distinct machine learning classifiers, each bringing different strengths to the problem.

A Feed-Forward Neural Network (FFNN) processes statistical summaries of the trajectory data. Every few seconds of sensor readings, the system computes a battery of statistical features — mean velocity, standard deviation of acceleration, maximum altitude reached, the skewness of turn rates, and more. These features capture the "fingerprint" of different target types. A missile has a very different kinematic signature than a cargo aircraft: missiles accelerate rapidly and maintain tight trajectories, while cargo aircraft have sluggish acceleration and wide turning radii.

A Support Vector Machine (SVM) works on the same statistical features but uses a different mathematical framework. Where neural networks learn complex decision boundaries through gradient descent, SVMs find the optimal hyperplane separating different classes. SVMs are particularly good at handling high-dimensional data with relatively few training examples, which makes them suitable for military applications where labeled data is scarce.

The third classifier, a Long Short-Term Memory network (LSTM), takes a different approach entirely. Instead of processing statistical summaries, it operates directly on the raw time-series sub-sample, learning temporal patterns within the window. LSTMs are a type of recurrent neural network designed to remember long-term dependencies — crucial for trajectory data where the pattern over time matters as much as any single snapshot.

Each classifier outputs a probability distribution over the eight target types. These probabilities are then transformed into Basic Belief Assignments using a mapping that explicitly incorporates uncertainty. When a classifier is highly confident (say, 95% probability of one class), the BBA reflects that confidence. When the classifier is uncertain (say, 40% fighter, 35% bomber, 25% drone), the BBA distributes mass across a focal set representing "military aircraft of some type" rather than forcing a false single-class choice.

The BBAs from all three classifiers are combined using the adaptive DST framework described above. This fusion across classifiers aggregates the complementary information each model captures — the statistical patterns FFNN and SVM detect, and the temporal dynamics LSTM learns.

The Two-Stage Pipeline

The complete system operates in two stages, reflecting the hierarchical nature of the classification problem.

Stage One is Target Type Classification. The system takes as input a short window (sub-sample) of kinematic data — typically a few seconds of radar measurements. This includes position (x, y, z coordinates), velocity (speed in each dimension), acceleration, turn rate, and radar cross-section (RCS), which measures how visible the target is to radar. Different target types have characteristic RCS signatures: stealth aircraft have small radar returns, while large bombers are highly visible.

The statistical feature extraction block transforms each sub-sample into a compact vector of statistical descriptors. This reduces dimensionality while preserving the distinctive patterns each target type exhibits. The extracted features flow to all three classifiers simultaneously, while the raw sub-sample goes to the LSTM.

Stage Two is Intent Prediction. This is where the system moves from "what is it?" to "what will it do?" The output from Stage One — the belief distribution over target types — is converted into membership values using fuzzy set theory. This allows the system to reason about target capabilities: a multi-role fighter has different offensive capabilities than a transport aircraft; a small UAV has different endurance and payload limitations.

These capability memberships combine with the target's relative position and trajectory to the ownship (the aircraft running the system) to determine intent. The researchers model this using a rule-based decision tree, a series of if-then conditions encoding expert knowledge about threat assessment. For instance: if the target is military (based on Stage One output), and its velocity vector points toward the ownship, and it's within a certain range threshold, and it's accelerating toward the ownship — then classify as hostile. If it's on a parallel or diverging course, or if it's classified as civilian, the intent inference changes accordingly.

The combat geometry itself is illustrated in

Figure 2: Combat geometry involving the ownship and a target.
Figure 2: Combat geometry involving the ownship and a target. Source: Tenzing Thiley Bhutia, Subash Kumaraguru

— a schematic showing the spatial relationship between the ownship and the target, including the relative position vector, velocity vectors, and key parameters like distance and approach angle that feed into the intent inference rules.

Early Classification and Belief Propagation

The key innovation enabling rapid response is the concept of early classification. Rather than waiting for a long time series to accumulate, the system makes predictions on short sub-samples — just a few seconds of data. These early predictions are, by themselves, less reliable than predictions made with full data. But the system doesn't discard them.

Instead, the belief distributions from each sub-sample are propagated forward in time and combined with the beliefs from subsequent sub-samples. This creates a rolling fusion process: as new data arrives, the system updates its belief state, typically becoming more confident (and more accurate) with each update. The distance-based conflict detection prevents the system from becoming more confident when evidence is actually contradicting — if a new sub-sample suggests something dramatically different from what the previous samples indicated, the system recognizes the conflict and doesn't allow the contradictory evidence to erode its beliefs.

This temporal fusion is what allows the 88% and 93% accuracy figures. With only the first sub-sample, accuracy would be considerably lower. But by the time the system has processed several sub-samples — which might represent only 10-15 seconds of real time — accuracy has climbed to those impressive levels.

What They Found

Performance on the Generated Dataset

Evaluating any aerial target classification system is challenging because no public benchmark datasets exist for this specific application. Military applications generate classified data that can't be shared; civilian datasets don't capture the adversarial scenarios that matter most. The researchers解决这个问题 by generating their own synthetic dataset, simulating eight distinct target types with realistic kinematic behaviors.

The eight target classes span the spectrum of aerial threats and non-threats: multi-role fighters (like F-16s or MiG-29s), small unmanned aircraft (drones), bombers (heavy aircraft like B-52s), fighter jets, large transport aircraft, medium transport aircraft, and small transport aircraft. Each class has characteristic kinematic signatures derived from known flight envelopes — maximum speeds, turn rates, acceleration capabilities, and typical altitude ranges.

Intent labels come in three categories: hostile (the target appears to be attacking the ownship), non-hostile (the target is on a benign course), and suspicious (the target's behavior is ambiguous or warrants caution). The suspicious category is crucial for a realistic system — in real combat, you can't always cleanly categorize intent, and a good system needs to express that uncertainty rather than forcing a binary hostile/non-hostile decision.

To test their system's performance, the researchers ran a case study with eight different targets, each exhibiting one of the three intent types. The results demonstrate the power of their approach.

For target type classification — identifying what the target is — the system achieved 88% accuracy. This means that in nearly nine out of ten cases, the system correctly identified the target type from the evolving stream of kinematic data. Critically, this accuracy was achieved as an aggregate over the sequence of sub-samples, with performance improving as more data arrived.

For intent prediction — determining whether the target was hostile, non-hostile, or suspicious — accuracy reached 93%. This higher figure reflects the hierarchical nature of the approach: once the system has a solid belief about what the target is, inferring its likely intent becomes more tractable. A small drone is unlikely to be hostile regardless of its trajectory; a military fighter closing rapidly requires more careful assessment.

Comparison with Baseline Methods

The researchers compared their approach against several baseline methods to establish the value of their contributions.

The first baseline uses Dempster-Shafer fusion across classifiers (FFNN, SVM, LSTM) but without the temporal propagation or the distance-based conflict handling. This represents the "naive" application of the core ideas — fuse evidence from multiple sources, but don't worry about temporal dynamics or evidence conflict. As

(a) Baseline DS Method (D​SF​F​N​N​⨁S​V​M​⨁L​S​T​MDS_{FFNN\bigoplus SVM\bigoplus LSTM})
(a) Baseline DS Method (D​SF​F​N​N​⨁S​V​M​⨁L​S​T​MDS_{FFNN\bigoplus SVM\bigoplus LSTM}) Source: Tenzing Thiley Bhutia, Subash Kumaraguru

shows, this baseline achieves decent but not exceptional performance.

The second baseline replaces the DST fusion with a simple voting mechanism — each classifier gets one vote, and the majority wins. This is computationally simpler but loses the nuanced uncertainty representation that DST provides.

The third baseline is a standard decision tree classifier applied to the same features. Decision trees are interpretable and widely used in expert systems, making them a reasonable comparison point.

The proposed approach outperforms all these baselines, as illustrated in

(b) Proposed Approach
(b) Proposed Approach Source: Tenzing Thiley Bhutia, Subash Kumaraguru

. The key advantage comes from two sources: the ensemble fusion captures complementary information from different classifier architectures, and the temporal propagation with conflict detection prevents errors from accumulating while allowing correct beliefs to strengthen.

Consistent Predictions Over Time

One of the most revealing analyses in the paper examines how prediction consistency evolves as more sub-samples are processed. A prediction is "consistent" if the system's belief about the target's type remains stable across consecutive sub-samples — it doesn't swing wildly between "fighter" and "cargo aircraft" as new data arrives.

Figure 5: The bar graph shows the number of trajectories with consistent predictions starting from 1s​t1^{st} and (2n​d−10t​h)(2^{nd}-10^{th}) subsample.
Figure 5: The bar graph shows the number of trajectories with consistent predictions starting from 1s​t1^{st} and (2n​d−10t​h)(2^{nd}-10^{th}) subsample. Source: Tenzing Thiley Bhutia, Subash Kumaraguru

shows the number of trajectories with consistent predictions across subsamples. The bar graph reveals a clear pattern: as the system processes more sub-samples, it becomes increasingly likely to maintain consistent predictions. This is the expected behavior for a well-functioning system — as evidence accumulates, the belief should stabilize, not oscillate. The curve shows that by the 5th or 6th sub-sample, the vast majority of targets have stable classifications, with only a small fraction of ambiguous cases continuing to show wavering predictions.

This consistency metric matters practically. A pilot receiving conflicting information — "it's a fighter... no wait, it's a bomber... actually maybe a fighter again" — would lose confidence in the system. A system that stabilizes its beliefs quickly provides a clear picture that the pilot can act on.

Why Uncertainty Is Better Than Wrong Certainty

Perhaps the most philosophically interesting finding concerns how the system handles uncertain cases. When predictions conflict — when the ensemble classifiers disagree, or when new sub-samples contradict previous beliefs — the system doesn't force a premature conclusion.

Instead, the distance-based combination method detects the conflict and adjusts its fusion strategy. If the evidence distance between two time steps is below the threshold, fusion continues normally and confidence increases. If the distance exceeds the threshold, fusion stops and a new evidence set is initialized. This adaptive behavior prevents the system from "doubling down" on wrong initial conclusions.

This approach directly addresses the paper's guiding philosophy: in high-risk environments, uncertainty is preferable to incorrect assessments. Rather than giving the pilot a false sense of confidence, the system acknowledges when it doesn't have enough evidence to be sure. This uncertainty expression is built into the mathematical framework — the focal sets in the belief distributions explicitly represent "I know it's one of these several options, but I can't narrow it down further."

Why This Changes Things

The Speed-Accuracy Tradeoff Has Been Redrawn

For decades, military systems have faced a fundamental tradeoff: faster classification means less accuracy, and higher accuracy means longer response times. The standard approach was to wait — accumulate enough data to be confident, then act. But in modern warfare, where hypersonic missiles and coordinated drone swarms compress timelines to seconds, that approach is increasingly untenable.

This research demonstrates that the tradeoff isn't as stark as we thought. By combining multiple classifiers in an ensemble and propagating beliefs over time rather than making isolated decisions, the system achieves high accuracy while maintaining rapid response. The pilot gets actionable information within the first few seconds of contact, and that information becomes more reliable as time progresses.

This could reshape how aerial combat systems are designed. Instead of waiting 30 seconds for confident classification, a system based on this approach might provide useful (if uncertain) information within 3-4 seconds, with high confidence within 15 seconds. That difference — seconds that might stretch into an eternity in a dogfight — could be the margin between survival and destruction.

Interpretability and Trust

The rule-based intent inference provides something that pure machine learning often lacks: interpretability. When the system classifies a target as hostile, you can trace the decision through the rule tree: because the target is a multi-role fighter (confirmed by Stage One with 0.85 belief), and because its velocity vector has a component pointing toward the ownship (true, measured at 45 degrees), and because it's within 20 nautical miles and accelerating (true, measured at 2 G), the rule "military aircraft closing on attack trajectory" fires, and intent is classified as hostile.

This interpretability matters for pilot trust and for post-action analysis. When a pilot acts on the system's recommendation, they need to understand the reasoning. After an engagement, analysts need to review what information was available and why certain decisions were made. A system that provides clear reasoning traces is more trustworthy and more auditable than a black-box neural network that outputs classifications without explanation.

Applications Beyond Aerial Combat

While the paper focuses on aerial target classification, the framework generalizes to other domains where rapid, uncertain classification must occur with temporal data.

Consider autonomous vehicles. A self-driving car encountering an unexpected obstacle needs to classify it quickly — is that a pedestrian who might step into the road, a bicycle that could swerve, or a static object that's unlikely to move? The kinematic signatures differ, and the stakes are high. A system based on evidential reasoning could provide probabilistic classifications that become more confident as the vehicle approaches, without forcing premature certainty.

Or consider financial trading. Market data arrives in streams, and algorithmic traders need to classify market regimes quickly — trending up, mean-reverting, volatile, stable — to adjust their strategies. The same principles of early classification from partial data and belief propagation over time could apply.

More directly, the framework could extend to maritime target classification (distinguishing warships from commercial vessels from fishing boats) or ground target classification for unmanned ground vehicles. Any domain where sensors produce time-series data about moving objects and decisions must be made under time pressure could benefit.

The Dataset Innovation

The researchers' decision to generate their own synthetic dataset is both a limitation and a contribution. It's a limitation because synthetic data, however carefully designed, may not capture all the complexities of real aerial combat. There may be kinematic signatures in real data that their simulated targets don't exhibit; there may be edge cases that only emerge in actual combat conditions.

But the dataset is also a contribution. The authors explicitly note that prior work in this area suffers from a lack of public benchmarks — every study uses its own proprietary dataset, making comparisons impossible. By documenting their data generation methodology and releasing their approach, they enable future researchers to build on their work and compare fairly against their results.

The synthetic dataset generation process likely involved modeling the flight envelopes of different aircraft types, simulating realistic trajectories with appropriate statistical properties, and labeling trajectories with both type and intent. This kind of documented, reproducible methodology is exactly what the field needs to advance beyond isolated studies that can't be compared or replicated.

What's Next

Validation on Real-World Data

The most pressing next step is validating the approach on real flight data. Synthetic trajectories, however realistic, can't fully capture the noise, sensor errors, electronic warfare countermeasures, and edge cases that characterize actual combat. The researchers would need to partner with military agencies or defense contractors who have access to classified flight data to test whether the 88% and 93% accuracy figures hold.

This validation would likely reveal weaknesses in the current approach. Perhaps certain target types have kinematic signatures that are difficult to distinguish with the current feature set. Perhaps some adversarial tactics — deliberately mimicking civilian flight profiles, for instance — are not captured by the current rule-based intent inference. Finding these weaknesses is valuable; it points toward improvements.

Computational Optimization for Real-Time Execution

The paper demonstrates the approach conceptually but doesn't discuss real-time implementation constraints. An operational system would need to run on aircraft hardware with limited computational resources, tight power budgets, and strict latency requirements.

The statistical feature extraction and classifier inference must complete within the inter-sample interval — the time between consecutive sensor measurements. If the system processes measurements every 100 milliseconds, all computation for that time step must fit within 100 milliseconds. For a system with multiple classifiers running in parallel, this could require significant optimization, possibly involving specialized hardware like GPUs or FPGAs.

Additionally, the DST fusion and distance computation add overhead beyond the base classification. The computational cost of these operations at the update frequency required for aerial combat would need to be characterized and minimized.

Handling Multi-Target Scenarios

The current work focuses on a single target. In practice, aerial combat often involves multiple contacts simultaneously — a formation of enemy aircraft, a mix of friendly and hostile contacts, or a coordinated attack from multiple directions. Extending the framework to handle multiple targets introduces new challenges:

First, computational load scales with the number of targets. With N targets and M sub-samples per target, the system needs to process N × M belief updates per time step. Parallelization can help, but the hardware must be capable.

Second, targets interact. One aircraft might be covering another; a formation might coordinate to confuse sensors. The current framework treats each target independently. A richer model would capture these interactions.

Third, priority allocation becomes critical. With limited attention (human or computational), the system must prioritize which targets to classify in detail and which to treat with less scrutiny. An automated threat prioritization system would need to integrate with the classification framework.

Adversarial Robustness

Military systems must assume adversarial intent. An enemy that knows you're using kinematic classification might develop tactics to defeat it — flying trajectories that mimic friendly aircraft, varying flight profiles to confuse classifiers, or using electronic warfare to corrupt sensor data.

The current framework doesn't explicitly address adversarial scenarios. The distance-based conflict detection provides some robustness to sensor noise, but a sophisticated adversary could learn to stay just below the conflict threshold while systematically misleading the system.

Adversarial training — augmenting the dataset with simulated jamming, spoofing, and deceptive flight profiles — could improve robustness. So could incorporating additional sensor modalities that are harder to spoof (infrared tracking, for instance, which measures actual heat signatures rather than reflected signals).

Integration with Human Decision-Making

A 93% accuracy rate is impressive, but 7% of intent predictions will be wrong. In aerial combat, even a small error rate can be catastrophic if it leads to fratricide (attacking a friendly aircraft) or missed engagement (failing to defend against a genuine threat).

The question of how to present uncertainty to human operators is crucial. Should the pilot see "HOSTILE — 93% confidence" or "HOSTILE — 85% hostile, 10% suspicious, 5% non-hostile"? Should the system automatically fire weapons when confidence exceeds some threshold, or should it always defer to the pilot? These are not purely technical questions — they're deeply human and organizational.

The interpretability of the rule-based intent inference helps here. Rather than presenting a black-box classification, the system can present its reasoning: "This target is classified as a multi-role fighter with 88% confidence, and its trajectory meets our attack-pattern rules. Recommendation: hostile." The pilot can then evaluate this recommendation against other information (visual identification if in range, communication attempts, tactical context) and make an informed decision.

Probabilistic Safety Guarantees

As these systems move from research to deployment, questions of accountability and safety become pressing. If the system misclassifies a target and a civilian aircraft is shot down, who bears responsibility? The pilot who accepted the system's recommendation? The defense contractor who built the system? The researchers who designed the algorithm?

These questions are not unique to aerial combat — they apply to autonomous vehicles, medical AI, and any AI system that makes consequential decisions. But military applications carry particular weight because the consequences are extreme and the operational environment is unpredictable.

A rigorous framework for probabilistic safety guarantees would need to bound the system's error rate under various conditions, characterize its failure modes, and provide tools for post-hoc analysis when failures occur. This is an active area of research in AI safety generally, and it applies directly to systems like the one described in this paper.


The work by Bhutia, Kumaraguru, and Muniraj represents a genuine advance in a problem that matters enormously and has received far too little attention from the academic community. Their approach — early classification from kinematic data, ensemble fusion with evidential reasoning, temporal belief propagation with conflict detection, and interpretable intent inference — addresses real operational needs in a mathematically rigorous way.

The 88% and 93% accuracy figures are impressive but not the point. The point is that they've built a system that can provide actionable information in seconds, acknowledge uncertainty honestly when it exists, and refine its beliefs as more evidence arrives. In a world where decisions must be made in the space between heartbeats, that combination of speed and epistemic humility might be exactly what combat pilots need.

Whether this specific system ever deploys on a fighter jet is uncertain — that depends on factors far beyond academic merit, including defense procurement processes, budget constraints, and geopolitical considerations. But the ideas in this paper point toward a future where human decision-makers are augmented by systems that think carefully about uncertainty, that know what they don't know, and that provide timely, interpretable, and honest assessments of the threats they detect. That's a future worth building toward.