Optimizing Bridge Plug Milling Efficiency Utilizing Weight-On-Bit to Control Debris Size: A Comparative Study of the Debris Size vs Weight-On-Bit Utilizing Five Bladed Carbide Mill, Tri-Cone and PDC Bits
Bibliographic record
Abstract
Abstract Weight-on-bit can be challenging to calculate at surface as downhole motor performance is generally observed from differential pressure and rate of penetration (ROP). If an accurate weight-on-bit (WOB) is maintained, motor performance and ROP can be maximized while controlling debris size. This will increase the efficiency of the entire millout operation. The weight-on-bit can be monitored and manipulated live via new software (Yeung, J. et al. 2015). The objective of this research paper is to conduct a comparative study that analyzes the performance of the five bladed carbide mill, tri-cone and PDC bits in terms of debris size vs weight-on-bit. Two main criteria will be used for the analysis. Firstly, a test will be carried out in order to determine how the set down force affects the drilling tool in terms of generating smaller debris size. This knowledge intends to improve wellbore clean outs and reduce the number of wiper trips. Secondly, the test will analyze how set down force of the drilling tool affects the ROP on the bridge plug. One specific type of 4-1/2″ bridge plug with a combination of selected mills and bits will be studied in this paper to control the experiment. However, the overall milling parameters may vary greatly depending on the manufacturers, plug, mill, and bit types. A series of bridge plugs will be milled out in a controlled environment using the five bladed carbide mill and tri-cone and PDC bits. Each bridge plug will be milled out using a different weight-on-bit. After the bridge plug is milled out, all the plug debris is collected, and sorted based on a debris size distribution graph. The ROP will also be measured during the milling process to determine milling efficiency. In summary, this paper will compare the performance executed by the five bladed carbide mill, tri-cone, and PDC bits. This paper will identify the optimal weight-on-bit to achieve the desired quantitative debris size with these plugs. More studies need to be conducted for different plug types to see how weight-on-bit affects debris size.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".