Bayesian search theory¶

A probabilistic lost-object search using location beliefs, detection chances, and updates when results arrive.

Version: v1 · 2026-09-28 · History
Domain-specific #: 8141
Domain group: Formal Sciences
Origin domain: Operations Research
Subdomain: Search Theory → Operations Research
Aliases: Bayesian search

Core Idea¶

Bayesian search theory assigns probabilities to possible locations of a missing object and models the chance of finding it in each place. Priors, detection and effort can guide an initial search before any result arrives. Detection or non-detection then revises the distribution by Bayes' rule. An unsuccessful sweep does not normally erase a region because coverage and sensors are imperfect. A posterior location map informs further search alongside detection prospects and effort.

For a beacon with probability 0.6 in A and 0.4 in B, an 80%-effective search of A that finds nothing leaves A with probability 0.12/(0.12+0.4), about 0.23. Metron used priors, previous unsuccessful search phases and detection modeling for AF447 underwater wreckage planning, documented by BEA. That is a real application, not proof a model map was the observed location or guaranteed recovery. Bayesian Updating is the post-result operation, not a strict parent of a valid pre-result search plan; uncertain physical location and imperfect detection define this specialist method.

How would you explain it like I'm…

Smart Lost-Toy Hunting

When you lose a toy, you think about where it most likely is and how easy it would be to spot there. You look in the best spot first. If you look under the bed and don't find it, the bed becomes a less likely spot, but not impossible, because you might have missed it. Then you pick the next best place to look.

Smart Searching With Chances

When something is lost, Bayesian Search Theory starts by giving each possible spot a chance of holding it, and a chance of spotting it if you search there. Those two numbers help you pick where to search first. If you search a place and find nothing, you lower that place's chance, but only as much as the search was good; a sloppy search lowers it only a little. The other places go up so all the chances still add up. Then you use the new chances, plus how much effort each search costs, to decide where to go next.

Probability-Guided Search Planning

Bayesian Search Theory treats each possible location of a missing object as a hypothesis with a prior probability, and also models the chance of detecting the object if you search there and it is present. Before any search, these two ingredients already help plan where to look first. After an unsuccessful search, Bayes' rule lowers a location's probability according to how likely a miss would have been there; because detection is imperfect, some probability remains. For example, if location A starts at 0.6 and a search of A that would find it 80% of the time comes up empty, A's probability drops to about 0.23. The updated, normalized probabilities, together with the effort needed and future chances of detection, guide the next search.

Bayesian Search Theory models a search as a set of location hypotheses with prior probabilities plus a detection model giving the probability of finding the object in a cell if it is there and searched with a given effort. These ingredients guide the initial allocation of search before any result exists. When a search fails, Bayes' rule multiplies each searched cell's probability by its probability of missing, then renormalizes, so imperfectly searched cells keep residual probability. In a two-cell case with A at 0.6, an 80%-effective search of A that finds nothing leaves A at 0.12/0.52, about 0.23. Subsequent search is planned from the posterior combined with effort costs and future detection prospects. The update stage is ordinary Bayesian updating; what makes this a search theory is that location, physical detection, and effort also shape the plan before any outcome. Metron used prior maps, earlier unsuccessful sweeps and detection modeling in BEA's search planning for the AF447 wreckage; the probability map was a planning tool, not an observed location.

Cross-Domain Echoes¶

See how this entry connects to another domain.

What one result can—and cannot—tell you

Scope of Application¶

These uses require a lost object, location probabilities and detection modeling; results trigger later updates.

Underwater recovery. Plan wreckage searches using explicit prior and detection assumptions.
Land search. Adapt detection models to terrain and cover when supported by evidence.
Operations research. Compare expected detection per unit effort after probability revision.
Search audit. Evaluate how past no-finds should update location beliefs.

Clarity¶

Name the missing object, possible locations, prior and detection model. A search plan can precede the first result; if a result exists, state its Bayesian update. A fixed route with no probabilistic location or detection model is the nearest miss. Separate a posterior ranking from a next route chosen under effort and sensor limits.

Manages Complexity¶

Bayesian search compresses disparate clues and unsuccessful sweeps into one conditional map. The compression remains assumption-bound: detection estimates and prior hypotheses can be wrong, and a searched place can retain nonzero probability. Keeping observation, inference and choice distinct prevents a model output from being misread as discovery.

Abstract Reasoning¶

Define possible locations and prior mass.
State detection chance conditional on location and search conditions.
Compare initial search options using prior mass, detectability and effort.
If a search result arrives, normalize prior times outcome likelihood to obtain a posterior.
Compare further searches by revised mass, detection and effort without hiding model limits.

Knowledge Transfer¶

The update stage uses Bayesian Updating literally when an outcome arrives, but a prior-and-detection search plan can exist before that stage. The added cargo is uncertain physical location and imperfect detection during a search. Diagnosis may share the mathematics but is not this lost-object problem. A plan that disregards results once observed lacks the method's feedback capacity.

Relationships to Other Abstractions¶

Current abstraction Bayesian search theory Domain-specific

Parents (1) — more general patterns this builds on

Bayesian search theory is a kind of Decision Method Domain-specific

Bayesian search theory satisfies the defining boundary of Decision Method: A decision method is a repeatable procedure that represents a decision frame, feasible alternatives, objectives or loss, evidence and uncertainty, preference or priority information, and an aggregation or search rule to recommend, rank, or adapt a course of action.

Hierarchy path (1) — routes to 1 parentless root

Bayesian search theory → Decision Method

Neighborhood in Abstraction Space¶

Bayesian search theory sits in a sparse region of the domain-specific corpus (66^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Geographic Mapping & Positioning (14 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08