×
Information-Theoretic Framework for OWP
Problem
Given a 2D binary random field (e.g., sand/shale reservoir),
select K measurement positions (wells) that maximize information
about the entire field.
Shannon Entropy
Binary entropy: H(p) = -p log2(p) - (1-p) log2(1-p)
Measures uncertainty at each position. Maximum at p=0.5 (1 bit).
Optimal Placement
f* = argmax H(X_f)
Select positions that maximize the joint entropy of measurements,
equivalently minimizing posterior uncertainty.
AdSEMES Algorithm
Adaptive Sequential Empirical Maximum Entropy Sampling:
- Estimate conditional entropy at all unsampled positions using
pattern matching against the Training Image.
- Select the position with maximum entropy.
- Reveal the true value (drill the well).
- Repeat K times.
Greedy with (1 - 1/e) approximation guarantee (submodular optimization).
Resolvability Capacity
C_k = (H_0 - H_k) / H_0
Fraction of total uncertainty resolved after k measurements. Ranges from 0 to 1.
Sampling Methods
- Random Uniform: Baseline, no spatial structure.
- Stratified Grid: Deterministic uniform coverage.
- Random Stratified: Randomized within strata.
- Multiscale: Hierarchical multi-resolution.
- Oracle Entropy: Uses true field (upper bound).
- Adaptive Entropy: AdSEMES (the main algorithm).
- Penalized Adaptive: AdSEMES with spatial penalty to avoid locality clustering.
- Hybrid Stratified + Adaptive: Stratified seeding + penalized adaptive refinement.
- Multiscale Adaptive: Multi-resolution entropy-guided sampling.
References
Shannon (1948); Cover & Thomas (2006); Silva et al., Fondecyt 1140840;
Nemhauser, Wolsey & Fisher (1978)