A New Well Positioning Technique for SAGD Applications
Bibliographic record
Abstract
Abstract The magnetic ranging method is used in many oil-field drilling applications, especially in heavy oil production. One typical example is used in the steam-assisted gravity drainage (SAGD) technique to enhance oil recovery of heavy crude oil and bitumen. Such SAGD applications require drilling two horizontal twin wells that are parallel and separated by a few meters. As a result of accumulated survey errors, it is very challenging to achieve a controlled separation and good relative well placement among wells using conventional logging-while-drilling (LWD) survey data. Current practice mainly relies on wireline technology to access one of the twin wells to generate an active ranging signal; however, this is costly and time consuming. This paper presents a true access-independent magnetic ranging solution, designed around SAGD applications, that eliminates the need to access a target wellbore below the surface. A surface excitation is attached to a wellhead of a target well to introduce a current signal traveling along the entire target well. Concurrently, LWD gradient array sensors in a drilling well measure the induced field to determine the relative distance and direction between the two wells. This method permits operators to efficiently acquire access-independent active ranging measurements, enabling faster well placement optimization. This paper discusses the fundamentals of the new ranging technique, including both the surface excitation and the gradient array systems. The paper also analyzes modeled responses, experimental data, and field trial results from a gradient discovery tool (GDT) to validate the proposed concept. Comparing the novel tool to the current industry standard tool, a magnetic guidance tool (MGT), the paper demonstrates that the GDT is capable of achieving accurate and valid ranging performance in SAGD applications. Furthermore, the described LWD system presents an alternative ranging tool to current wireline techniques and provides several advantages for well intersection and positioning applications that can help reduce overall time and costs.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".