MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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 2 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
Code reusability tools for programming mobile robots
Carle Côté, Dominic Létourneau, François Michaud, Jean-Marc Valin, Yannick Brosseau, Clément Raïevsky +2 more
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
103
citations
affunlabeled
Safe planning for human-robot interaction
Dana Kulić, Elizabeth A. Croft
2004· article· en· Journal of Robotic Systems· Computer Science
machine prediction:candidate · noneconsensus · none
99
citations
affunlabeled
A Multi-Label A* Algorithm for Multi-Agent Pathfinding
Florian Grenouilleau, Willem‐Jan van Hoeve, John Hooker
2019· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
machine prediction:candidate · noneconsensus · none
69
citations
affunlabeled
KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
David Kirkpatrick, Jack Snoeyink, Bettina Speckmann
2002· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
66
citations
affno abstractunlabeled
Autonomous Landing of a Quadcopter on a High-Speed Ground Vehicle
Alexandre Borowczyk, Duc-Tien Nguyen, André Phu-Van Nguyen, Dang Quang Nguyen, David Saussié, Jérôme Le Ny
2017· article· en· Journal of Guidance Control and Dynamics· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
afffundno abstractunlabeled
Multi-robot repeated area coverage
Pooyan Fazli, Alireza Davoodi, Alan K. Mackworth
2013· article· en· Autonomous Robots· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
affunlabeled
Improving Collaborative Pathfinding Using Map Abstraction
Nathan Sturtevant, Michael Buro
2006· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
machine prediction:candidate · noneconsensus · none
61
citations
← previousnext →

How this was built: Screen · Findings · About