MétaCan
Menu
Back to cohort
Record W4408192079 · doi:10.1016/j.autcon.2025.106107

Optimized crane mat design and transit path planning using a graph search algorithm

2025· article· en· W4408192079 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueAutomation in Construction · 2025
Typearticle
Languageen
FieldEngineering
TopicGeophysical Methods and Applications
Canadian institutionsGovernment of Alberta
Fundersnot available
KeywordsAlgorithmGraphPath (computing)Motion planningComputer scienceSearch algorithmEngineeringArtificial intelligenceTheoretical computer science

Abstract

fetched live from OpenAlex

Designing temporary crane transit paths in large construction sites with varying geological profiles presents two challenges: (1) ensuring safe, efficient, and cost-effective operations, and (2) developing optimization solutions that consider material properties, ground loading, and site layout. This paper addresses these challenges by integrating a graph search algorithm with crane mat structural design to optimize crane mat layouts and transit paths. A case study of structural steel subassembly installations, based on a real-world project, demonstrates the method’s effectiveness. The results highlight safety-focused crane mat designs and transit plans, along with significant cost savings compared to traditional heuristics. • Designs optimized transit paths for large-capacity mobile cranes. • Proposes an analytical approach to optimize crane mat design and transit paths. • Reduces crane mat material usage and field overhead costs. • Enhances crane safety by analyzing ground pressure and slope. • Automates optimization via a prototype computer program.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.393
Threshold uncertainty score0.351

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.022
GPT teacher head0.290
Teacher spread0.268 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it