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 4 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.

affno abstractunlabeled
3D Local Trajectory Planner for UAV
Jerzy Sąsiadek, Ignacy Dulȩba
2000· article· en· Journal of Intelligent & Robotic Systems· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
afffundunlabeled
A mobile manipulator
Matthew T. Mason, Dinesh K. Pai, Daniela Rus, Lee Taylor, Michael Erdmann
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Direction Maps for Cooperative Pathfinding
M. Renee Jansen M. Renee Jansen, Nathan Sturtevant
2008· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Probabilistic Robust Multi-Agent Path Finding
Dor Atzmon, Roni Stern, Ariel Felner, Nathan Sturtevant, Sven Koenig
2020· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affunlabeled
View Planning Problem with Combined View and Traveling Cost
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
2007· article· en· Proceedings - IEEE International Conference on Robotics and Automation/Proceedings· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
afffundunlabeled
Any-Angle Path Planning for Computer Games
Peter Yap, Neil Burch, Robert C. Holte, Jonathan Schaeffer
2011· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
afffundno abstractunlabeled
Spartacus attending the 2005 AAAI conference
François Michaud, Carle Côté, Dominic Létourneau, Yannick Brosseau, Jean-Marc Valin, Éric Beaudry +10 more
2006· article· en· Autonomous Robots· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations

How this was built: Screen · Findings · About