MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
Topic
Robotic Path Planning Algorithms
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

1,570 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
1,570 works in the cohort · of 4,299,418page 6 of 32

Labels cover 1 of 1,570 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 1,570 of 1,570 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Bibliography
Gregory Dudek, Michael Jenkin
2010· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
25
citations
affunlabeled
Touring a sequence of polygons
Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Dynamic path planning
John Zelek
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Stippling with aerial robots
Brendan Galea, E. Kia, N. Aird, Paul G. Kry
2016· article· en· Non-Photorealistic Animation and Rendering· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Fuzzy dynamic localization for mobile robots
Kudret Demirli, Mohammad Molhim
2003· article· en· Fuzzy Sets and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
aboutno affunlabeled
Autonomous golf ball picking robot design and development
N. R. Pereira, Gil Lopes, Daniel E. Whitney
2012· article· en· Industrial Robot the international journal of robotics research and application· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
MPK: An open extensible motion planning kernel
Ian Gipson, Kamal Gupta, Michael Greenspan
2001· article· en· Journal of Robotic Systems· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
aboutno affunlabeled
TOWARDS AUTONOMOUS LONG-RANGE NAVIGATION
Érick Dupuis, Pierre Allard, Joseph Nsasi Bakambu, Tom Lamarche, Wen-Hong Zhu, Ioannis Rekleitis
2005· article· en· ESASP· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations

How this was built: Screen · Findings · About