{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1570,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":1570,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"e80a59c381ec","filters":{"topic":"Robotic Path Planning Algorithms"}},"results":[{"id":"W2077831477","doi":"10.1109/tii.2012.2198665","title":"Comparison of Parallel Genetic Algorithm and Particle Swarm Optimization for Real-Time UAV Path Planning","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1034,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Particle swarm optimization; Motion planning; Multi-core processor; Path (computing); Genetic algorithm; Speedup; Mathematical optimization; Algorithm; Dynamic programming; Swarm behaviour; Parallel computing; Artificial intelligence; Mathematics","authors":[{"name":"Vincent Roberge","is_ca":true},{"name":"Mohammed Tarbouchi","is_ca":true},{"name":"Gilles Labonté","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07969009193666098,"gpt":0.3174067097528994,"spread":0.2377166178162384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228894,0.0006453647,0.0007754519,0.0008599684,0.0003885014,0.0006388985,0.0006500955,0.0007923,0.001235896],"category_scores_gemma":[0.00368572,0.00024529,0.0004662363,0.0008857332,0.0003746715,0.0007151653,0.0003368768,0.0004949841,0.0002268216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008642639,"about_ca_system_score_gemma":0.001505161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009961495,"about_ca_topic_score_gemma":0.005914197,"domain_scores_codex":[0.9993911,0.0002083857,0.00003115356,0.0000723724,0.0002411919,0.00005589813],"domain_scores_gemma":[0.9986966,0.0006561092,0.00008401859,0.0001272483,0.0003918228,0.00004414731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002760907,0.0001003935,0.0009901314,0.00008090435,0.00006515116,0.00004093368,0.00003331273,0.9094302,0.001560253,0.004102996,0.0007580344,0.08256149],"study_design_scores_gemma":[0.0000270291,0.00004546939,0.0002523413,0.000003530677,0.00001141716,0.00001453812,0.00000970362,0.9973496,0.0007127983,0.001067831,0.0005019725,0.000003704465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1922906,0.001946699,0.785363,0.0006324856,0.0003802897,0.0001428252,0.00008658308,0.001847776,0.01730963],"genre_scores_gemma":[0.7046506,0.0007239539,0.2913546,0.0001199372,0.00005840794,0.0001558272,0.0001610271,0.0002329605,0.002542619],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009961495,"threshold_uncertainty_score":0.01980698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111638077","doi":"10.1109/tac.2004.837589","title":"Formations of Vehicles in Cyclic Pursuit","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":669,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Nonholonomic system; Constraint (computer-aided design); Focus (optics); Modulo; Controller (irrigation); Stability (learning theory); Simple (philosophy); Control theory (sociology); Computer science; Constant (computer programming); Principal (computer security); Mathematics; Mathematical optimization; Control (management); Mobile robot; Artificial intelligence; Robot; Geometry; Discrete mathematics; Physics","authors":[{"name":"Joshua A. Marshall","is_ca":true},{"name":"Mireille E. Broucke","is_ca":true},{"name":"Bruce A. Francis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01299818626875267,"gpt":0.2427849811382025,"spread":0.2297867948694498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004180895,0.0002800152,0.0003042525,0.0004807278,0.0005810983,0.0006985602,0.0005232904,0.0004299798,0.001177317],"category_scores_gemma":[0.001920588,0.0002580718,0.0004285308,0.0003091045,0.002031458,0.001050845,0.001700163,0.0004723431,0.0001149371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006132761,"about_ca_system_score_gemma":0.0004735258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003318722,"about_ca_topic_score_gemma":0.00114972,"domain_scores_codex":[0.9996305,0.00008431252,0.00001352455,0.00008663331,0.0001111673,0.00007399356],"domain_scores_gemma":[0.9994671,0.0001359054,0.0001859438,0.00006458276,0.00007639143,0.00007012532],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002429864,0.00004104711,0.004415943,0.00007120852,0.00006008689,0.0007348669,0.001203246,0.5059023,0.01843698,0.4348873,0.0008888498,0.03311509],"study_design_scores_gemma":[0.00004776288,0.0002126256,0.001126223,0.00001271049,0.00002070911,0.0002441266,0.0004933052,0.8357384,0.003821278,0.1550225,0.003237803,0.00002252932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4870244,0.0001796885,0.5040419,0.0002917195,0.00003597802,0.00005321757,0.00004529357,0.0001471161,0.008180711],"genre_scores_gemma":[0.981666,0.00008831408,0.01599073,0.00002993226,0.00001203508,0.00004110811,0.00004025084,0.00001713605,0.002114534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003318722,"threshold_uncertainty_score":0.00659883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1630437312","doi":"10.1017/cbo9780511780929","title":"Computational Principles of Mobile Robotics","year":2010,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":654,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; McGill University","funders":"","keywords":"Robotics; Artificial intelligence; Variety (cybernetics); Field (mathematics); Mobile robot; Computer science; Robot; Key (lock); Range (aeronautics); State (computer science); Human–computer interaction; Engineering; Mathematics; Computer security; Algorithm","authors":[{"name":"Gregory Dudek","is_ca":true},{"name":"Michael Jenkin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02372961488666377,"gpt":0.2156093713069322,"spread":0.1918797564202684,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003699416,0.001277993,0.0008781043,0.0009116685,0.0008186072,0.003114688,0.001260387,0.001185943,0.01483857],"category_scores_gemma":[0.001190172,0.0005079105,0.0007100232,0.001084968,0.002519193,0.003048065,0.001728244,0.002664551,0.007262705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001174915,"about_ca_system_score_gemma":0.001156377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001196012,"about_ca_topic_score_gemma":0.001255679,"domain_scores_codex":[0.9995435,0.0000825938,0.00002927868,0.0001000045,0.0002018555,0.00004274592],"domain_scores_gemma":[0.9997367,0.0001135893,0.00002005427,0.00005680096,0.00005325098,0.00001958691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003836458,0.00000491542,0.00006019934,0.0001686232,0.00001220844,0.00005083163,0.0001545446,0.002836778,0.0002924519,0.9196839,0.036961,0.03977057],"study_design_scores_gemma":[0.000004820748,0.000008516225,0.0001227272,0.0001212548,0.000005310293,0.0001531286,0.00005743885,0.003925435,0.0001406858,0.6067939,0.3886572,0.000009526102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.002628863,0.06846485,0.3848281,0.008237493,0.003568195,0.0001201194,0.0008992253,0.00111899,0.5301341],"genre_scores_gemma":[0.1805168,0.09778494,0.2958161,0.004683555,0.004209856,0.001034975,0.002395905,0.0009098887,0.412648],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01483857,"threshold_uncertainty_score":0.04964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166177494","doi":"10.1109/tsmcb.2003.811769","title":"A Neural Network Approach to Complete Coverage Path Planning","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":443,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Robot; Motion planning; Artificial neural network; Path (computing); Computer science; Workspace; Obstacle; Obstacle avoidance; Artificial intelligence; Mobile robot; Geography; Computer network","authors":[{"name":"Simon X. Yang","is_ca":true},{"name":"Chaomin Luo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03547404330118932,"gpt":0.2423698812427185,"spread":0.2068958379415292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002338391,0.0004966692,0.0004401825,0.0004062649,0.0003047292,0.0005121476,0.0008492068,0.0009838847,0.001961136],"category_scores_gemma":[0.000791533,0.0003554634,0.0004212324,0.0005571393,0.0005603835,0.001049073,0.000545306,0.0008801877,0.0002158053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008563265,"about_ca_system_score_gemma":0.0006657346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006989587,"about_ca_topic_score_gemma":0.005352984,"domain_scores_codex":[0.9998581,0.00003219967,0.00000679114,0.00003829243,0.00004551208,0.00001901051],"domain_scores_gemma":[0.9998247,0.00009545225,0.00001824106,0.000009939221,0.00004217838,0.00000952188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009889247,0.00000764946,0.00007529907,0.0000205081,0.00001037188,0.00002655981,0.00001461636,0.9729067,0.000719244,0.01065631,0.0002391047,0.01531377],"study_design_scores_gemma":[0.000001842946,0.00000567929,0.00002197535,0.000001536166,0.000001924739,0.000006722458,0.000001493105,0.9956393,0.0001404079,0.003959076,0.0002181418,0.000001956293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007820025,0.0004420326,0.9877476,0.0001889815,0.00002679119,0.00001906497,0.00003385843,0.0001135604,0.003608152],"genre_scores_gemma":[0.7331495,0.001330095,0.2546324,0.0001572199,0.0001143214,0.0003121424,0.0001553453,0.00006790631,0.01008111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006989587,"threshold_uncertainty_score":0.01389784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3103346840","doi":"","title":"Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":417,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Bit (key); Computer science; Sampling (signal processing); Random graph; Algorithm; Theoretical computer science; Artificial intelligence; Graph; Computer vision","authors":[{"name":"Jonathan D. Gammell","is_ca":true},{"name":"Siddhartha S Srinivasa","is_ca":false},{"name":"Timothy D. Barfoot","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08597512149257881,"gpt":0.3449501781571991,"spread":0.2589750566646203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007726917,0.0009022828,0.0008944425,0.0006187246,0.0005390003,0.0008393512,0.001550034,0.0009392,0.003429283],"category_scores_gemma":[0.003105013,0.0006309457,0.0007177793,0.001035806,0.001076076,0.001407578,0.001449791,0.001305965,0.0007198584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007629335,"about_ca_system_score_gemma":0.001863043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005498531,"about_ca_topic_score_gemma":0.008009171,"domain_scores_codex":[0.9995371,0.000155414,0.00002367154,0.00007210457,0.0001636487,0.00004802925],"domain_scores_gemma":[0.9989299,0.0006561092,0.00008956347,0.000167662,0.00009857206,0.00005812209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001959012,0.0000568227,0.0004460143,0.0001469315,0.00004562093,0.00008232728,0.0001062456,0.8262131,0.003426,0.04565706,0.005099102,0.1185249],"study_design_scores_gemma":[0.00002560855,0.0000394467,0.00003754988,0.000007148642,0.000007594038,0.00001970614,0.000008476853,0.9819947,0.0009213445,0.01526626,0.001663743,0.000008370341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008524379,0.0002082999,0.9877083,0.00009732505,0.00004019064,0.00005447889,0.0001047065,0.0009914374,0.002270856],"genre_scores_gemma":[0.2525398,0.0003677387,0.7427258,0.0001502039,0.0000350968,0.0003356341,0.0004990633,0.0003580474,0.002988448],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005498531,"threshold_uncertainty_score":0.01147211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015136933","doi":"10.1109/robot.2004.1302402","title":"A knowledge based genetic algorithm for path planning of a mobile robot","year":2004,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":297,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Motion planning; Genetic algorithm; Computer science; Mobile robot; Robot; Path (computing); Genetic representation; Cultural algorithm; Domain knowledge; Representation (politics); Any-angle path planning; Artificial intelligence; Domain (mathematical analysis); Mathematical optimization; Population-based incremental learning; Algorithm; Machine learning; Mathematics","authors":[{"name":"Yanrong Hu","is_ca":true},{"name":"Simon X. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02681135199092444,"gpt":0.2897995199299753,"spread":0.2629881679390508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003694728,0.0005431703,0.0005583386,0.0006748346,0.0005450979,0.0005907898,0.001050362,0.001337162,0.00165797],"category_scores_gemma":[0.001215001,0.0002180222,0.0005892341,0.0007379115,0.0006393666,0.0008340398,0.0005071389,0.0009067195,0.0004720195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007473732,"about_ca_system_score_gemma":0.001252354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00556922,"about_ca_topic_score_gemma":0.005054964,"domain_scores_codex":[0.9997289,0.00005735027,0.00001252458,0.00006974347,0.0001103512,0.00002113637],"domain_scores_gemma":[0.9998298,0.00007099664,0.00001764365,0.00002041218,0.00005238085,0.000008789363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004476636,0.00006228324,0.0005523784,0.0001574104,0.00006690293,0.0002050987,0.0001443152,0.6343952,0.01203897,0.04536982,0.002329467,0.3046333],"study_design_scores_gemma":[0.00002283253,0.0000787776,0.0002264557,0.00002550938,0.00003488308,0.0001868742,0.00002470667,0.9748355,0.003671069,0.01251009,0.008359324,0.00002416451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00327181,0.0002081246,0.9941556,0.00008669632,0.00003211216,0.00004004638,0.00002222597,0.0002481702,0.00193503],"genre_scores_gemma":[0.142112,0.0006842198,0.8532662,0.0001418129,0.00003082395,0.0002439661,0.0001613245,0.00005926945,0.003300356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00556922,"threshold_uncertainty_score":0.01107359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949992533","doi":"10.1609/socs.v10i1.18510","title":"Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":276,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Computer science; Pathfinding; Traverse; Benchmark (surveying); Terminology; Constraint (computer-aided design); Key (lock); Operations research; Theoretical computer science; Shortest path problem; Mathematics; Computer security","authors":[{"name":"Roni Stern","is_ca":false},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Ariel Felner","is_ca":false},{"name":"Sven Koenig","is_ca":false},{"name":"Hang Ma","is_ca":false},{"name":"Thayne T. Walker","is_ca":false},{"name":"Jiaoyang Li","is_ca":false},{"name":"Dor Atzmon","is_ca":false},{"name":"Liron Cohen","is_ca":false},{"name":"T. K. Satish Kumar","is_ca":false},{"name":"Roman Barták","is_ca":false},{"name":"Eli Boyarski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04275484513429419,"gpt":0.2752149483165113,"spread":0.2324601031822171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005100094,0.002039945,0.001374624,0.003638997,0.0012331,0.004489985,0.004669139,0.002853485,0.003154344],"category_scores_gemma":[0.02304451,0.0006852839,0.00105047,0.01084851,0.002123594,0.006865674,0.002821902,0.003772513,0.0009344367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003495203,"about_ca_system_score_gemma":0.002171683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007099685,"about_ca_topic_score_gemma":0.005211484,"domain_scores_codex":[0.993394,0.002227681,0.0006061114,0.001107573,0.002103583,0.0005612011],"domain_scores_gemma":[0.988049,0.007675411,0.000962854,0.001598766,0.00126535,0.0004485639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004780976,0.000579102,0.003189164,0.002964776,0.0001485457,0.0002523839,0.0003449272,0.6129848,0.001276249,0.1435756,0.02899852,0.2052077],"study_design_scores_gemma":[0.0001277325,0.0003549395,0.001657108,0.0006893526,0.00007907765,0.0006125347,0.0004694174,0.7415267,0.003535317,0.1844439,0.06641805,0.00008588006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.08390671,0.07273231,0.749755,0.005020854,0.001152084,0.001189277,0.006855527,0.003992307,0.07539588],"genre_scores_gemma":[0.4124347,0.02147439,0.5506796,0.0007559397,0.0004869373,0.001492577,0.00700237,0.0009999997,0.004673539],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.007099685,"threshold_uncertainty_score":0.02697223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2790412092","doi":"10.1109/taes.2018.2807558","title":"Fast Genetic Algorithm Path Planner for Fixed-Wing Military UAV Using GPU","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":256,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Motion planning; Computer science; Fitness function; Genetic algorithm; Path (computing); Real-time computing; Graphics processing unit; Genetic programming; Simulation; Parallel computing; Robot; Artificial intelligence","authors":[{"name":"Vincent Roberge","is_ca":true},{"name":"Mohammed Tarbouchi","is_ca":true},{"name":"Gilles Labonté","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01591906434887642,"gpt":0.247023846131269,"spread":0.2311047817823926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001797851,0.0004108341,0.0003252209,0.0003664989,0.0003036498,0.0004620133,0.0006682456,0.0004107747,0.001430274],"category_scores_gemma":[0.0007216467,0.0002073205,0.0002996166,0.0003950907,0.0003054302,0.0002822345,0.0002897898,0.0004030923,0.0002122455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007256054,"about_ca_system_score_gemma":0.001143154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01568448,"about_ca_topic_score_gemma":0.01142267,"domain_scores_codex":[0.9998916,0.00002368048,0.000004079629,0.00002020941,0.00004399474,0.00001639329],"domain_scores_gemma":[0.9998221,0.00006921853,0.00001731062,0.00002094218,0.00005880296,0.00001176231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001244587,0.00004246683,0.001137437,0.00007547907,0.00002629222,0.000116031,0.00008397205,0.8979895,0.01197657,0.003944666,0.001621602,0.08286151],"study_design_scores_gemma":[0.00001215671,0.00001985102,0.0001499483,0.000003415668,0.000003661982,0.00001487686,0.000009251329,0.9967636,0.001623599,0.0006208955,0.0007759926,0.000002606349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1407907,0.0003734482,0.8481838,0.0002205445,0.00007018531,0.00009722906,0.0001341799,0.002727991,0.007401903],"genre_scores_gemma":[0.5884654,0.0001934032,0.4083269,0.00004098742,0.000008086942,0.0001437023,0.0002153531,0.0001389031,0.002467277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01568448,"threshold_uncertainty_score":0.0311864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2908972399","doi":"10.1109/tits.2018.2873921","title":"Crash Mitigation in Motion Planning for Autonomous Vehicles","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":253,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Collision avoidance; Crash; Obstacle avoidance; Model predictive control; Motion planning; Obstacle; Collision; Vehicle dynamics; Controller (irrigation); Engineering; Control theory (sociology); Computer science; Simulation; Control (management); Mobile robot; Artificial intelligence; Automotive engineering; Robot; Computer security","authors":[{"name":"Hong Wang","is_ca":true},{"name":"Yanjun Huang","is_ca":true},{"name":"Amir Khajepour","is_ca":true},{"name":"Yubiao Zhang","is_ca":true},{"name":"Yadollah Rasekhipour","is_ca":true},{"name":"Dongpu Cao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02849456097627513,"gpt":0.2712837887534368,"spread":0.2427892277771617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001686421,0.0004052745,0.0003460314,0.0003057398,0.0003842115,0.0002649487,0.0004927355,0.0003354888,0.0006822919],"category_scores_gemma":[0.0004539376,0.0002038841,0.0002590757,0.0002304091,0.0003175021,0.0003021334,0.0003762564,0.0003772544,0.00009469142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003241434,"about_ca_system_score_gemma":0.0006101903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006637006,"about_ca_topic_score_gemma":0.003754667,"domain_scores_codex":[0.9998698,0.0000354212,0.000004100043,0.00002589375,0.00004899822,0.00001581489],"domain_scores_gemma":[0.9998869,0.00004860281,0.00001821342,0.000007743155,0.00003040596,0.000008154765],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007071669,0.00002761826,0.0007170432,0.00008974099,0.00002448574,0.0001271684,0.0001160116,0.8572225,0.009033562,0.0110432,0.000811365,0.1207167],"study_design_scores_gemma":[0.000006622101,0.00005837341,0.0002131203,0.000004969942,0.000005168858,0.00002176837,0.00001888776,0.9955341,0.00130033,0.001806209,0.001026187,0.000004288282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03201311,0.0005687439,0.9648355,0.00009517766,0.00003252993,0.00004164389,0.00001507806,0.0002739529,0.002124246],"genre_scores_gemma":[0.8674552,0.0004090128,0.1295299,0.00004471284,0.00003016468,0.0001195672,0.00004754259,0.00003250342,0.002331299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006637006,"threshold_uncertainty_score":0.01319677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2972941110","doi":"10.1109/lra.2020.2964159","title":"Online Trajectory Generation With Distributed Model Predictive Control for Multi-Robot Motion Planning","year":2020,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":247,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dynamic Systems Analysis (Canada); University of Toronto","funders":"","keywords":"Trajectory; Model predictive control; Computer science; Motion planning; Motion (physics); Control (management); Control theory (sociology); Robot; Artificial intelligence; Physics","authors":[{"name":"Carlos E. Luis","is_ca":true},{"name":"Marijan Vukosavljev","is_ca":true},{"name":"Angela P. Schoellig","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05669042353869146,"gpt":0.2668804501090223,"spread":0.2101900265703308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004069799,0.0007038262,0.0006480832,0.0003750376,0.000433941,0.0006216461,0.001254015,0.0006433759,0.002228023],"category_scores_gemma":[0.001311994,0.0003706927,0.0004224734,0.0004931904,0.000465678,0.0006590101,0.0009048782,0.001034276,0.0004010412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006648607,"about_ca_system_score_gemma":0.00102162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009156998,"about_ca_topic_score_gemma":0.008206282,"domain_scores_codex":[0.9997633,0.00004698754,0.00001035051,0.00005872463,0.00009080317,0.00002985406],"domain_scores_gemma":[0.9994006,0.0003083459,0.00006563611,0.00008130982,0.0001043551,0.00003969332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004525997,0.00003140896,0.000174278,0.0000284204,0.00001193585,0.00003961444,0.00002843103,0.9586383,0.001375569,0.002175248,0.0006250801,0.03682657],"study_design_scores_gemma":[0.000005896927,0.000008816824,0.00001672021,9.834559e-7,0.000001256145,0.000003632967,0.000001825492,0.9988624,0.0002952311,0.0006247397,0.0001772089,0.000001351808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009067374,0.0001081939,0.9884021,0.00008016094,0.00003417523,0.0000301665,0.0000358531,0.0009144663,0.001327496],"genre_scores_gemma":[0.7536238,0.0001404285,0.2436339,0.00006196786,0.00003246436,0.0002294832,0.0001796888,0.0001231371,0.001975157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009156998,"threshold_uncertainty_score":0.01820743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2210721416","doi":"10.1007/s12369-015-0310-2","title":"Socially Adaptive Path Planning in Human Environments Using Inverse Reinforcement Learning","year":2015,"lang":"en","type":"article","venue":"International Journal of Social Robotics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":224,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Artificial intelligence; Robotics; Computer science; Motion planning; Path (computing); Reinforcement; Machine learning; Psychology; Robot; Social psychology","authors":[{"name":"Beomjoon Kim","is_ca":true},{"name":"Joëlle Pineau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07762826465960976,"gpt":0.3289133293213839,"spread":0.2512850646617741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007300273,0.0005513955,0.0006110246,0.0003549312,0.0005357589,0.0005591303,0.0008778421,0.0008723738,0.001344017],"category_scores_gemma":[0.003188821,0.0004450879,0.0004164893,0.0002649381,0.001293279,0.0008765587,0.001329679,0.000914978,0.0001661896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005895124,"about_ca_system_score_gemma":0.0009925957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006609051,"about_ca_topic_score_gemma":0.005673883,"domain_scores_codex":[0.9996616,0.0001434137,0.0000114243,0.0000727743,0.00007248539,0.00003835631],"domain_scores_gemma":[0.9987394,0.0008377308,0.0001247997,0.00009979737,0.0001234436,0.00007487562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005680665,0.00004913042,0.0007685444,0.0000229568,0.00002677423,0.00006280353,0.0001319159,0.9678051,0.001610281,0.00760619,0.0002275276,0.02163187],"study_design_scores_gemma":[0.00000512107,0.00001690315,0.00005696191,0.000001600649,0.000002590916,0.000008474678,0.00001058612,0.995671,0.0001650985,0.00398809,0.00007103575,0.000002381282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0794602,0.00008400537,0.9169312,0.0001568631,0.00002729378,0.00004448881,0.00001192536,0.0002469269,0.003037117],"genre_scores_gemma":[0.9101073,0.00004847021,0.08820598,0.00003584086,0.00001045136,0.00007895821,0.0000212089,0.00003785621,0.001453966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006609051,"threshold_uncertainty_score":0.01314116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044526330","doi":"10.1016/j.robot.2003.11.004","title":"Motion planning for formations of mobile robots","year":2004,"lang":"en","type":"article","venue":"Robotics and Autonomous Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":204,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mobile robot; Computer science; Motion planning; Kinematics; Testbed; Robot; Holonomic; Motion (physics); Class (philosophy); Work (physics); Simulation; Artificial intelligence; Classical mechanics; Computer network; Mechanical engineering; Physics; Engineering","authors":[{"name":"Tim Barfoot","is_ca":false},{"name":"Christopher M. Clark","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02305233861247208,"gpt":0.2605632777199858,"spread":0.2375109391075138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000370669,0.0005934527,0.0006640769,0.0004847102,0.0005924084,0.000658635,0.0009009212,0.0005969054,0.001903604],"category_scores_gemma":[0.002082944,0.0004484676,0.0004334947,0.0007572604,0.00102671,0.001139843,0.001346499,0.001058096,0.0004302713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000645504,"about_ca_system_score_gemma":0.000857093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005099412,"about_ca_topic_score_gemma":0.005658038,"domain_scores_codex":[0.9997565,0.00007552165,0.00001024582,0.00005736979,0.00007296941,0.00002745835],"domain_scores_gemma":[0.9996696,0.0001849556,0.0000438274,0.00003210603,0.00004279267,0.00002676207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006784368,0.00002646098,0.0003217714,0.0001225065,0.00002272202,0.00007304781,0.0001516885,0.800018,0.002595045,0.0787669,0.00273628,0.1150977],"study_design_scores_gemma":[0.00001535209,0.00002049639,0.00008808795,0.00001305628,0.000006245111,0.00002542099,0.00003017988,0.8948412,0.0008989463,0.1007387,0.003316425,0.000005923691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00754924,0.0005315871,0.9898616,0.0001501741,0.0000388541,0.00002348792,0.00003805237,0.0002041642,0.001602886],"genre_scores_gemma":[0.475513,0.001547607,0.5134097,0.00009074252,0.00008547401,0.0002470664,0.0003614915,0.0001756562,0.008569268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005099412,"threshold_uncertainty_score":0.01013947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117927826","doi":"10.1177/0278364911417911","title":"Optimal path planning for surveillance with temporal-logic constraints","year":2011,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Linear temporal logic; Automaton; Computer science; Robot; Motion planning; Path (computing); Temporal logic; Graph; Function (biology); Upload; Finite-state machine; Mathematical optimization; Real-time computing; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Programming language","authors":[{"name":"Stephen L. Smith","is_ca":true},{"name":"Jana Tůmová","is_ca":false},{"name":"Călin Belta","is_ca":false},{"name":"Daniela Rus","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1889076740863805,"gpt":0.390127368633142,"spread":0.2012196945467614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008021138,0.0007820048,0.0005137295,0.0006017063,0.0005771071,0.0007248047,0.0009614162,0.0006226903,0.004591838],"category_scores_gemma":[0.003160236,0.000537249,0.0009739427,0.0005809363,0.001106645,0.001299885,0.0008584526,0.001040925,0.0003775042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315082,"about_ca_system_score_gemma":0.001930846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00667076,"about_ca_topic_score_gemma":0.01171731,"domain_scores_codex":[0.9993356,0.0001843499,0.00003899048,0.0001849286,0.000185861,0.00007025257],"domain_scores_gemma":[0.9983274,0.001305601,0.0001189518,0.00008234083,0.0001321033,0.00003347014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001567525,0.00006198839,0.000614783,0.0002864912,0.00004548327,0.000176683,0.0002058042,0.8593838,0.005090354,0.05939827,0.001735694,0.07284407],"study_design_scores_gemma":[0.0000301035,0.00003270719,0.00007394166,0.00001627494,0.00001349399,0.00003713906,0.00003466874,0.9451054,0.002870519,0.05014404,0.001631166,0.00001050809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01234103,0.00008333012,0.9848598,0.0001082579,0.00001178173,0.00007142458,0.0001832713,0.0008758833,0.001465182],"genre_scores_gemma":[0.2494761,0.0001577947,0.7472664,0.00008579665,0.0000135647,0.0002657895,0.0006475842,0.0003208261,0.001766117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00667076,"threshold_uncertainty_score":0.01536125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105848344","doi":"10.1007/s10472-009-9120-2","title":"Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach","year":2008,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Robot; Computer science; Mobile robot; Set (abstract data type); Task (project management); Distributed computing; Cover (algebra); Greedy algorithm; Algorithm; Real-time computing; Artificial intelligence; Engineering","authors":[{"name":"Ioannis Rekleitis","is_ca":true},{"name":"Ai Peng New","is_ca":false},{"name":"Edward S. Rankin","is_ca":false},{"name":"Howie Choset","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1974527357382306,"gpt":0.3430350180906082,"spread":0.1455822823523776,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006409746,0.0008528791,0.001294709,0.001139008,0.0009675453,0.001444355,0.002312227,0.00168823,0.005583769],"category_scores_gemma":[0.002890059,0.0008005564,0.001029029,0.001259368,0.001068573,0.001834933,0.00273578,0.001160623,0.000604112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001093573,"about_ca_system_score_gemma":0.001137107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004446792,"about_ca_topic_score_gemma":0.00555723,"domain_scores_codex":[0.9995489,0.0001123806,0.00001960463,0.0001145916,0.0001230948,0.00008146013],"domain_scores_gemma":[0.9991105,0.0005753885,0.00007147909,0.00009459007,0.00009897,0.00004903301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000120022,0.00006954018,0.0005564302,0.0001473177,0.00003675486,0.00009944882,0.000116097,0.8659981,0.003096568,0.06760718,0.00212138,0.06003106],"study_design_scores_gemma":[0.0000126879,0.00002243173,0.00009834502,0.000009202855,0.000008444565,0.0000356109,0.0000194638,0.9795369,0.0005172883,0.01897969,0.0007536621,0.000006288852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0103527,0.0001297602,0.9848161,0.0001607495,0.00001391438,0.00005366211,0.00006606951,0.00019485,0.004212273],"genre_scores_gemma":[0.3437843,0.0002849399,0.6483477,0.000112444,0.00004058617,0.0003260376,0.0003253988,0.0001891635,0.006589546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005583769,"threshold_uncertainty_score":0.01867956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077245982","doi":"10.1177/0278364913487931","title":"Optimality and Robustness in Multi-Robot Path Planning with Temporal Logic Constraints","year":2013,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Robot; Correctness; Linear temporal logic; Robustness (evolution); Motion planning; Computer science; Software deployment; Set (abstract data type); Function (biology); Trajectory; Mathematical optimization; Temporal logic; Path (computing); Mathematics; Algorithm; Artificial intelligence; Theoretical computer science","authors":[{"name":"Alphan Ulusoy","is_ca":false},{"name":"Stephen L. Smith","is_ca":true},{"name":"Xu Chu Ding","is_ca":false},{"name":"Călin Belta","is_ca":false},{"name":"Daniela Rus","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1665569467795997,"gpt":0.4004146980893077,"spread":0.2338577513097081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00226239,0.001152299,0.0008757004,0.001079289,0.0006432079,0.001085677,0.001396862,0.0008673316,0.001966375],"category_scores_gemma":[0.008916966,0.0007763496,0.001066287,0.0008271088,0.001418643,0.002249811,0.001690571,0.001279158,0.0002689373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001455865,"about_ca_system_score_gemma":0.001653527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004519544,"about_ca_topic_score_gemma":0.004070035,"domain_scores_codex":[0.9982017,0.000498998,0.0001167203,0.0004087882,0.0005916949,0.0001820675],"domain_scores_gemma":[0.9947173,0.003882969,0.0006128564,0.0003392764,0.0003287013,0.0001189583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001378008,0.00003350157,0.0005110372,0.0001048763,0.00003688977,0.000105544,0.00008019443,0.9440299,0.003124474,0.01952839,0.0003892728,0.03191817],"study_design_scores_gemma":[0.0000148958,0.00004154607,0.00009513064,0.000009202524,0.00001186444,0.00002198054,0.00001022424,0.9808232,0.001754671,0.01686431,0.0003456526,0.000007449929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01843568,0.00013274,0.9794565,0.0001008235,0.00001126478,0.00004438573,0.00007403088,0.0006696178,0.001075004],"genre_scores_gemma":[0.5439915,0.0001765693,0.4534301,0.0001154832,0.00003696195,0.0002290437,0.0002724917,0.0003207755,0.001427032],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004519544,"threshold_uncertainty_score":0.0119648,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119394765","doi":"10.1109/taes.2012.6324664","title":"Flatness-Based Trajectory Planning/Replanning for a Quadrotor Unmanned Aerial Vehicle","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":190,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Defence Research and Development Canada; Concordia University","funders":"","keywords":"Actuator; Control theory (sociology); Trajectory; Flatness (cosmology); Trajectory optimization; Engineering; Motion planning; Control engineering; Computer science; Control (management); Robot; Artificial intelligence; Physics","authors":[{"name":"Abbas Chamseddine","is_ca":true},{"name":"Youmin Zhang","is_ca":true},{"name":"C.A. Rabbath","is_ca":true},{"name":"Cédric Join","is_ca":false},{"name":"Didier Theilliol","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02511185920695837,"gpt":0.272063211421979,"spread":0.2469513522150207,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002272807,0.0007511768,0.0003819848,0.0003124597,0.000339823,0.0003718146,0.0004630942,0.0003392282,0.0006872228],"category_scores_gemma":[0.0003601838,0.0002711893,0.0003235836,0.0002933183,0.0003761747,0.000337559,0.0005573233,0.0003318131,0.0001147914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004889749,"about_ca_system_score_gemma":0.0006356363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0100628,"about_ca_topic_score_gemma":0.005435054,"domain_scores_codex":[0.9998603,0.00002804612,0.000007279775,0.00003945048,0.00003671589,0.00002821628],"domain_scores_gemma":[0.9998624,0.00003953398,0.00003791142,0.00001276336,0.0000304601,0.00001688765],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006731936,0.00001941241,0.000330821,0.00002738623,0.00001584904,0.0001660304,0.00005901785,0.962479,0.009867722,0.00240739,0.0002857962,0.0242743],"study_design_scores_gemma":[0.000007195078,0.00006796644,0.0001870622,0.000001694563,0.000003095745,0.00002049357,0.000009535639,0.9979424,0.0008918115,0.0006741229,0.0001895601,0.000005136464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07862686,0.0001566902,0.9188329,0.0001013997,0.00002028299,0.00006035946,0.00005608886,0.0002513287,0.001894086],"genre_scores_gemma":[0.9454276,0.0001028336,0.0526498,0.00003412278,0.000006764708,0.00007191979,0.0001082302,0.00002318289,0.001575555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0100628,"threshold_uncertainty_score":0.0200085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3004407706","doi":"10.1177/0278364919890396","title":"Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search","year":2020,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Heuristics; A priori and a posteriori; Motion planning; Domain (mathematical analysis); Path (computing); Asymptotically optimal algorithm; Random search; Approximation algorithm; Robotics","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.125463022093777,"gpt":0.3919444532699686,"spread":0.2664814311761916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009306091,0.001224591,0.001327901,0.000720472,0.0006723269,0.001097937,0.001948293,0.001512627,0.004243805],"category_scores_gemma":[0.00456791,0.0007232815,0.0009933227,0.001134274,0.001187094,0.002414083,0.001805967,0.001649667,0.000965272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001122563,"about_ca_system_score_gemma":0.003105644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009496843,"about_ca_topic_score_gemma":0.01371462,"domain_scores_codex":[0.9993411,0.0001756829,0.00004272756,0.0001123486,0.0002395939,0.00008855291],"domain_scores_gemma":[0.9985992,0.0009059738,0.00009827028,0.0001799035,0.0001357643,0.00008089377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002791088,0.00007488713,0.0005969196,0.0002384338,0.00005139447,0.0001057527,0.0001518157,0.8122352,0.002596636,0.05471581,0.006052481,0.1229016],"study_design_scores_gemma":[0.00003856045,0.00007146364,0.00006713407,0.00001903556,0.00001874899,0.00003097495,0.00002199706,0.9695015,0.0008250662,0.02666948,0.002722,0.00001396206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01149523,0.0006206145,0.9802371,0.0002037214,0.00006281681,0.00009900537,0.0001658109,0.00159652,0.00551926],"genre_scores_gemma":[0.3212948,0.0008694853,0.6708235,0.0003417594,0.0000585591,0.0004009822,0.0007715452,0.0004890069,0.00495032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009496843,"threshold_uncertainty_score":0.01888311,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097476511","doi":"10.1109/3477.931512","title":"Neural network approaches to dynamic collision-free trajectory generation","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of Guelph","funders":"","keywords":"Trajectory; Artificial neural network; Computer science; Workspace; Robot; Control theory (sociology); Collision; State space; Artificial intelligence; Mathematics; Control (management)","authors":[{"name":"Simon X. Yang","is_ca":true},{"name":"Max Q.‐H. Meng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07123373920932854,"gpt":0.2404019601251243,"spread":0.1691682209157957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005021503,0.0007255359,0.0005731461,0.0006025783,0.0004473042,0.0006958562,0.001370635,0.001254949,0.002053814],"category_scores_gemma":[0.001735319,0.0004642578,0.0004815678,0.0007963807,0.0007908692,0.001351313,0.000706978,0.001005671,0.0003144338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001198921,"about_ca_system_score_gemma":0.0006610699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005712631,"about_ca_topic_score_gemma":0.003490405,"domain_scores_codex":[0.9997835,0.00006426045,0.00001124223,0.00004771571,0.00006714173,0.00002633127],"domain_scores_gemma":[0.999541,0.0002783881,0.00005335802,0.0000260623,0.00008546069,0.00001574001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001062438,0.000007036895,0.0000709602,0.00002812198,0.00001219948,0.00002634527,0.00002201427,0.9732831,0.0003536653,0.0158445,0.0001400858,0.01020126],"study_design_scores_gemma":[0.000001742558,0.000004227751,0.00001294853,0.000002128898,0.000001880175,0.000005685552,0.000002543466,0.9942223,0.0001237885,0.005408434,0.0002120675,0.000002185611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006599918,0.0008005999,0.9890961,0.0001561452,0.00003648473,0.00001764983,0.00001966387,0.0001083807,0.003165009],"genre_scores_gemma":[0.7667934,0.00235583,0.2210986,0.0001611947,0.000139107,0.0003401596,0.0001297127,0.0001006749,0.008881357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005712631,"threshold_uncertainty_score":0.01135874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153353727","doi":"10.1109/robot.2003.1241759","title":"Genetic algorithm based path planning for a mobile robot","year":2004,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Mobile robot; Motion planning; Computer science; Robot; Genetic algorithm; Path (computing); Chromosome; Algorithm; Any-angle path planning; Mobile robot navigation; Obstacle; Artificial intelligence; Real-time computing; Robot control; Computer network; Machine learning; Geography","authors":[{"name":"Jianping Tu","is_ca":true},{"name":"Simon X. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02012113117139792,"gpt":0.2689770755427387,"spread":0.2488559443713408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002329698,0.0005035729,0.0003972082,0.0004548145,0.0004196263,0.0004507899,0.0007033048,0.0007639898,0.001322296],"category_scores_gemma":[0.0005758343,0.000244169,0.0003759757,0.0004678364,0.0006066346,0.0004755942,0.0003446084,0.0006353247,0.000300641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006447644,"about_ca_system_score_gemma":0.001227019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004878535,"about_ca_topic_score_gemma":0.003822377,"domain_scores_codex":[0.9998351,0.0000420564,0.000006960638,0.00003880659,0.00006286305,0.00001428501],"domain_scores_gemma":[0.9998977,0.00004573265,0.00001343713,0.000007088898,0.00003002546,0.000005940051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004072814,0.00003379051,0.0004029328,0.0001170845,0.00004274815,0.0001753595,0.00009845806,0.8745826,0.009006093,0.02815498,0.001196093,0.08614907],"study_design_scores_gemma":[0.00001977965,0.00005626277,0.0001129353,0.00001391099,0.0000151514,0.00008780049,0.00001776592,0.9843136,0.001846259,0.008195747,0.00530959,0.00001115422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006302621,0.0003209191,0.9908549,0.0001234818,0.00004179552,0.00003429646,0.00001722176,0.0002545447,0.002050237],"genre_scores_gemma":[0.2462333,0.00101218,0.7466518,0.0001081031,0.00003703476,0.0002773174,0.0001243369,0.00006142176,0.005494466],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004878535,"threshold_uncertainty_score":0.009700239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2984588480","doi":"10.1109/tim.2003.816846","title":"Behavior-based neuro-fuzzy controller for mobile robot navigation","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Instrumentation and Measurement","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"","keywords":"Mobile robot; Computer science; Mobile robot navigation; Neuro-fuzzy; Controller (irrigation); Control engineering; Artificial intelligence; Robot; Fuzzy logic; Robot control; Fuzzy control system; Control theory (sociology); Engineering; Control (management)","authors":[{"name":"P. Rusu","is_ca":true},{"name":"Emil M. Petriu","is_ca":true},{"name":"Tara Whalen","is_ca":true},{"name":"A. Cornell","is_ca":false},{"name":"H.J.W. Spoelder","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04561478188813609,"gpt":0.2758882335146639,"spread":0.2302734516265278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001389344,0.0002990068,0.0001790906,0.00017127,0.0002406355,0.0002471999,0.0004908578,0.0003410404,0.0009406055],"category_scores_gemma":[0.000331908,0.0001015137,0.0002077378,0.0001194961,0.0002183361,0.0001941345,0.0001564674,0.0003399284,0.000344366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004091207,"about_ca_system_score_gemma":0.0004408915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005191316,"about_ca_topic_score_gemma":0.007359668,"domain_scores_codex":[0.9999132,0.00001258549,0.000005170315,0.00001398127,0.00004653638,0.000008582233],"domain_scores_gemma":[0.9999166,0.00001774598,0.00001021858,0.000006025673,0.00004437047,0.000005121703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001775597,0.0001482586,0.001086321,0.0002408321,0.00008605442,0.0003476704,0.0001901729,0.6177756,0.09349598,0.01958038,0.00345665,0.2634146],"study_design_scores_gemma":[0.00001510024,0.00007566134,0.0005661462,0.00001264896,0.00002053007,0.0000476968,0.00001349346,0.9865579,0.006826827,0.002838779,0.003014295,0.0000108676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02942497,0.0006604713,0.9585149,0.0001949051,0.0001109685,0.00005720016,0.00004264276,0.001217856,0.009776058],"genre_scores_gemma":[0.8573519,0.0004289409,0.1363024,0.0001248515,0.00003378347,0.0001172289,0.00007019866,0.00003464219,0.005536028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005191316,"threshold_uncertainty_score":0.01032221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011193826","doi":"10.1109/tro.2014.2380593","title":"Multirobot Rendezvous Planning for Recharging in Persistent Tasks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":171,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Time horizon; Robot; Motion planning; Computer science; Scheduling (production processes); Schedule; Robustness (evolution); Travelling salesman problem; Real-time computing; Mathematical optimization; Operations research; Engineering; Artificial intelligence; Mathematics; Aerospace engineering; Algorithm","authors":[{"name":"Neil Mathew","is_ca":true},{"name":"Stephen L. Smith","is_ca":true},{"name":"Steven L. Waslander","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1063186945706296,"gpt":0.3101755045786667,"spread":0.2038568100080371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003682049,0.0006540128,0.0005582075,0.0003215224,0.0006355961,0.0005668825,0.000870724,0.0005331654,0.002317419],"category_scores_gemma":[0.0007254049,0.0003760798,0.0005284927,0.0004286786,0.0006970307,0.0007116226,0.0008226242,0.0006323592,0.0002351457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001061028,"about_ca_system_score_gemma":0.001010837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01371593,"about_ca_topic_score_gemma":0.01470031,"domain_scores_codex":[0.9998073,0.00004940218,0.000007200457,0.00005724187,0.00003640386,0.00004254256],"domain_scores_gemma":[0.999786,0.0001123478,0.00003494849,0.00001874326,0.00002199122,0.00002601192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004817029,0.0000172262,0.000173263,0.00003446984,0.000009861441,0.00006397833,0.0000771047,0.985031,0.000994052,0.004475729,0.0003146506,0.008760544],"study_design_scores_gemma":[0.00001302894,0.00003077173,0.00009323618,0.000003927677,0.000003943667,0.00001270337,0.0000500136,0.9934829,0.0005157663,0.005119862,0.0006698118,0.000004137226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06737916,0.0002402481,0.9271354,0.0001806728,0.00002545863,0.00007795684,0.0001067024,0.000383187,0.004471196],"genre_scores_gemma":[0.8611295,0.0001669817,0.1341412,0.00003872799,0.00001270122,0.0001593305,0.0001742194,0.00009633583,0.004080941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01371593,"threshold_uncertainty_score":0.02727216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2789990415","doi":"10.1155/2018/6392697","title":"Global and Local Path Planning Study in a ROS-Based Research Platform for Autonomous Vehicles","year":2018,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":167,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Motion planning; Trajectory; Point (geometry); Work (physics); Robotics; Software; Computer science; Path (computing); Robot; Collision avoidance; Collision; Simulation; Real-time computing; Artificial intelligence; Engineering","authors":[{"name":"Pablo Marín","is_ca":false},{"name":"Ahmed Hussein","is_ca":false},{"name":"David Martín","is_ca":false},{"name":"Arturo de la Escalera","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06841923027206204,"gpt":0.3728782159994038,"spread":0.3044589857273418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006030604,0.0005583697,0.0003723775,0.0003482571,0.0002716473,0.0004027526,0.0006506147,0.0004188416,0.001291665],"category_scores_gemma":[0.001192716,0.00021199,0.0002294019,0.000297727,0.0003328774,0.0006220331,0.0004909365,0.0004596519,0.0002195837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003304991,"about_ca_system_score_gemma":0.0004812397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002575379,"about_ca_topic_score_gemma":0.002147603,"domain_scores_codex":[0.9996037,0.0001161916,0.00001251195,0.0000919337,0.0001254649,0.00005016036],"domain_scores_gemma":[0.9993487,0.0002660749,0.00009061969,0.0001150807,0.0001254412,0.00005401961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000478535,0.0002278307,0.003376589,0.000222506,0.00006543154,0.0002203634,0.0002243546,0.880718,0.04644101,0.003701465,0.0005002156,0.06382377],"study_design_scores_gemma":[0.00001441772,0.000339332,0.001466131,0.000006244496,0.00001222692,0.00003855749,0.00009448473,0.9850247,0.01166465,0.0006251802,0.0007038505,0.0000102857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6713001,0.0002197265,0.3247778,0.00007952718,0.00003126023,0.00009127771,0.0001122762,0.0009806894,0.002407297],"genre_scores_gemma":[0.9367078,0.00006935905,0.06217968,0.000006051378,0.000003632591,0.00005375521,0.000106499,0.00007416054,0.0007989305],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002575379,"threshold_uncertainty_score":0.005120814,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161298439","doi":"10.1177/0278364914547786","title":"Sampling-based A* algorithm for robot path-planning","year":2014,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Motion planning; Probabilistic roadmap; Computer science; Mathematical optimization; Probabilistic logic; Algorithm; Simulated annealing; Graph; Entropy (arrow of time); Cross entropy; Heuristic; Adaptive simulated annealing; Robot; Artificial intelligence; Mathematics; Theoretical computer science; Principle of maximum entropy","authors":[{"name":"Sven Mikael Persson","is_ca":true},{"name":"Inna Sharf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1415988799837718,"gpt":0.4227342927869594,"spread":0.2811354128031877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007265239,0.0006057307,0.0006419469,0.0007816673,0.0006689117,0.0005405845,0.001297271,0.0007274263,0.003138833],"category_scores_gemma":[0.002222448,0.0003414174,0.0005504901,0.0008740154,0.0007583487,0.0008717107,0.001128607,0.001303182,0.0006530878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006366674,"about_ca_system_score_gemma":0.001272857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003036661,"about_ca_topic_score_gemma":0.003223365,"domain_scores_codex":[0.9995021,0.0001752029,0.00002690036,0.00008382764,0.0001763177,0.00003560284],"domain_scores_gemma":[0.99918,0.000505053,0.00006340715,0.00009549119,0.000115211,0.00004091953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001326993,0.00009198056,0.0004597809,0.0001404163,0.00005558096,0.00006773468,0.00008616129,0.577424,0.004303209,0.06895839,0.002791483,0.3454885],"study_design_scores_gemma":[0.00001422193,0.00006150651,0.00005722043,0.000007918215,0.000007274206,0.00003521697,0.000007734539,0.9801244,0.0008665542,0.01651059,0.002300838,0.000006595782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002590315,0.0001054341,0.9956169,0.00003697569,0.00002365268,0.00003823122,0.00001575075,0.0003003908,0.001272299],"genre_scores_gemma":[0.1189028,0.0001919004,0.8784779,0.00007722742,0.00002907912,0.000258873,0.00009241607,0.0001057561,0.001864006],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003138833,"threshold_uncertainty_score":0.01050049,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148332992","doi":"10.1109/tnn.2009.2029858","title":"Real-Time Robot Path Planning Based on a Modified Pulse-Coupled Neural Network Model","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Mobile robot; Robot; Artificial neural network; Path (computing); Motion planning; Shortest path problem; Event (particle physics); Topology (electrical circuits); Artificial intelligence; Graph; Engineering; Theoretical computer science; Physics; Computer network","authors":[{"name":"Hong Qu","is_ca":true},{"name":"Simon X. Yang","is_ca":true},{"name":"Allan R. Willms","is_ca":true},{"name":"Yi Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02500714723886447,"gpt":0.2536678519390162,"spread":0.2286607047001517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002699006,0.0004526369,0.000457346,0.0002224267,0.0002466683,0.0004717238,0.001313277,0.0008955465,0.001202659],"category_scores_gemma":[0.0007889892,0.0003364739,0.0004164059,0.0003818394,0.0005539081,0.0007448277,0.0004377429,0.0007728895,0.0001880605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006566525,"about_ca_system_score_gemma":0.0005807675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006121258,"about_ca_topic_score_gemma":0.004143539,"domain_scores_codex":[0.9998116,0.00004365104,0.000008241139,0.00004547977,0.00007249848,0.00001861839],"domain_scores_gemma":[0.9997866,0.00009585974,0.00002543633,0.0000149624,0.00006496583,0.00001226551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002607594,0.00001056267,0.0001368323,0.00002648304,0.00001378583,0.00005499342,0.00002787415,0.9862078,0.001828989,0.003839995,0.0001655539,0.007661083],"study_design_scores_gemma":[0.000001982824,0.000006619254,0.00001996704,8.02235e-7,0.000002106894,0.000005611128,8.47329e-7,0.999379,0.000113533,0.0003840637,0.00008393324,0.000001432559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01848116,0.0002210996,0.9776689,0.0001158531,0.00004757907,0.0000273922,0.00002760528,0.0001715446,0.003238957],"genre_scores_gemma":[0.8666682,0.0004517161,0.1259821,0.0001024412,0.00004084989,0.0002191102,0.00007961112,0.00004453514,0.006411421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006121258,"threshold_uncertainty_score":0.01217121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133118325","doi":"10.1109/tsmcc.2007.897499","title":"Neurofuzzy-Based Approach to Mobile Robot Navigation in Unknown Environments","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Fuzzy logic; Mobile robot; Trajectory; Artificial intelligence; Obstacle avoidance; Robot; Artificial neural network; State (computer science); Control engineering; Control theory (sociology); Control (management); Engineering; Algorithm","authors":[{"name":"Anmin Zhu","is_ca":false},{"name":"Simon X. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02259140461650461,"gpt":0.2612784282424843,"spread":0.2386870236259797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002694501,0.0004642604,0.0004605725,0.0006288056,0.0003607578,0.000650926,0.00096214,0.001001211,0.001188165],"category_scores_gemma":[0.0005512754,0.0001890235,0.0005086765,0.0005238351,0.0005443075,0.000757494,0.0003847219,0.0006348394,0.000370815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005670525,"about_ca_system_score_gemma":0.0006053469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00341041,"about_ca_topic_score_gemma":0.003664516,"domain_scores_codex":[0.9998291,0.00003800003,0.000009986467,0.00003580403,0.00007739131,0.000009701144],"domain_scores_gemma":[0.9998758,0.00004678405,0.00001278092,0.000009447111,0.00005053972,0.000004703428],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005394092,0.00006337563,0.0006673178,0.0006222145,0.000142685,0.0005455496,0.0003358504,0.510759,0.01521282,0.152769,0.002745484,0.3160827],"study_design_scores_gemma":[0.00001310578,0.00007051382,0.0002986644,0.00007777318,0.0000461231,0.0002282006,0.00007519289,0.9169378,0.003203182,0.06105411,0.01795358,0.00004171809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002538503,0.002165118,0.9898028,0.0001502381,0.0000937339,0.0000209709,0.00001861722,0.0001166351,0.005093362],"genre_scores_gemma":[0.3769662,0.006163009,0.606854,0.0002833605,0.0002891922,0.0002248263,0.0001071527,0.0000408078,0.009071428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00341041,"threshold_uncertainty_score":0.006781101,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143102370","doi":"10.1109/isvd.2007.43","title":"Voronoi diagram in optimal path planning","year":2007,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voronoi diagram; Smoothness; Disjoint sets; Path (computing); Computer science; Centroidal Voronoi tessellation; Motion planning; Diagram; Relation (database); Algorithm; Computational geometry; Mathematical optimization; Path length; Mathematics; Data mining; Artificial intelligence; Combinatorics; Geometry","authors":[{"name":"Priyadarshi Bhattacharya","is_ca":true},{"name":"Marina L. Gavrilova","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01898327563348483,"gpt":0.2818411438605739,"spread":0.262857868227089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008488722,0.0005072559,0.000996801,0.001143755,0.0005251809,0.001112682,0.001046833,0.0007525072,0.002253873],"category_scores_gemma":[0.003847166,0.00042881,0.0004821212,0.001512235,0.0009712883,0.002027728,0.00117886,0.0009094198,0.0006782008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008320438,"about_ca_system_score_gemma":0.0009788885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004383943,"about_ca_topic_score_gemma":0.003144527,"domain_scores_codex":[0.9990591,0.0003450654,0.00004131491,0.000145635,0.0003520901,0.00005672978],"domain_scores_gemma":[0.9991465,0.0005701747,0.00004312205,0.00007489414,0.0001313635,0.00003392937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009590158,0.00002383899,0.0004913696,0.0002706248,0.00004665978,0.0001177238,0.00012114,0.5837933,0.002247379,0.2573555,0.003065065,0.1523714],"study_design_scores_gemma":[0.00003701187,0.00003701882,0.0001374477,0.00003343134,0.0000148409,0.0001056665,0.00002599458,0.8086858,0.00187838,0.1704396,0.018582,0.00002268501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002259311,0.001125318,0.9946466,0.0000831127,0.00005475219,0.00002307255,0.0000411373,0.0001711534,0.001595411],"genre_scores_gemma":[0.244725,0.002534206,0.7493553,0.0000747525,0.0001263018,0.0001606645,0.0003288064,0.0001649293,0.002529888],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004383943,"threshold_uncertainty_score":0.008716881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167011086","doi":"10.1109/tnn.2003.820618","title":"Real-time collision-free motion planning of a mobile robot using a neural dynamics-based approach","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of Guelph","funders":"","keywords":"Artificial neural network; Computer science; Mobile robot; Motion planning; Robot; Collision; Artificial intelligence; Stability (learning theory); Control theory (sociology); Machine learning","authors":[{"name":"Simon X. Yang","is_ca":true},{"name":"Max Q.‐H. Meng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02357518814957928,"gpt":0.2569635177864598,"spread":0.2333883296368805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000171442,0.0004165721,0.0003392546,0.0002703858,0.0002816391,0.000335816,0.0005808956,0.000646222,0.0009797848],"category_scores_gemma":[0.0004293648,0.0002390551,0.0003713692,0.0002156943,0.0004122647,0.0005433249,0.0004200051,0.0004242201,0.0001227126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004902892,"about_ca_system_score_gemma":0.0006908195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00434988,"about_ca_topic_score_gemma":0.00379033,"domain_scores_codex":[0.9999239,0.00001841966,0.00000439273,0.00001792643,0.00002618134,0.000009118168],"domain_scores_gemma":[0.9998857,0.000050079,0.00002193522,0.000007760874,0.00002556024,0.000008971034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002347732,0.00001784923,0.0001719207,0.00004096079,0.00001625102,0.00008321329,0.00003471623,0.9591486,0.006286941,0.006752105,0.0002106601,0.02721329],"study_design_scores_gemma":[0.000003440167,0.00001199329,0.00003247304,0.000001782536,0.000002944751,0.00001040036,0.000002327563,0.9984276,0.0004468127,0.0009096037,0.0001481955,0.000002560546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01631782,0.0001834545,0.9809925,0.0001482477,0.00002564515,0.00002407122,0.00001313254,0.0001689673,0.002126251],"genre_scores_gemma":[0.8286816,0.0003284412,0.1673724,0.0000755534,0.00002614833,0.0002061077,0.00004021322,0.00002547141,0.00324395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00434988,"threshold_uncertainty_score":0.008649111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2620408778","doi":"10.1002/rob.21722","title":"Adaptive continuous‐space informative path planning for online environmental monitoring","year":2017,"lang":"en","type":"article","venue":"Journal of Field Robotics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Motion planning; Computer science; Path (computing); Real-time computing; Mobile robot; Field (mathematics); Parameterized complexity; Planner; Focus (optics); Scheme (mathematics); Robot; Distributed computing; Computation; Artificial intelligence; Algorithm; Mathematics","authors":[{"name":"Gregory Hitz","is_ca":false},{"name":"Enric Galceran","is_ca":false},{"name":"Marie‐Ève Garneau","is_ca":false},{"name":"François Pomerleau","is_ca":true},{"name":"Roland Siegwart","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04061611656066819,"gpt":0.3027307588796727,"spread":0.2621146423190045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004114641,0.0007638377,0.0005131133,0.0005122296,0.0002970978,0.0004694302,0.0009670135,0.0006625673,0.001010586],"category_scores_gemma":[0.001188915,0.0004152123,0.0005237719,0.0004949109,0.000569072,0.0005172034,0.0007675391,0.000779404,0.0001384952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000618015,"about_ca_system_score_gemma":0.0008885395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006864558,"about_ca_topic_score_gemma":0.005801319,"domain_scores_codex":[0.9997466,0.00007001,0.00000874137,0.0000689553,0.0000705741,0.00003512279],"domain_scores_gemma":[0.999495,0.0003004254,0.00006310827,0.00004516084,0.00006659386,0.00002955983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002948008,0.00001694729,0.0002278217,0.00002119788,0.00001148589,0.00003209232,0.00002710458,0.9797502,0.001458992,0.001391373,0.0002642889,0.01676904],"study_design_scores_gemma":[0.000002660527,0.00000848433,0.00005028379,0.000001188194,0.000001473107,0.000004237117,0.000003164327,0.9989595,0.0002154228,0.0006283578,0.000123845,0.000001425821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03125373,0.000137695,0.9667603,0.00009448209,0.00001630137,0.00002488667,0.00004670027,0.0005690717,0.00109698],"genre_scores_gemma":[0.8259678,0.00009861716,0.172485,0.00004314453,0.00001412027,0.0001026967,0.0001289492,0.00006877106,0.001090881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006864558,"threshold_uncertainty_score":0.01364917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4322742245","doi":"10.3390/drones7030169","title":"Path Planning for Autonomous Drones: Challenges and Future Directions","year":2023,"lang":"en","type":"article","venue":"Drones","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Drone; Motion planning; Planner; Path (computing); Computer science; Key (lock); Popularity; Representation (politics); Control (management); Operations research; Robot; Artificial intelligence; Engineering; Computer security; Computer network","authors":[{"name":"Gopi Gugan","is_ca":true},{"name":"Anwar Haque","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04221454577768203,"gpt":0.2804999206041134,"spread":0.2382853748264314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002778317,0.0007142737,0.0007200265,0.001688472,0.0007615914,0.003208459,0.002372454,0.002786181,0.006145042],"category_scores_gemma":[0.006190584,0.000472089,0.0008064974,0.003117537,0.001092763,0.007870955,0.001462812,0.002270974,0.001979372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071432,"about_ca_system_score_gemma":0.002688379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003963422,"about_ca_topic_score_gemma":0.004423999,"domain_scores_codex":[0.9988686,0.0003334439,0.0001014236,0.0002053348,0.0004074557,0.00008370536],"domain_scores_gemma":[0.9906996,0.005991049,0.0003661526,0.0003215047,0.002321176,0.0003005921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006008329,0.0001424912,0.001193377,0.005583343,0.00006048492,0.0001397477,0.0003400488,0.02700709,0.001093306,0.0430753,0.01514871,0.906156],"study_design_scores_gemma":[0.00006044783,0.0006736093,0.002565965,0.006880382,0.000177425,0.001112419,0.00432627,0.1531551,0.002891214,0.2382717,0.5896699,0.0002156049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0089252,0.8091661,0.1389465,0.02166858,0.001520064,0.0001463506,0.0002264629,0.0004870336,0.0189137],"genre_scores_gemma":[0.06590325,0.7681297,0.1560901,0.001438466,0.001792848,0.000219276,0.0005780873,0.0001327966,0.005715458],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.006145042,"threshold_uncertainty_score":0.02055717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2806851394","doi":"10.1109/access.2018.2845448","title":"Hybrid Trajectory Planning for Autonomous Driving in Highly Constrained Environments","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"China Scholarship Council; University of Waterloo; National Natural Science Foundation of China","keywords":"Computer science; Trajectory; Motion planning; Mathematical optimization; Path (computing); Sampling (signal processing); State space; Control theory (sociology); Computation; Collision; Algorithm; Robot; Mathematics; Artificial intelligence; Computer vision","authors":[{"name":"Yu Zhang","is_ca":false},{"name":"Huiyan Chen","is_ca":false},{"name":"Steven L. Waslander","is_ca":true},{"name":"Jianwei Gong","is_ca":false},{"name":"Guangming Xiong","is_ca":false},{"name":"Kai Liu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03734418699446197,"gpt":0.3052642524935506,"spread":0.2679200654990886,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003386963,0.0005019229,0.0003778803,0.0004018942,0.0003979649,0.0004348213,0.0007979095,0.0004317595,0.001540829],"category_scores_gemma":[0.000782603,0.0003376072,0.000420661,0.0004153102,0.000465233,0.0006682125,0.0008045654,0.0006055745,0.0002715971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004640564,"about_ca_system_score_gemma":0.0009355355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007362368,"about_ca_topic_score_gemma":0.006924091,"domain_scores_codex":[0.9997644,0.0000522384,0.00001242196,0.00005284892,0.00009624665,0.00002181545],"domain_scores_gemma":[0.9996598,0.0001746018,0.00003649863,0.00004801032,0.00005954009,0.00002159896],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007423717,0.0000277807,0.0004682773,0.00005400997,0.0000370614,0.00008720206,0.00009325076,0.899374,0.005355133,0.01087606,0.0007149604,0.08283807],"study_design_scores_gemma":[0.000004146379,0.00001158315,0.00004767965,0.000001705542,0.000001974204,0.00001396812,0.000005833268,0.9968713,0.0006454485,0.001817953,0.0005755256,0.000002911658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007018988,0.00004741887,0.9919987,0.00002180281,0.000007682722,0.00001692054,0.00001979693,0.0003270854,0.0005416627],"genre_scores_gemma":[0.4560644,0.0001227015,0.541366,0.00003680566,0.00001424489,0.000138608,0.0001647249,0.0001332552,0.001959272],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007362368,"threshold_uncertainty_score":0.01463902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127817500","doi":"10.1109/tsmcb.2005.862724","title":"An efficient dynamic system for real-time robot-path planning","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Grid; Motion planning; Robot; Computer science; Path (computing); Point (geometry); Shortest path problem; Grid reference; Any-angle path planning; Dynamic programming; Mobile robot; Algorithm; Artificial intelligence; Mathematics; Theoretical computer science; Graph","authors":[{"name":"Allan R. Willms","is_ca":true},{"name":"Simon X. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01296233798299111,"gpt":0.2443475983269671,"spread":0.2313852603439761,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005543864,0.0009108503,0.000945361,0.0006693113,0.000809992,0.001127622,0.00184563,0.0008950052,0.006697218],"category_scores_gemma":[0.001439951,0.0005467958,0.0005513792,0.0006923194,0.000716626,0.001330835,0.001729341,0.001305928,0.00220177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009001271,"about_ca_system_score_gemma":0.001341332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002955223,"about_ca_topic_score_gemma":0.002748415,"domain_scores_codex":[0.9992343,0.0001335769,0.00003982032,0.0001692246,0.0003479222,0.00007520973],"domain_scores_gemma":[0.9996611,0.0001329237,0.00002804328,0.00006049244,0.00009117106,0.00002627262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001698755,0.0001126256,0.0003348913,0.0003609754,0.00005854497,0.0002233866,0.0001997338,0.5436459,0.02185651,0.09765265,0.008214015,0.3271709],"study_design_scores_gemma":[0.00004570003,0.00005685085,0.00008417354,0.00001813292,0.0000164703,0.00009005287,0.00002008458,0.9598457,0.003742174,0.01245985,0.02359723,0.00002362236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007215707,0.00006816011,0.9970925,0.00002978646,0.00002347188,0.00003033655,0.00002103011,0.0007065439,0.001306672],"genre_scores_gemma":[0.08715501,0.0002797019,0.9076732,0.00007091267,0.000043236,0.000430623,0.0002458988,0.0002736257,0.003827728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006697218,"threshold_uncertainty_score":0.02240437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167554916","doi":"10.1109/icra.2011.5979707","title":"Optimal complete terrain coverage using an Unmanned Aerial Vehicle","year":2011,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Terrain; Computer science; Trajectory; Artificial intelligence; Robotics; Drone; Real-time computing; Computer vision; Domain (mathematical analysis); Remotely operated underwater vehicle; Fixed wing; Mobile robot; Motion planning; Path (computing); Robot; Aerospace engineering; Engineering; Geography; Wing; Mathematics; Cartography","authors":[{"name":"Anqi Xu","is_ca":true},{"name":"Chatavut Viriyasuthee","is_ca":true},{"name":"Ioannis Rekleitis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0937143608320587,"gpt":0.2765359387435016,"spread":0.1828215779114429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001324776,0.0003776772,0.0003450727,0.0003028284,0.00031754,0.0003224374,0.0004791908,0.000343085,0.0005908365],"category_scores_gemma":[0.000559628,0.0001683366,0.0001947272,0.000268369,0.0002658407,0.00046252,0.0006744662,0.0002323288,0.0001653072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002367154,"about_ca_system_score_gemma":0.0003942863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003159178,"about_ca_topic_score_gemma":0.004097309,"domain_scores_codex":[0.9998217,0.00002715003,0.000006347133,0.00004158871,0.0000758917,0.00002733547],"domain_scores_gemma":[0.999796,0.00004056349,0.00003727497,0.00006815044,0.00003533579,0.00002274359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001564152,0.00006765752,0.002494662,0.00007355095,0.00004915434,0.0003388675,0.0002299065,0.6989068,0.06471878,0.004311824,0.001558768,0.2270936],"study_design_scores_gemma":[0.0000171475,0.00006955911,0.0006782797,0.000003632464,0.000008362969,0.00007101498,0.00002211905,0.9859972,0.01043539,0.001135775,0.00155456,0.000006943917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2463058,0.0001589024,0.7478712,0.00006447568,0.00002101147,0.00005492653,0.00009235537,0.001816235,0.00361506],"genre_scores_gemma":[0.8087254,0.00006369199,0.1898985,0.00001994076,0.000009994031,0.00003650213,0.0001636505,0.00005824041,0.001024011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003159178,"threshold_uncertainty_score":0.006281555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098519927","doi":"10.1109/tro.2006.870668","title":"Modified Newton's method applied to potential field-based navigation for mobile robots","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Gradient descent; Obstacle; Newton's method; Oscillation (cell signaling); Descent (aeronautics); Potential field; Mobile robot; Computer science; Control theory (sociology); Field (mathematics); Obstacle avoidance; Robot; Mathematical optimization; Control engineering; Artificial intelligence; Mathematics; Engineering; Aerospace engineering; Control (management); Physics; Artificial neural network","authors":[{"name":"Jing Ren","is_ca":true},{"name":"Kenneth McIsaac","is_ca":true},{"name":"Rajni V. Patel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01517967350413403,"gpt":0.2785286964162237,"spread":0.2633490229120897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004351726,0.0005592811,0.0005869119,0.0005000181,0.0003673715,0.0003532527,0.0008036064,0.0007474262,0.001428395],"category_scores_gemma":[0.001962217,0.0003510487,0.000455457,0.0005730925,0.0005339371,0.0008126647,0.0005881047,0.0007064396,0.0004520165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003320112,"about_ca_system_score_gemma":0.0007235683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002786585,"about_ca_topic_score_gemma":0.002310283,"domain_scores_codex":[0.9997339,0.0001053607,0.00001199618,0.0000288259,0.0001068941,0.00001297319],"domain_scores_gemma":[0.9994859,0.0002998724,0.00004269603,0.00003664622,0.0001136703,0.00002130647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00011249,0.00005026961,0.0008125833,0.0003186452,0.00009796575,0.0002896195,0.0002292521,0.5201221,0.02734434,0.06088854,0.004574256,0.38516],"study_design_scores_gemma":[0.00001134316,0.00003625591,0.0001444964,0.00001128525,0.000006674867,0.00007664207,0.000007276348,0.9838064,0.002055922,0.007842113,0.005987542,0.00001401541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002951533,0.0002564287,0.9954545,0.00007313489,0.00007904035,0.00002630326,0.000009847744,0.0001557795,0.0009933173],"genre_scores_gemma":[0.1418503,0.0006826178,0.8531052,0.00009263477,0.00007247987,0.0002318588,0.00004530768,0.0001653792,0.003754051],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002786585,"threshold_uncertainty_score":0.005540729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973546417","doi":"10.1177/0278364910388315","title":"Bounding on rough terrain with the LittleDog robot","year":2010,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Motion planning; Bounding overwatch; Computer science; Kinematics; Control theory (sociology); Terrain; Underactuation; Robot; Configuration space; Collision detection; Mathematics; Artificial intelligence; Collision","authors":[{"name":"Alexander Shkolnik","is_ca":false},{"name":"Michael Levashov","is_ca":true},{"name":"Ian R. Manchester","is_ca":true},{"name":"Russ Tedrake","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0637981599763835,"gpt":0.3800991571025951,"spread":0.3163009971262116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001721024,0.0005320865,0.0005337496,0.0003489494,0.0005278778,0.0004207055,0.0007521882,0.0005265579,0.001835441],"category_scores_gemma":[0.000582705,0.0003262665,0.0003622454,0.0002059538,0.0007149616,0.0005088086,0.001098769,0.000550653,0.0004336921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003518801,"about_ca_system_score_gemma":0.000658991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002950097,"about_ca_topic_score_gemma":0.003639921,"domain_scores_codex":[0.9998908,0.00001612111,0.000004959615,0.00002312246,0.00004597564,0.00001892922],"domain_scores_gemma":[0.9998426,0.00006072099,0.00002168692,0.00002711416,0.00002143359,0.00002630532],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001561818,0.00007335418,0.001266862,0.0001363123,0.00002487232,0.0006466817,0.0003807947,0.7370798,0.04331889,0.0399303,0.003074233,0.1739117],"study_design_scores_gemma":[0.00002326583,0.00008212818,0.0002205951,0.00001598386,0.00000612041,0.0001352436,0.00003814271,0.9782121,0.005570304,0.00824534,0.007434081,0.00001670667],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02409416,0.00006913238,0.9706778,0.00008498369,0.00002180558,0.0001005429,0.0000402589,0.001620546,0.00329072],"genre_scores_gemma":[0.3719128,0.0001359052,0.6244689,0.00005267574,0.00001040875,0.000228993,0.0001514191,0.0001417337,0.00289716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002950097,"threshold_uncertainty_score":0.006140172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988196484","doi":"10.1109/tnn.2011.2169808","title":"Bioinspired Neural Network for Real-Time Cooperative Hunting by Multirobots in Unknown Environments","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Robot; Computer science; Artificial neural network; Artificial intelligence; Robotics; Motion planning; Alliance; Path (computing); Collision avoidance; Order (exchange); Collision; Computer security","authors":[{"name":"Jianjun Ni","is_ca":false},{"name":"Simon X. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02645550093874028,"gpt":0.238045988728049,"spread":0.2115904877893087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007072028,0.0004807555,0.0003967467,0.0002617777,0.0003260256,0.0004628307,0.0009978913,0.001020677,0.0009419812],"category_scores_gemma":[0.001470249,0.0002370542,0.0003400296,0.0002795969,0.0004645541,0.0008002479,0.0005704968,0.0008830483,0.0001568106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005907741,"about_ca_system_score_gemma":0.0006269654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004179981,"about_ca_topic_score_gemma":0.003211535,"domain_scores_codex":[0.9998053,0.00005078085,0.00001337509,0.00005242969,0.00005685157,0.00002135291],"domain_scores_gemma":[0.9996483,0.0001537463,0.00005167523,0.00002685108,0.000100174,0.00001912611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006869181,0.00006413352,0.0005618009,0.00005429483,0.00003803915,0.00009996504,0.00006466248,0.9220831,0.004101175,0.003859837,0.0005958206,0.06840844],"study_design_scores_gemma":[0.000003630164,0.00001475564,0.00004941311,0.000002173839,0.000003041736,0.00000779628,0.000002400268,0.9987524,0.0003223178,0.0007069915,0.0001329432,0.000002281094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05579216,0.0009489135,0.9392302,0.0003250031,0.0001205181,0.00003864832,0.00002415913,0.0004856021,0.003034705],"genre_scores_gemma":[0.858046,0.0005368699,0.1372651,0.0001853379,0.00004073388,0.0001840598,0.0000895435,0.00002762545,0.003624643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004179981,"threshold_uncertainty_score":0.008311331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911442729","doi":"10.1016/j.ast.2019.01.061","title":"An iterative strategy for task assignment and path planning of distributed multiple unmanned aerial vehicles","year":2019,"lang":"en","type":"article","venue":"Aerospace Science and Technology","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"China Scholarship Council","keywords":"Motion planning; Computer science; Computation; Task (project management); Distributed computing; Path (computing); Iterative and incremental development; Process (computing); Drone; Computational complexity theory; Stability (learning theory); Range (aeronautics); Real-time computing; Artificial intelligence; Engineering; Systems engineering; Algorithm; Machine learning; Robot; Computer network","authors":[{"name":"Weiran Yao","is_ca":true},{"name":"Naiming Qi","is_ca":false},{"name":"Neng Wan","is_ca":false},{"name":"Yongbei Liu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01517029528720818,"gpt":0.2711193924361123,"spread":0.2559490971489041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005908779,0.0008267928,0.0006957186,0.0006594153,0.0007003022,0.0005932078,0.001371242,0.0007219322,0.002007427],"category_scores_gemma":[0.001865453,0.0004557658,0.0005688277,0.0006893622,0.0005860913,0.0007452501,0.001430862,0.0006582757,0.000370687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000753816,"about_ca_system_score_gemma":0.00171249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01262617,"about_ca_topic_score_gemma":0.01263663,"domain_scores_codex":[0.999536,0.0001072682,0.00002129515,0.00007854468,0.0001848156,0.00007198357],"domain_scores_gemma":[0.9994403,0.0002331693,0.00004914293,0.0000480921,0.000181258,0.00004816807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001432143,0.0001024454,0.0004387879,0.0001024198,0.00005307164,0.0001474193,0.0002675879,0.7934228,0.01032133,0.01618508,0.002124164,0.1766917],"study_design_scores_gemma":[0.00001587112,0.00005445024,0.00007911213,0.000004220519,0.000007275883,0.00001897164,0.0000167589,0.9954298,0.0008449672,0.002921924,0.000600326,0.00000635066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009350142,0.00004233061,0.9881439,0.00003154625,0.00001771558,0.00006314007,0.00001963303,0.0001985706,0.002132989],"genre_scores_gemma":[0.3969212,0.00009797089,0.5991367,0.0000688917,0.00002238325,0.0003694281,0.0001441473,0.0001000676,0.00313932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01262617,"threshold_uncertainty_score":0.02510536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153340051","doi":"10.1109/rose.2011.6058518","title":"An improved Artificial Potential Field approach to real-time mobile robot path planning in an unknown environment","year":2011,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université TÉLUQ; École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Potential field; Mobile robot; Motion planning; Robot; Trajectory; Computer science; Path (computing); Field (mathematics); Artificial intelligence; Computer vision; Simulation; Mathematics; Physics","authors":[{"name":"Joe Sfeir","is_ca":true},{"name":"Maarouf Saad","is_ca":true},{"name":"Hamadou Saliah-Hassane","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02861287975422475,"gpt":0.249628712567303,"spread":0.2210158328130783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004392247,0.0005152075,0.0005681614,0.00057675,0.000298005,0.0004693665,0.0009453568,0.0007977597,0.001181263],"category_scores_gemma":[0.001014015,0.0002419748,0.0004998666,0.0005418789,0.0004922905,0.0009395669,0.0005315006,0.0006442404,0.0002477338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004234542,"about_ca_system_score_gemma":0.0005420922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001959668,"about_ca_topic_score_gemma":0.001112807,"domain_scores_codex":[0.9998019,0.00007253229,0.000007910323,0.00002627201,0.00007586501,0.00001545013],"domain_scores_gemma":[0.9997533,0.0001281241,0.00001806682,0.00001307633,0.00006982331,0.00001750425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006227149,0.00002526322,0.0001371852,0.00009805738,0.00002947234,0.0001529052,0.00005149413,0.8741507,0.007655033,0.02532564,0.00126886,0.09104311],"study_design_scores_gemma":[0.000007804382,0.00002260947,0.00003880533,0.000003324446,0.000002920871,0.00003306338,0.000002982084,0.9947183,0.0003293597,0.003502403,0.001330723,0.000007710383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004657268,0.0003463177,0.9933218,0.00009599649,0.00005037463,0.00001344674,0.0000109136,0.0001233321,0.001380623],"genre_scores_gemma":[0.3870497,0.0009945458,0.6051151,0.000140096,0.0001299131,0.0002096291,0.00009904903,0.0001236867,0.006138396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001959668,"threshold_uncertainty_score":0.003951728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122128939","doi":"10.1613/jair.1789","title":"Learning in Real-Time Search: A Unifying Framework","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Computer science; Heuristic; Scalability; Completeness (order theory); Function (biology); Convergence (economics); Control (management); Machine learning; Mathematical optimization; Artificial intelligence; Mathematics","authors":[{"name":"Vadim Bulitko","is_ca":true},{"name":"G. Lee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1779391985443843,"gpt":0.4233065913614683,"spread":0.245367392817084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002884503,0.001141312,0.001473401,0.00172253,0.0006713306,0.003646165,0.003363899,0.001939513,0.002568426],"category_scores_gemma":[0.006080213,0.0005474568,0.001636082,0.001984494,0.004815147,0.006908947,0.002816518,0.0030891,0.0006487027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002471363,"about_ca_system_score_gemma":0.002184373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004034313,"about_ca_topic_score_gemma":0.002158854,"domain_scores_codex":[0.9979101,0.0006689448,0.0001443809,0.0004256431,0.0006507661,0.0002002043],"domain_scores_gemma":[0.997131,0.001434635,0.000261027,0.0006114577,0.0003447295,0.00021715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005826028,0.00004738664,0.0003876394,0.0002007146,0.00004727646,0.00006969133,0.0001986579,0.342153,0.0008517058,0.5973992,0.00100643,0.0575801],"study_design_scores_gemma":[0.00002697438,0.0000669869,0.000163973,0.00005544683,0.0000188594,0.00004920489,0.00004748321,0.6893959,0.0005168541,0.3015801,0.008054414,0.00002380544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002641543,0.001616696,0.9913985,0.0004269987,0.00005137541,0.00002860956,0.00002697382,0.0001587947,0.003650549],"genre_scores_gemma":[0.4089018,0.005339745,0.579154,0.0003976249,0.0006955586,0.0003225902,0.0001488447,0.000235838,0.004803943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004034313,"threshold_uncertainty_score":0.01793104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012270409","doi":"10.1016/j.aei.2012.01.003","title":"Improving lifting motion planning and re-planning of cranes with consideration for safety and efficiency","year":2012,"lang":"en","type":"article","venue":"Advanced Engineering Informatics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Motion planning; Smoothness; Path (computing); Computer science; Motion (physics); Dual (grammatical number); Random tree; Industrial engineering; Real-time computing; Operations research; Mathematical optimization; Engineering; Simulation; Artificial intelligence; Mathematics; Robot","authors":[{"name":"Cheng Zhang","is_ca":true},{"name":"Amin Hammad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01011370789131629,"gpt":0.2276223989829556,"spread":0.2175086910916393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005111899,0.0009468713,0.0009050131,0.0005883496,0.000601774,0.0005590021,0.001125326,0.0006438884,0.003104846],"category_scores_gemma":[0.002071902,0.0006188597,0.0005394367,0.0006181511,0.0003370135,0.0011077,0.0008360062,0.0007961908,0.0005365013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004196875,"about_ca_system_score_gemma":0.001658505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01226281,"about_ca_topic_score_gemma":0.01329582,"domain_scores_codex":[0.999691,0.00005885612,0.00001517856,0.00007201286,0.0001084009,0.0000545437],"domain_scores_gemma":[0.9993994,0.0002247874,0.00006458972,0.0001164328,0.0001632904,0.00003148173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001077268,0.00007377127,0.000969877,0.00008204257,0.00001898694,0.00005339406,0.00006881086,0.8503227,0.01066436,0.001764221,0.0006367142,0.1352375],"study_design_scores_gemma":[0.00001003671,0.00005101495,0.0004491812,0.000005596101,0.0000115392,0.00001912364,0.00002706602,0.9946373,0.003272293,0.001030121,0.000481218,0.000005573354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06704117,0.0001307041,0.928595,0.00009125963,0.00003000434,0.00008824772,0.00004427609,0.000851847,0.003127429],"genre_scores_gemma":[0.5840452,0.0001494641,0.4131976,0.00003320998,0.0000203115,0.00008847755,0.0001423563,0.000155092,0.002168244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01226281,"threshold_uncertainty_score":0.02438289,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164561380","doi":"10.1109/tsmcb.2005.850177","title":"A Layered Goal-Oriented Fuzzy Motion Planning Strategy for Mobile Robot Navigation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Motion planning; Mobile robot; Fuzzy logic; Computer science; Robot; Mobile robot navigation; Artificial intelligence; Planner; Visibility; Computer vision; Real-time computing; Simulation; Robot control; Geography","authors":[{"name":"Xiaoyu Yang","is_ca":true},{"name":"M. Moallem","is_ca":true},{"name":"Rajni V. Patel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02858775443073196,"gpt":0.2760073936517535,"spread":0.2474196392210216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002378563,0.0004809664,0.000274918,0.0003083866,0.000312488,0.000423489,0.000655239,0.0004650514,0.0008719774],"category_scores_gemma":[0.0004322357,0.0001719528,0.0003959345,0.0002231139,0.0003291825,0.0004897724,0.0003628631,0.0004478558,0.0002356677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005229922,"about_ca_system_score_gemma":0.0008672366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006390439,"about_ca_topic_score_gemma":0.006930153,"domain_scores_codex":[0.9998714,0.00002039687,0.000009809149,0.00002588713,0.00005726815,0.00001527989],"domain_scores_gemma":[0.9999127,0.00002207327,0.00001438652,0.000007620435,0.00003443703,0.000008657669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001206222,0.00009058505,0.0008736748,0.0002382421,0.00008987463,0.0003674939,0.0004526429,0.5997726,0.05788017,0.03838818,0.001791243,0.2999347],"study_design_scores_gemma":[0.00002666423,0.0001220294,0.0002388083,0.00002038523,0.00003221361,0.00009701402,0.0000284507,0.9841576,0.005667263,0.007210351,0.002374762,0.00002447146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006099298,0.00008862204,0.9925011,0.00004283488,0.00001152525,0.00003199873,0.00001466437,0.000185003,0.001025002],"genre_scores_gemma":[0.4510261,0.0002321267,0.5465755,0.00007986021,0.00001362882,0.0001680454,0.00008798256,0.00001939419,0.001797354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006390439,"threshold_uncertainty_score":0.01270652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969839206","doi":"10.1109/tcyb.2014.2360368","title":"A Multirobot Path-Planning Strategy for Autonomous Wilderness Search and Rescue","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Motion planning; Search and rescue; Path (computing); Robot; Computer science; Software deployment; Piecewise; Set (abstract data type); Mathematical optimization; Rescue robot; Operations research; Artificial intelligence; Mobile robot; Engineering; Mathematics; Computer network","authors":[{"name":"Ashish Macwan","is_ca":true},{"name":"Julio Vilela","is_ca":true},{"name":"Goldie Nejat","is_ca":true},{"name":"B. Benhabib","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04285276070436285,"gpt":0.293325741213344,"spread":0.2504729805089812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003563324,0.0005883389,0.0003512432,0.0003904116,0.0004871935,0.0003352523,0.0009987915,0.0005654069,0.001566039],"category_scores_gemma":[0.0008537703,0.0002307754,0.000270974,0.0002644538,0.0005672497,0.0006550736,0.000898324,0.0004740253,0.00024358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004268749,"about_ca_system_score_gemma":0.0007579196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00203116,"about_ca_topic_score_gemma":0.002562114,"domain_scores_codex":[0.999783,0.00006123416,0.000009377773,0.00004656406,0.00007922218,0.0000205206],"domain_scores_gemma":[0.9998112,0.00007477956,0.00003618697,0.00001994286,0.00003706374,0.00002075862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006096575,0.00006676495,0.0003688528,0.0000962116,0.00003215085,0.0002157293,0.000181208,0.8527016,0.009457394,0.03816582,0.001160805,0.09749249],"study_design_scores_gemma":[0.00001386672,0.0000815122,0.00007963384,0.00000684907,0.000006762411,0.00006572071,0.00002733578,0.9892888,0.001316998,0.007064357,0.002040142,0.000007995394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006222145,0.00005036595,0.9921009,0.00006381472,0.00000977403,0.00003279738,0.00001150176,0.00008967594,0.001419107],"genre_scores_gemma":[0.466308,0.0001401851,0.5304286,0.00006659411,0.00001611436,0.0002197282,0.00005983079,0.00004335395,0.0027176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00203116,"threshold_uncertainty_score":0.00523895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155682648","doi":"10.1109/ific.2000.859866","title":"Sensor data fusion using Kalman filter","year":2000,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer vision; Odometry; Sensor fusion; Kalman filter; Extended Kalman filter; Computer science; Sonar; Artificial intelligence; Mobile robot; SIGNAL (programming language); Robot; Simultaneous localization and mapping","authors":[{"name":"Jurek Z. Sąsiadek","is_ca":true},{"name":"P. Hartana","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0898081006643325,"gpt":0.3046306442318942,"spread":0.2148225435675617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071849,0.0008417223,0.001242919,0.001343709,0.0005365509,0.00126982,0.0006580496,0.0007881761,0.001469297],"category_scores_gemma":[0.002588073,0.0003781408,0.0008879271,0.00165409,0.0003082058,0.002033457,0.001191899,0.0008401369,0.00088652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005932963,"about_ca_system_score_gemma":0.0007984765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005644204,"about_ca_topic_score_gemma":0.002713487,"domain_scores_codex":[0.9989406,0.0001560014,0.0001047903,0.0002740737,0.0004475357,0.00007702638],"domain_scores_gemma":[0.9993819,0.000137953,0.00006667229,0.0001007052,0.0002977244,0.00001493653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003436872,0.00006829995,0.001614697,0.0003652712,0.0003084025,0.0001632795,0.0002868225,0.1963611,0.03092808,0.007758173,0.00342846,0.7583737],"study_design_scores_gemma":[0.00005116299,0.0001972401,0.002282519,0.00007694815,0.0001587471,0.0001555263,0.00008119241,0.939371,0.02918202,0.01203851,0.01631505,0.00009017676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00555336,0.0006550053,0.9912992,0.0000799237,0.00009435544,0.00004519855,0.0001086487,0.001252315,0.0009119876],"genre_scores_gemma":[0.5387176,0.002462323,0.4531167,0.0001840516,0.0002057258,0.0002835948,0.001034299,0.000121356,0.003874382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005644204,"threshold_uncertainty_score":0.01122272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4323361905","doi":"10.3390/math11051273","title":"Mountaineering Team-Based Optimization: A Novel Human-Based Metaheuristic Algorithm","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Metaheuristic; Computer science; Mathematical optimization; Algorithm; Convergence (economics); Optimization algorithm; Optimization problem; Engineering optimization; Wilcoxon signed-rank test; Range (aeronautics); Imperialist competitive algorithm; Rank (graph theory); Meta-optimization; Mathematics; Engineering","authors":[{"name":"Iman Faridmehr","is_ca":false},{"name":"Moncef L. Nehdi","is_ca":true},{"name":"Iraj Faraji Davoudkhani","is_ca":false},{"name":"Alireza Poolad","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03782347851677414,"gpt":0.2782499568333361,"spread":0.2404264783165619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008480395,0.0007908172,0.001019609,0.0007451245,0.0005330202,0.000760192,0.001565081,0.001595357,0.001892247],"category_scores_gemma":[0.001196806,0.0003771166,0.0009694868,0.0007167394,0.0006318213,0.0006600916,0.001042878,0.0009208544,0.0003376936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005202487,"about_ca_system_score_gemma":0.001200851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003393617,"about_ca_topic_score_gemma":0.002525514,"domain_scores_codex":[0.9996364,0.000138924,0.00001471382,0.00005679949,0.0001113731,0.00004172742],"domain_scores_gemma":[0.9996804,0.0001643797,0.00004725615,0.00002437256,0.00005831861,0.00002531998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004721612,0.00005745995,0.0005298593,0.00008706963,0.00009536299,0.00006696417,0.0000595377,0.9307472,0.001753525,0.01193041,0.00160234,0.0530231],"study_design_scores_gemma":[0.00001481476,0.00002856576,0.00005491395,0.000007120698,0.000007237352,0.00001932677,0.000006711443,0.9967998,0.0001754408,0.001739576,0.001142374,0.000004036853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007280366,0.0003313392,0.9890865,0.0001341365,0.00005453821,0.00004636776,0.00002112415,0.000165293,0.002880289],"genre_scores_gemma":[0.3226654,0.0005165376,0.6713223,0.0003114363,0.0001212124,0.0005026319,0.0001456769,0.000141305,0.004273525],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003393617,"threshold_uncertainty_score":0.006747723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1674276221","doi":"10.1109/icinfa.2015.7279550","title":"The obstacle detection and obstacle avoidance algorithm based on 2-D lidar","year":2015,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Obstacle avoidance; Obstacle; Mobile robot; Computer science; Collision avoidance; Computer vision; Lidar; Artificial intelligence; Cluster analysis; Point cloud; Robot; Algorithm; Collision; Remote sensing; Geography","authors":[{"name":"Yan Peng","is_ca":false},{"name":"Dong Qu","is_ca":false},{"name":"Yuxuan Zhong","is_ca":false},{"name":"Shaorong Xie","is_ca":false},{"name":"Jun Luo","is_ca":false},{"name":"Jason Gu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02213955529363215,"gpt":0.2399137672042231,"spread":0.217774211910591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002216614,0.0004149695,0.0005062285,0.000678828,0.0006066976,0.0005156592,0.0009518498,0.0006039525,0.0010441],"category_scores_gemma":[0.000555006,0.0004048128,0.0004499991,0.0005433272,0.000236515,0.0009170933,0.0007555147,0.0005365998,0.0002965101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003635686,"about_ca_system_score_gemma":0.001163573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00444009,"about_ca_topic_score_gemma":0.003414974,"domain_scores_codex":[0.9997525,0.00002304837,0.00001348712,0.00005438846,0.0001327489,0.00002384903],"domain_scores_gemma":[0.9998468,0.00003314547,0.00001967861,0.0000117761,0.00007753563,0.00001095796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001255349,0.0001093473,0.002342376,0.0002482794,0.00007581557,0.0002580089,0.0003533809,0.1899564,0.04988536,0.01064429,0.004136904,0.7418643],"study_design_scores_gemma":[0.00004293865,0.0001067964,0.001003268,0.00001965318,0.00002126657,0.0002505797,0.0000643067,0.9799293,0.01153569,0.002530632,0.004462434,0.00003317475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01650424,0.0002258094,0.9805988,0.0001327605,0.0000494072,0.00008501773,0.00003555959,0.0005638275,0.001804582],"genre_scores_gemma":[0.3424211,0.0005530035,0.6517475,0.0001562332,0.00004379641,0.0004254929,0.0002091898,0.00005440954,0.004389277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00444009,"threshold_uncertainty_score":0.008828521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313887139","doi":"10.1109/tits.2022.3231259","title":"TriPField: A 3D Potential Field Model and Its Applications to Local Path Planning of Autonomous Vehicles","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"National Key Research and Development Program of China; Shanghai Municipal Education Commission","keywords":"Motion planning; Potential field; Field (mathematics); Path (computing); Computer science; Engineering; Artificial intelligence; Physics; Robot; Mathematics; Computer network","authors":[{"name":"Yuxiong Ji","is_ca":false},{"name":"Lantao Ni","is_ca":false},{"name":"Cong Zhao","is_ca":false},{"name":"Cailin Lei","is_ca":false},{"name":"Yuchuan Du","is_ca":false},{"name":"Wenshuo Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03756214042533879,"gpt":0.2856261898372818,"spread":0.248064049411943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003618438,0.0006416154,0.0005127933,0.0006961739,0.000395903,0.0006619857,0.00121087,0.0008021432,0.001786462],"category_scores_gemma":[0.001000877,0.0003594134,0.0006779278,0.0008063594,0.0006508671,0.00127366,0.001042382,0.0008937935,0.0003441299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00067998,"about_ca_system_score_gemma":0.0009129634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007528538,"about_ca_topic_score_gemma":0.003644948,"domain_scores_codex":[0.9998738,0.00003449163,0.000006711678,0.0000248818,0.00004696854,0.00001317066],"domain_scores_gemma":[0.9997398,0.0001162806,0.00003351411,0.00002133234,0.00006226384,0.00002688151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001515728,0.000008961419,0.0001583031,0.00003046671,0.00000883846,0.0000461471,0.00003016183,0.9604354,0.00117126,0.01769135,0.0008837605,0.01952014],"study_design_scores_gemma":[0.000001933153,0.000006378898,0.00002026436,0.000002291402,0.00000130003,0.00001259524,0.000003155222,0.9955474,0.0001570923,0.003526263,0.0007177914,0.000003546537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00284517,0.000156465,0.9954082,0.00009687914,0.0000204302,0.00001999186,0.00006357683,0.0001587748,0.001230317],"genre_scores_gemma":[0.560378,0.00133323,0.4310218,0.0001591291,0.0000809287,0.0004131767,0.0005763278,0.0002874507,0.005749973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007528538,"threshold_uncertainty_score":0.01496947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076406387","doi":"10.1007/s10514-013-9364-x","title":"Efficient complete coverage of a known arbitrary environment with applications to aerial operations","year":2013,"lang":"en","type":"article","venue":"Autonomous Robots","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Traverse; Eulerian path; Path (computing); Motion planning; Trajectory; Holonomic; Decomposition; Field (mathematics); Algorithm; Real-time computing; Artificial intelligence; Robot; Lagrangian; Mathematics","authors":[{"name":"Anqi Xu","is_ca":true},{"name":"Chatavut Viriyasuthee","is_ca":true},{"name":"Ioannis Rekleitis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01477663640478388,"gpt":0.2220081252056224,"spread":0.2072314888008386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001677874,0.0007203732,0.0006368782,0.0005169269,0.0003611542,0.0004466546,0.0007178984,0.0005139913,0.001310217],"category_scores_gemma":[0.001143476,0.0003759371,0.0003204892,0.0008206278,0.0004416695,0.001022048,0.001451726,0.0004485843,0.000234621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002263232,"about_ca_system_score_gemma":0.0004035563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002472595,"about_ca_topic_score_gemma":0.003490999,"domain_scores_codex":[0.9997972,0.00002920227,0.00000636971,0.00004127184,0.00009950381,0.00002651751],"domain_scores_gemma":[0.9996281,0.0001947667,0.00004002347,0.00006580913,0.00004775932,0.00002351291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001126116,0.0000342196,0.0003484666,0.0000902086,0.00002219877,0.0001771028,0.0001079962,0.8502844,0.01153295,0.0092757,0.002105488,0.1259086],"study_design_scores_gemma":[0.000008331647,0.00002712082,0.0002299965,0.000004694546,0.000004485748,0.00006413671,0.00001696301,0.9906754,0.002151187,0.005930442,0.0008825099,0.000004612266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05825726,0.0003572292,0.9369419,0.00008294038,0.00001601891,0.00002322617,0.0001551009,0.0004444194,0.003721741],"genre_scores_gemma":[0.7647758,0.0005559525,0.2297565,0.00003524814,0.00003678993,0.0001111217,0.0005659173,0.0001122066,0.004050417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002472595,"threshold_uncertainty_score":0.00491637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037071615","doi":"10.1016/j.robot.2005.10.005","title":"Real-time safety for human–robot interaction","year":2005,"lang":"en","type":"article","venue":"Robotics and Autonomous Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Robot; Trajectory; Human–robot interaction; Collision avoidance; Motion (physics); Measure (data warehouse); Index (typography); Simulation; Artificial intelligence; Collision; Data mining; Computer security","authors":[{"name":"Dana Kulić","is_ca":true},{"name":"Elizabeth A. Croft","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02071753133433007,"gpt":0.2697594243535607,"spread":0.2490418930192306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008778391,0.000831251,0.0005406183,0.0004513485,0.0006171565,0.0008699802,0.001130346,0.001017947,0.004667135],"category_scores_gemma":[0.003438818,0.0003324407,0.0004072244,0.000310308,0.00117391,0.001680587,0.001327972,0.001249543,0.0008491627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005149478,"about_ca_system_score_gemma":0.001035566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001645709,"about_ca_topic_score_gemma":0.001126037,"domain_scores_codex":[0.9992703,0.0001934021,0.00002775725,0.0001649823,0.0002599668,0.00008368617],"domain_scores_gemma":[0.9980478,0.001034469,0.0002217245,0.000213556,0.0004022447,0.00008008654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000712201,0.0001531159,0.0006610936,0.000239457,0.00005070581,0.0002772742,0.0003590648,0.6200857,0.01620899,0.1235756,0.006538488,0.2311383],"study_design_scores_gemma":[0.00002454011,0.0001037028,0.0002010621,0.00001383364,0.00001072532,0.00008596077,0.00006100451,0.9017329,0.003589147,0.09112612,0.003038185,0.00001286329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01384629,0.0002249231,0.9816781,0.0002091755,0.00007707776,0.0000274899,0.00003019935,0.00041068,0.003496054],"genre_scores_gemma":[0.8442355,0.0003275573,0.1453228,0.0001332083,0.00008814109,0.0001492212,0.0001976114,0.0001768184,0.00936911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004667135,"threshold_uncertainty_score":0.01561314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4297493126","doi":"10.1145/3564696","title":"Multiple Mobile Robot Task and Motion Planning: A Survey","year":2022,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Mobile robot; Robot; Motion planning; Task (project management); Robotics; Artificial intelligence; Human–computer interaction; Field (mathematics); Motion (physics); Systems engineering; Engineering","authors":[{"name":"Luke Antonyshyn","is_ca":true},{"name":"Jefferson Silveira","is_ca":true},{"name":"Sidney Givigi","is_ca":true},{"name":"Joshua A. Marshall","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1334261220052098,"gpt":0.3533795191759313,"spread":0.2199533971707215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000649775,0.00105194,0.0009748859,0.002248004,0.0004812807,0.00151302,0.00197387,0.001345217,0.004962617],"category_scores_gemma":[0.001712259,0.0006906178,0.0006295467,0.005951185,0.0005919681,0.002764844,0.0009992984,0.001306568,0.002962098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008545577,"about_ca_system_score_gemma":0.002208652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003864862,"about_ca_topic_score_gemma":0.003786537,"domain_scores_codex":[0.9995018,0.00007601524,0.00003857025,0.0001009799,0.0002401746,0.00004236849],"domain_scores_gemma":[0.9992016,0.0004100359,0.00005811678,0.00004922514,0.0002369789,0.0000439744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002806604,0.00008961889,0.0004475469,0.006056434,0.00004116429,0.00007267352,0.00008796357,0.007813819,0.0004418554,0.02513494,0.02945598,0.9303299],"study_design_scores_gemma":[0.00001694556,0.0001517512,0.001374715,0.003005895,0.00007398143,0.000732646,0.0002191433,0.01273786,0.0006891709,0.03294773,0.9479993,0.00005081974],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.001060918,0.9391302,0.04010673,0.001036399,0.0005338669,0.00007191351,0.0001093769,0.0001851636,0.01776546],"genre_scores_gemma":[0.01072875,0.9578209,0.02536001,0.000346061,0.0007123793,0.0001068647,0.0003542479,0.00005393561,0.004516841],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004962617,"threshold_uncertainty_score":0.01660162,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102145388","doi":"10.1109/tnn.2006.875994","title":"A Neural Network Approach to Dynamic Task Assignment of Multirobots","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Artificial neural network; Task (project management); Artificial intelligence; Time delay neural network","authors":[{"name":"Anmin Zhu","is_ca":true},{"name":"Simon X. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01337852726867475,"gpt":0.2310593419251475,"spread":0.2176808146564728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003020669,0.0005486329,0.0004568976,0.0004425704,0.0003402425,0.0005462981,0.0009894948,0.0009543893,0.001775475],"category_scores_gemma":[0.0008084167,0.0002981983,0.0003824837,0.0005592576,0.0004908256,0.001035794,0.0005646642,0.001109871,0.0002606336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007165171,"about_ca_system_score_gemma":0.0005999177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004818385,"about_ca_topic_score_gemma":0.004377691,"domain_scores_codex":[0.9998041,0.0000502453,0.000009729486,0.00004871753,0.00006059261,0.00002669944],"domain_scores_gemma":[0.9998343,0.00007360274,0.00002054168,0.00001110866,0.00004825669,0.00001218481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002653092,0.00002649189,0.0001753586,0.00006415554,0.00002838075,0.00005875487,0.00003615522,0.9351204,0.002135281,0.01839215,0.0005549661,0.04338131],"study_design_scores_gemma":[0.000002499378,0.00001030563,0.00004000485,0.000003419341,0.000003308477,0.000009616191,0.000004466553,0.9933189,0.0003000166,0.005698283,0.0006055251,0.000003680658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005365224,0.0006676492,0.9906124,0.0001950424,0.00006758018,0.00001648181,0.00002151013,0.0001152923,0.002938905],"genre_scores_gemma":[0.6397958,0.00178172,0.3455501,0.0002277539,0.0002786856,0.0002725002,0.0001237646,0.00007726785,0.01189238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004818385,"threshold_uncertainty_score":0.009580672,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1526676349","doi":"10.1007/978-3-540-39899-8_5","title":"Needle Steering and Model-Based Trajectory Planning","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Jacobian matrix and determinant; Computer science; Deflection (physics); Obstacle avoidance; Motion planning; Trajectory; Simulation; Robot; Artificial intelligence; Mobile robot; Physics; Mathematics; Optics; Applied mathematics","authors":[{"name":"Simon DiMaio","is_ca":true},{"name":"Septimiu E. Salcudean","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02569298469996744,"gpt":0.2467110390139329,"spread":0.2210180543139654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002827139,0.0009516625,0.0009366768,0.0005540887,0.0003657786,0.001031569,0.001200754,0.001132789,0.005569486],"category_scores_gemma":[0.00108629,0.0009215127,0.0008862237,0.001221728,0.000670874,0.001402463,0.001054863,0.001011816,0.001749376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006326851,"about_ca_system_score_gemma":0.0006525005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004827531,"about_ca_topic_score_gemma":0.003624271,"domain_scores_codex":[0.9997017,0.00004568502,0.00001244906,0.00006695938,0.0001555331,0.00001773404],"domain_scores_gemma":[0.9998022,0.00008157516,0.0000177783,0.00004570373,0.00004270531,0.0000101294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000723591,0.00002886184,0.0001919412,0.0001946042,0.00003496012,0.00005920835,0.00006620259,0.6392018,0.006916228,0.06896103,0.005116809,0.279156],"study_design_scores_gemma":[0.000006340181,0.00002464933,0.0000762764,0.00001998447,0.000008331769,0.00005905194,0.000007387919,0.9457233,0.002351644,0.04225625,0.009452083,0.00001474275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001302875,0.0007176343,0.9928274,0.00005968492,0.0000686721,0.00001791524,0.00004464724,0.0004812408,0.004479953],"genre_scores_gemma":[0.1942518,0.003476137,0.7769707,0.0001011868,0.0001103715,0.0002043741,0.0004938714,0.0004043535,0.02398719],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005569486,"threshold_uncertainty_score":0.01863182,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}