MétaCan
Menu
Back to cohort
Record W1608301497 · doi:10.1109/ccece.2015.7129191

Generalized formulation for trajectory optimization in patrolling problems

2015· article· en· W1608301497 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicle Routing Optimization Methods
Canadian institutionsConcordia University
Fundersnot available
KeywordsPatrollingTrajectoryMathematical optimizationViewpointsSequence (biology)Computer scienceOptimization problemTrajectory optimizationMathematicsOptimal control

Abstract

fetched live from OpenAlex

In this paper, a general formulation is presented for trajectory optimization in patrolling problems. It is assumed that the starting depots are not prespecified. This assumption distinguishes the present work from the existing literature. A number of viewpoints are assigned to be visited in a certain sequence to minimize the total travel distance. The problem turns out to be a variant of the well-known Traveling Salesmen Problem (TSP), namely the Multidepot multiple Traveling Salesmen Problem (MmTSP). A comparison between the commonly-used pre-specified starting multidepot approach and the proposed formulation is performed and the efficacy of the results is presented through simulations.

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.001
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.284
Threshold uncertainty score0.384

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.049
GPT teacher head0.281
Teacher spread0.231 · 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

Quick stats

Citations5
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicVehicle Routing Optimization MethodsFrench-language works237,207