{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003933163,0.0001802722,0.0003216089,0.0001246695,0.0002048884,0.00008303079,0.0002644826,0.0001930488,0.00000549807],"category_scores_gemma":[0.00002065976,0.000177826,0.00006427177,0.0003000856,0.00004921248,0.0007648023,0.0000056628,0.000218523,0.00001044082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004853997,"about_ca_system_score_gemma":0.00006807509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001471381,"about_ca_topic_score_gemma":3.636957e-8,"domain_scores_codex":[0.9983948,0.0000532497,0.0007572536,0.0001185448,0.0002859343,0.00039021],"domain_scores_gemma":[0.9987785,0.0003214451,0.0003252719,0.0003052375,0.0000863433,0.0001832196],"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.00002015983,0.0001411391,0.0001552185,0.00001842973,0.00003468744,2.729054e-7,0.004343413,0.9487202,0.00002243105,0.00004039435,0.0002982739,0.04620545],"study_design_scores_gemma":[0.001135731,0.0003268579,0.00006817202,0.0000644871,0.00004519775,0.000008429912,0.000337903,0.9930986,0.004631695,0.00001543573,0.00007778509,0.0001897018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01231579,0.00002307994,0.98613,0.00004106862,0.0008131798,0.0004497816,0.00003394753,0.0001193501,0.00007382507],"genre_scores_gemma":[0.1320922,0.00001308591,0.8676525,0.00003104377,0.0001064408,0.00004788945,0.000007315842,0.00001316909,0.00003629596],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1197765,"threshold_uncertainty_score":0.7251533,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002770109,0.0001351685,0.0002611135,0.0003539599,0.00008323038,0.00004865111,0.0005391008,0.00006664175,0.00001158643],"category_scores_gemma":[0.00001445535,0.0001312658,0.00009576637,0.000526845,0.00004403073,0.0003998791,0.000001429167,0.0001404529,0.00008513692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001063361,"about_ca_system_score_gemma":0.00011382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007307859,"about_ca_topic_score_gemma":0.00001559419,"domain_scores_codex":[0.9986934,0.00006053808,0.0004642911,0.000195627,0.0003310608,0.0002550551],"domain_scores_gemma":[0.9990771,0.0002310213,0.000120364,0.0004610427,0.0000399876,0.00007045694],"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.000008903337,0.0006741046,0.00003398216,0.00007197534,0.00007022699,0.00002588687,0.002666913,0.8975125,0.00603464,0.002491022,0.00002172406,0.09038811],"study_design_scores_gemma":[0.003302717,0.0001656317,0.004100817,0.000201216,0.0000232139,0.00003270702,0.00005309568,0.9802883,0.009031806,0.002597811,0.00001336532,0.0001893143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02735239,0.00001917939,0.9702256,0.001218186,0.0003864679,0.0003220428,0.000009897282,0.0002457305,0.0002204705],"genre_scores_gemma":[0.9445278,0.0000025729,0.05521159,0.0001332912,0.000005334744,0.00007074891,3.610217e-7,0.000007800276,0.00004047693],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9171754,"threshold_uncertainty_score":0.5352864,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001721897,0.0003154715,0.0004874979,0.0002427005,0.0001323717,0.00005545312,0.00200013,0.0004329868,6.065979e-7],"category_scores_gemma":[0.00001805782,0.0003815792,0.0001817773,0.0000308448,0.0002846114,0.000142068,0.001015863,0.0007047808,0.00001091391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001626859,"about_ca_system_score_gemma":0.0008351763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002715548,"about_ca_topic_score_gemma":2.16122e-7,"domain_scores_codex":[0.9982617,0.00006767242,0.0003010773,0.00056399,0.0005121898,0.0002934019],"domain_scores_gemma":[0.9978768,0.0002335244,0.0004803231,0.0009002693,0.0003416596,0.000167461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007075949,0.00003178526,0.000004514181,0.0001211729,0.00009545461,0.0002244223,0.0001264325,0.06431997,0.00001756866,0.9137838,0.02014629,0.001121453],"study_design_scores_gemma":[0.0006349478,0.0001303694,0.00008114892,0.000256993,0.000106685,0.00006644194,0.00001035697,0.2240831,0.0002148361,0.00005002978,0.7736922,0.0006729007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001635262,0.00004268575,0.3517626,0.000006542484,0.0004428981,0.0002742032,0.0001005805,0.0001596814,0.6471944],"genre_scores_gemma":[0.00005091084,0.00000531997,0.1796182,0.00001842169,0.00008073745,8.458921e-7,0.00006364218,0.00002103186,0.8201408],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9137338,"threshold_uncertainty_score":0.9998636,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000475461,0.0005950507,0.0006565978,0.000238729,0.0004962022,0.0006512867,0.0009340074,0.0002347863,0.000003982633],"category_scores_gemma":[0.000007356063,0.0006028394,0.0001524503,0.0006850662,0.0001247568,0.0002213924,0.00002845781,0.0006153176,0.0001668162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001502662,"about_ca_system_score_gemma":0.0000806202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002557013,"about_ca_topic_score_gemma":0.000006394319,"domain_scores_codex":[0.9960331,0.0002218817,0.0007707771,0.001145869,0.0007928578,0.001035543],"domain_scores_gemma":[0.997756,0.000177445,0.0002144426,0.001092537,0.0001154083,0.0006441835],"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.00002102977,0.0002123114,0.00007668216,0.00005554279,0.00007460015,0.00007221128,0.001928248,0.9894128,0.00006454931,0.004480017,0.001182271,0.002419728],"study_design_scores_gemma":[0.002967575,0.001242722,0.001780533,0.000905771,0.0001303101,0.0008477668,0.0002891131,0.9702678,0.0002432666,0.001002184,0.01848401,0.001838987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01406699,0.000442662,0.9760297,0.00022752,0.002483879,0.0008819317,0.00004677467,0.0004270765,0.005393456],"genre_scores_gemma":[0.9525336,0.00004918067,0.0448218,0.0006432889,0.0003655759,0.0001496325,0.00001003642,0.00007246256,0.00135442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9384666,"threshold_uncertainty_score":0.9996423,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003894864,0.0007160809,0.001268387,0.001441939,0.0002439887,0.00051316,0.005337812,0.0005279513,0.00002585923],"category_scores_gemma":[0.001838796,0.0005007166,0.000440552,0.002229065,0.000317961,0.0002201287,0.003018928,0.00146605,0.00003727909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002001331,"about_ca_system_score_gemma":0.002008501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007949866,"about_ca_topic_score_gemma":0.000005590417,"domain_scores_codex":[0.9938779,0.0003551109,0.001548562,0.0011497,0.001973556,0.001095151],"domain_scores_gemma":[0.9914746,0.003689488,0.0006439844,0.002627423,0.001122055,0.0004424523],"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.0001110119,0.0001067781,0.002067785,0.0001651017,0.0001827626,0.00004381388,0.0008232704,0.9854096,0.00005680954,0.0007944627,0.004314506,0.005924162],"study_design_scores_gemma":[0.002580882,0.0002526033,0.00843444,0.0002842545,0.00007025959,0.000052484,0.00005982564,0.9837934,0.0005558972,0.003126159,0.0001206223,0.0006691614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01155622,0.0003492524,0.982269,0.0006419652,0.000914539,0.001070583,0.00004388274,0.000434482,0.002720052],"genre_scores_gemma":[0.2837963,0.0000123144,0.715301,0.0003134506,0.0001532721,0.0001113873,0.0001053583,0.00005140928,0.0001555379],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.27224,"threshold_uncertainty_score":0.9997445,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002630401,0.0001774059,0.0002760052,0.0001569853,0.0000851045,0.00004883603,0.0007526845,0.00007851514,0.000004940526],"category_scores_gemma":[0.00003313599,0.0001610353,0.0001103112,0.000386316,0.00004384364,0.0001415315,0.0001121995,0.00008498509,0.00002211076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000598783,"about_ca_system_score_gemma":0.0003026249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003042715,"about_ca_topic_score_gemma":3.061811e-7,"domain_scores_codex":[0.9986089,0.00003093441,0.0003451133,0.0004253793,0.0002061956,0.0003834461],"domain_scores_gemma":[0.9989017,0.0001863213,0.000120136,0.0005313577,0.0001403661,0.0001200666],"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.000005081493,0.0004395459,0.000204192,0.00008113441,0.00003712977,0.000051455,0.002074247,0.7211581,0.001062155,0.001395278,0.0005348415,0.2729568],"study_design_scores_gemma":[0.001300201,0.0004808553,0.0009510857,0.0001116539,0.000009707706,0.00001969476,0.00004121278,0.9899076,0.005652114,0.0009572284,0.00034647,0.0002221646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008690636,0.0004305314,0.9970713,0.00004953966,0.0003224324,0.0004485955,0.000007890839,0.0002180638,0.000582604],"genre_scores_gemma":[0.03990594,0.000001014226,0.9596307,0.00009234747,0.00006598788,0.0001424791,0.000004491162,0.0000160463,0.0001409886],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2727347,"threshold_uncertainty_score":0.6566828,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001081765,0.0003539103,0.0004022031,0.0002008082,0.0002440622,0.0009493278,0.003695951,0.0003263706,0.00001668015],"category_scores_gemma":[0.0004335906,0.0003080135,0.0002086521,0.0003018849,0.0001291891,0.0002998063,0.006050449,0.00119993,0.000005645536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003476575,"about_ca_system_score_gemma":0.0002708383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001681122,"about_ca_topic_score_gemma":5.602631e-7,"domain_scores_codex":[0.9963878,0.00005128188,0.0005665958,0.000955048,0.001663336,0.0003759062],"domain_scores_gemma":[0.9977111,0.0002362502,0.0004344799,0.0004254239,0.001038351,0.0001544023],"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.0001496297,0.002816711,0.01929136,0.0008169729,0.001146934,0.00007016418,0.006998152,0.003026274,0.06127611,0.8973351,0.005068517,0.002004043],"study_design_scores_gemma":[0.009739325,0.001129503,0.07735433,0.009245012,0.0003151605,0.0004524016,0.001092051,0.641916,0.1398222,0.1129097,0.002235597,0.003788735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8563405,0.0005404134,0.01040001,0.02876768,0.07544325,0.002596935,0.0002263705,0.0004026548,0.02528219],"genre_scores_gemma":[0.9532281,0.0002642351,0.04550761,0.0001658842,0.0005298405,0.00008412103,0.0000419578,0.00003368742,0.0001445291],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7844254,"threshold_uncertainty_score":0.9999372,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003444671,0.0003060624,0.0003387376,0.0001639865,0.0006318316,0.0001350856,0.0003951098,0.0001591873,0.000002533942],"category_scores_gemma":[0.000004017776,0.0002927594,0.0001064394,0.0003474792,0.00009208085,0.0002444035,0.000004456314,0.0002744043,0.00002378616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002193633,"about_ca_system_score_gemma":0.0001901103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003951663,"about_ca_topic_score_gemma":0.00002575263,"domain_scores_codex":[0.9976906,0.00009877678,0.0003277047,0.0006857283,0.0002999204,0.0008973315],"domain_scores_gemma":[0.9989526,0.0001364179,0.00008811013,0.0005422686,0.0001134856,0.0001670735],"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.0001949594,0.0007314164,0.0001796863,0.0005169045,0.001047619,0.00009762454,0.01095435,0.6495322,0.02643889,0.0009501989,0.00339649,0.3059596],"study_design_scores_gemma":[0.0006925857,0.0008387378,0.00005854644,0.0001535583,0.00004539876,0.0002728771,0.0001975293,0.994513,0.002039424,0.00005173294,0.0007677896,0.0003688322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01907604,0.001460219,0.9766717,0.0001253691,0.001870217,0.0005527185,0.00002890682,0.0001884851,0.00002634854],"genre_scores_gemma":[0.8062227,0.0001316307,0.1918508,0.0001564371,0.0005981869,0.0001466397,0.000003258774,0.00005963636,0.0008306802],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7871467,"threshold_uncertainty_score":0.9999524,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004263968,0.0002258819,0.0002885326,0.0004586432,0.000111515,0.0001251107,0.0003504198,0.0001576539,0.00000905598],"category_scores_gemma":[0.000003164626,0.0002448812,0.0001331754,0.0004663711,0.00001931035,0.0005626335,2.766555e-7,0.0002155694,0.0001196262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001822947,"about_ca_system_score_gemma":0.00006743699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001004446,"about_ca_topic_score_gemma":0.00001409638,"domain_scores_codex":[0.9979501,0.00007872011,0.0007227203,0.0005528154,0.0003678157,0.000327876],"domain_scores_gemma":[0.998982,0.0002471613,0.0001802471,0.0003715931,0.0001293211,0.0000896522],"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.00002194917,0.0001107591,0.001592162,0.0001102807,0.00002591646,0.000006534168,0.002729189,0.984279,0.001127113,0.00138345,0.00002110523,0.008592507],"study_design_scores_gemma":[0.0008125144,0.0002436596,0.007566142,0.0004151413,0.00001990123,0.000009016529,0.0006113071,0.967603,0.02178111,0.0002011864,0.0003541771,0.0003829062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09356667,0.00004914135,0.9020932,0.00009165144,0.002686514,0.00112741,0.000041086,0.0002645764,0.00007979426],"genre_scores_gemma":[0.9855765,0.000007092156,0.01356269,0.00004967477,0.0000390563,0.0003072362,0.0000372478,0.00002558193,0.0003948879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8920099,"threshold_uncertainty_score":0.9985965,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001201398,0.0001839236,0.0002072573,0.00006429468,0.0001786619,0.0001454655,0.0001847227,0.0000659561,1.643762e-7],"category_scores_gemma":[0.00003873947,0.0001679468,0.0000378987,0.0001330412,0.00003809601,0.0004560123,0.00001653242,0.0001229963,0.000001055855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004970709,"about_ca_system_score_gemma":0.0000401708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000175923,"about_ca_topic_score_gemma":3.928038e-7,"domain_scores_codex":[0.9988359,0.00004935416,0.0002626168,0.000400952,0.0002209198,0.0002303],"domain_scores_gemma":[0.9993843,0.00006501725,0.0001760873,0.0001515231,0.00009717599,0.0001258249],"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.00001158478,0.00004177366,0.0001576371,0.0000226194,0.00003340725,0.000006134331,0.0008124713,0.9848061,0.0130651,0.0001130971,0.0003444024,0.0005857313],"study_design_scores_gemma":[0.001614389,0.0001471588,0.002526382,0.00003367863,0.00003606349,0.000009304936,0.00001952151,0.9949484,0.0004530547,0.00001054081,0.000002579887,0.0001989525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01024153,0.0000220105,0.9819596,0.00671391,0.0001811176,0.0004535869,0.0001089051,0.0003184331,9.428289e-7],"genre_scores_gemma":[0.4691918,9.211637e-7,0.5288079,0.001688426,0.0001420329,0.00002208579,0.000133139,0.0000118098,0.000001868371],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4589503,"threshold_uncertainty_score":0.684867,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007874859,0.0001402813,0.0002353598,0.0002676801,0.0001141179,0.00011757,0.0008919011,0.00009309619,0.000002727845],"category_scores_gemma":[0.0001477019,0.000151081,0.00009358987,0.000146656,0.00006067485,0.0006328681,0.0002651654,0.0004777609,0.000006852266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009129055,"about_ca_system_score_gemma":0.0003433561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002654378,"about_ca_topic_score_gemma":8.162862e-7,"domain_scores_codex":[0.9977407,0.0001347879,0.0005953645,0.0001498397,0.001137288,0.0002420151],"domain_scores_gemma":[0.99879,0.00005391702,0.0007262499,0.00007037348,0.0002367491,0.0001227437],"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.0000214157,0.00005558342,0.003677062,0.000001066264,0.00007822533,0.0004540255,0.007287051,0.9828411,0.0004828217,0.004562823,0.0001923251,0.0003464955],"study_design_scores_gemma":[0.002244385,0.0003094188,0.004601829,0.0001824626,0.00002371385,0.0001187403,0.001656707,0.9852243,0.0001290077,0.004760636,0.0004423218,0.0003064484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0203176,0.00002592763,0.9769975,0.0006189733,0.001260232,0.00005856726,5.783306e-7,0.00001369579,0.0007069115],"genre_scores_gemma":[0.8369039,0.000003263187,0.1622132,0.0001813386,0.0005551174,6.190551e-7,0.000002806623,0.00001279812,0.0001268833],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8165864,"threshold_uncertainty_score":0.6160903,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002914425,0.0001250436,0.0002550703,0.0001142435,0.0001587159,0.0001193055,0.0002675593,0.00007371125,1.426974e-7],"category_scores_gemma":[0.00002125992,0.0001194476,0.0000488327,0.0001484558,0.00002776945,0.0002966134,0.00006805178,0.00006350535,0.000003469893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006070493,"about_ca_system_score_gemma":0.00007706691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004432273,"about_ca_topic_score_gemma":3.188269e-7,"domain_scores_codex":[0.9989721,0.00001915594,0.0003993619,0.00022629,0.0001414222,0.000241667],"domain_scores_gemma":[0.9992334,0.00007961056,0.0002212323,0.0002905164,0.00009765023,0.0000775833],"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":[6.915092e-7,0.00003018389,0.000102036,0.00009155434,0.00001309216,0.000001970745,0.000907337,0.9449226,0.0001911286,0.05260517,0.00001531684,0.001118949],"study_design_scores_gemma":[0.0005542592,0.0001933308,0.0004659391,0.0001755596,0.00001308041,0.00006325042,0.0001761134,0.9962087,0.0003754788,0.001422888,0.0001824701,0.0001689559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002628268,0.0005688114,0.9952767,0.0001069493,0.0005336591,0.0004957957,0.000009748455,0.0001117037,0.0002683958],"genre_scores_gemma":[0.7265,0.000004332648,0.2732939,0.00001317619,0.00004879993,0.00005862186,0.000009460574,0.000009365475,0.00006229265],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7238718,"threshold_uncertainty_score":0.4870932,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004320728,0.0001178232,0.0001910911,0.0002791613,0.0001687695,0.0002268212,0.003323717,0.00004859812,0.00001163285],"category_scores_gemma":[0.0004810576,0.00007109725,0.00007538258,0.0002621922,0.0003437358,0.0003031528,0.0002924378,0.0005432904,0.000009998062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001043706,"about_ca_system_score_gemma":0.0004371572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001611603,"about_ca_topic_score_gemma":5.479635e-7,"domain_scores_codex":[0.9972879,0.0001996927,0.0003935344,0.0001942921,0.001541822,0.0003827697],"domain_scores_gemma":[0.9961303,0.0009409898,0.0003135694,0.0002983107,0.00219485,0.0001219941],"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.001367832,0.0006829883,0.04047302,0.00004140087,0.00120349,0.003742157,0.01224356,0.7811383,0.0009776205,0.1233886,0.01616855,0.01857244],"study_design_scores_gemma":[0.004931234,0.004511648,0.02949622,0.000873327,0.00002810284,0.00764396,0.002218018,0.9128012,0.002761351,0.03201491,0.001939208,0.0007807828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006139626,0.0001179651,0.9889289,0.002881418,0.0006554312,0.0001689154,0.000005789417,0.0000198427,0.00108214],"genre_scores_gemma":[0.4720201,0.00001089981,0.5275713,0.00007937354,0.000195828,0.000004067541,0.000001347375,0.000009293632,0.0001078795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4658805,"threshold_uncertainty_score":0.6176348,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005834601,0.0002162431,0.0003486715,0.0001306129,0.0002255686,0.00008465778,0.0006850011,0.00008691321,0.000004876048],"category_scores_gemma":[0.0001253999,0.0001946401,0.00007732079,0.0003193998,0.0002317283,0.0001543379,0.0001794743,0.0001642984,0.00002498219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000704037,"about_ca_system_score_gemma":0.00005600406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004061158,"about_ca_topic_score_gemma":5.212825e-7,"domain_scores_codex":[0.9981334,0.00005208508,0.0006009444,0.0004387715,0.0004011738,0.0003736209],"domain_scores_gemma":[0.9986404,0.0001290436,0.0002479009,0.0005968599,0.0002051246,0.000180735],"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.00001981157,0.006588036,0.0001066934,0.000378678,0.0001042426,0.0001952218,0.02697745,0.5434901,0.007243304,0.1987854,0.0001453632,0.2159657],"study_design_scores_gemma":[0.0000293112,0.0001751718,0.0001189773,0.00004546029,0.000004769035,0.0001004869,0.0002716117,0.9767042,0.01603521,0.006290235,0.00000876352,0.0002157754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08697973,0.0001658304,0.9121322,0.0001305029,0.0001251523,0.0001980478,0.000005793604,0.0000803721,0.0001823835],"genre_scores_gemma":[0.4227352,0.00007108655,0.5770406,0.0000624997,0.00004078527,0.00000755535,0.000001938452,0.00001084656,0.00002956157],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4332141,"threshold_uncertainty_score":0.7937194,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003220744,0.0001279476,0.0002136189,0.0003844936,0.0001106115,0.0005022425,0.002080299,0.00005924864,0.00001247743],"category_scores_gemma":[0.0003629168,0.00007857131,0.00003498737,0.0003321604,0.0004416513,0.0005899926,0.0004812872,0.0009103118,0.000009309619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001427336,"about_ca_system_score_gemma":0.0002964124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001232669,"about_ca_topic_score_gemma":0.000003594471,"domain_scores_codex":[0.9971762,0.0003426554,0.0004455585,0.0002150507,0.001448213,0.0003723264],"domain_scores_gemma":[0.9973763,0.0007085739,0.0002346563,0.0002513545,0.001287121,0.0001420465],"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.0000388713,0.0001466148,0.03250615,0.000008299615,0.00007643117,0.0008801488,0.0009296862,0.9577218,0.0002391807,0.00253611,0.0002778707,0.004638866],"study_design_scores_gemma":[0.001124783,0.0002273003,0.06720333,0.0003005857,0.000003364239,0.001440241,0.0005585964,0.9273592,0.00007477441,0.001564895,0.0000103657,0.0001326223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0622279,0.0001736563,0.9292221,0.007715986,0.0002788802,0.0001928733,0.000001264135,0.00001320234,0.0001741574],"genre_scores_gemma":[0.5899574,0.00001575892,0.4098448,0.00005980715,0.00005989909,0.000003638065,6.596859e-7,0.000006293617,0.00005178066],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5277295,"threshold_uncertainty_score":0.4843137,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007030937,0.0003240112,0.0003904226,0.0001916663,0.0004783722,0.0001922511,0.0003683324,0.000192235,0.000002973291],"category_scores_gemma":[0.000009823453,0.0003168367,0.0001302588,0.0003221121,0.00005218754,0.0003848528,0.000002294758,0.0003515035,0.00002198498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002245707,"about_ca_system_score_gemma":0.0002105438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008992162,"about_ca_topic_score_gemma":0.000004643105,"domain_scores_codex":[0.9975436,0.0001322887,0.0003320973,0.0005130338,0.0003179567,0.001161032],"domain_scores_gemma":[0.9986888,0.0003429413,0.0001501607,0.0004985144,0.00005981782,0.0002597256],"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.001316466,0.001447585,0.002201699,0.0008062585,0.0007647966,0.00003334998,0.01082021,0.9094492,0.0522646,0.005510884,0.003818716,0.0115662],"study_design_scores_gemma":[0.00422258,0.001672525,0.0005562494,0.0003566868,0.0001044333,0.000140386,0.0003788884,0.9647983,0.0221209,0.00003585873,0.004583676,0.001029511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07471201,0.001055553,0.9204257,0.0001876454,0.002396665,0.0008187982,0.00001409281,0.0003390642,0.00005050797],"genre_scores_gemma":[0.9927939,0.000007827954,0.005789263,0.0001154063,0.0003403837,0.0004930368,0.000003398379,0.00004101204,0.0004157508],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9180819,"threshold_uncertainty_score":0.9999284,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.003204623,0.0001927305,0.0003114592,0.0004721135,0.0002245801,0.0009015346,0.007379165,0.0001080726,0.00005538311],"category_scores_gemma":[0.003529023,0.0001325972,0.0001813167,0.0008924152,0.0003269672,0.0010253,0.001586837,0.001649871,0.0002716206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003474655,"about_ca_system_score_gemma":0.002372894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002341535,"about_ca_topic_score_gemma":0.000003296774,"domain_scores_codex":[0.9931292,0.0003149721,0.0008719677,0.0002495531,0.004753298,0.0006809961],"domain_scores_gemma":[0.9932074,0.002544533,0.0002622014,0.0004317429,0.003059695,0.0004944039],"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.000386969,0.0001889769,0.001212838,0.00002998723,0.000557891,0.0008970554,0.00956296,0.9169806,0.001566622,0.02342556,0.02361042,0.02158018],"study_design_scores_gemma":[0.00147731,0.001017729,0.003694038,0.0001644344,0.00001355619,0.0007096446,0.0006461684,0.9852015,0.001985724,0.001087693,0.003751366,0.0002508407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01847269,0.0001640404,0.8207474,0.1545146,0.001213927,0.0003349486,0.000008918122,0.00008047342,0.004463035],"genre_scores_gemma":[0.5510128,0.0002455458,0.4446151,0.001887718,0.001564375,0.000005333034,0.00000682979,0.00003513086,0.0006272494],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.53254,"threshold_uncertainty_score":0.9979914,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005526612,0.0005208188,0.0005212546,0.0002748364,0.0004705784,0.0005697492,0.001015694,0.0002661236,0.00001041225],"category_scores_gemma":[0.00001171746,0.0005272184,0.000138087,0.0007612468,0.0001130346,0.0002440751,0.00002607679,0.0004409657,0.0001347983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001486634,"about_ca_system_score_gemma":0.00006933779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001120022,"about_ca_topic_score_gemma":0.0001445069,"domain_scores_codex":[0.9962821,0.0003225692,0.0007501896,0.001077284,0.0007522911,0.0008155421],"domain_scores_gemma":[0.9975559,0.0001977347,0.0001881946,0.001440192,0.0001019314,0.0005161146],"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.00002287154,0.0001788219,0.00007527992,0.00002899363,0.00007069889,0.00005493996,0.0009555503,0.9811056,0.0001786832,0.001262514,0.004051809,0.01201419],"study_design_scores_gemma":[0.0007522827,0.0004621349,0.0007044647,0.0001305253,0.00006064764,0.0002609722,0.00009719416,0.990911,0.0002424259,0.0001345983,0.005586468,0.0006572649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06627691,0.0006692034,0.9255345,0.0007544,0.004015843,0.0009474541,0.00003043208,0.0003651418,0.001406119],"genre_scores_gemma":[0.9681798,0.0002144203,0.02441395,0.0003331302,0.0005217184,0.0002041668,0.00001171208,0.00007202756,0.006049108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9019029,"threshold_uncertainty_score":0.999718,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002260022,0.0001984695,0.0002068751,0.0001213869,0.0001636409,0.0001496989,0.0008108664,0.00008218632,0.000007099959],"category_scores_gemma":[0.0000320949,0.0001806904,0.00009625052,0.0003019643,0.00003024019,0.0002067954,0.0001001744,0.0001068602,0.00005684115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008053441,"about_ca_system_score_gemma":0.0002054087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003780058,"about_ca_topic_score_gemma":1.793864e-7,"domain_scores_codex":[0.9983924,0.00002497226,0.0002619655,0.0005320986,0.0002847741,0.0005037923],"domain_scores_gemma":[0.9989532,0.0001402327,0.00007934631,0.0005851148,0.00008206787,0.0001600793],"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.000002556679,0.00009851729,0.0001427943,0.00001528629,0.0000137147,0.00009590453,0.0004098726,0.9234325,0.0002293267,0.0007646816,0.0006189416,0.07417587],"study_design_scores_gemma":[0.001183474,0.0003513492,0.001515583,0.00005208787,0.000007179553,0.00003978786,0.00003011925,0.9921388,0.001431772,0.002027771,0.0009266945,0.0002953563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005996684,0.0001679193,0.9972253,0.0002144457,0.0004532511,0.0004947379,0.000006188836,0.0004928731,0.0003455948],"genre_scores_gemma":[0.01736749,8.415626e-7,0.9814637,0.0006398932,0.0001229311,0.000219444,0.000006134002,0.00001961158,0.0001599511],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07388052,"threshold_uncertainty_score":0.7368342,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004248127,0.0001575814,0.0001395402,0.0001266013,0.0002899143,0.0001093091,0.0001181251,0.00005345718,0.000007716169],"category_scores_gemma":[0.000008708244,0.0001591918,0.00007136843,0.0001663692,0.00002861785,0.0002350436,4.712728e-7,0.0001022112,0.000008836267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001376371,"about_ca_system_score_gemma":0.00008747196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001233532,"about_ca_topic_score_gemma":0.00000221517,"domain_scores_codex":[0.9986088,0.00009920955,0.0002692047,0.0003468724,0.0004694911,0.000206367],"domain_scores_gemma":[0.999375,0.00006341436,0.0000929145,0.0001939882,0.0001664068,0.0001082641],"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.0001815662,0.001514411,0.0002858934,0.00009361815,0.0001239803,0.000007840886,0.001162235,0.3208687,0.06119078,0.002840325,0.0002212187,0.6115094],"study_design_scores_gemma":[0.02012326,0.00381626,0.002531206,0.0002376453,0.0003210054,0.00006890896,0.0004961536,0.504728,0.4626984,0.001017398,0.002751781,0.001209972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006707285,0.00001948136,0.9908745,0.000142494,0.0009520635,0.001079607,0.000009729857,0.0001134094,0.0001013994],"genre_scores_gemma":[0.8977438,0.000004026714,0.1008226,0.0003672685,0.00001015065,0.001007355,0.000003532969,0.00001132286,0.00002995018],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8910365,"threshold_uncertainty_score":0.6491655,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005247148,0.0002416998,0.0002826731,0.0003646781,0.0001711034,0.0001103085,0.0006188525,0.0001462814,0.000001289903],"category_scores_gemma":[0.00003629148,0.0002566927,0.0001570066,0.0004831324,0.00003744871,0.0003062442,0.000004998456,0.0003955641,0.000033234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003085438,"about_ca_system_score_gemma":0.0001460062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000328413,"about_ca_topic_score_gemma":0.000004172454,"domain_scores_codex":[0.9981073,0.00008296245,0.0003779718,0.0005267916,0.00036934,0.000535665],"domain_scores_gemma":[0.9987089,0.0002737487,0.00009909619,0.0005664562,0.0001159826,0.0002357966],"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.0000226132,0.0001467398,0.00002968473,0.00001559892,0.00002416018,0.00003808116,0.002178256,0.9911346,0.00008325739,0.0001800326,0.0002428623,0.005904078],"study_design_scores_gemma":[0.001246317,0.0003821584,0.0000389112,0.0001356977,0.00002333597,0.00005656232,0.0004467496,0.9962028,0.0008572059,0.0002175866,0.00007793367,0.0003147263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004494933,0.00007688478,0.9956579,0.0008706416,0.00204113,0.0003643312,0.000009261199,0.0002799326,0.0002503784],"genre_scores_gemma":[0.2567409,0.000004670013,0.7424527,0.0001728271,0.0000521638,0.00006379686,0.00000323462,0.00003023935,0.0004794332],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2562914,"threshold_uncertainty_score":0.9999886,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00113726,0.00009738332,0.0002018744,0.0002076283,0.0001150537,0.00005342886,0.0002795183,0.00004829129,3.990257e-7],"category_scores_gemma":[0.00005128361,0.0000884423,0.00003498987,0.0004346612,0.00007594393,0.0006450591,0.000005554686,0.0001764125,3.870777e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001330444,"about_ca_system_score_gemma":0.000202194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001950077,"about_ca_topic_score_gemma":0.00004691813,"domain_scores_codex":[0.9986016,0.00004071794,0.0004651815,0.0002091408,0.0004212869,0.0002620839],"domain_scores_gemma":[0.9990249,0.0001989181,0.000206376,0.0001261257,0.0003535356,0.00009011147],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0009505865,0.0005409654,0.1481806,0.00005557025,0.00003808425,0.0005422476,0.01691648,0.6897174,0.0004716368,0.0008200528,0.00006179068,0.1417046],"study_design_scores_gemma":[0.003770125,0.003400908,0.8521309,0.000206322,0.0000108498,0.00002035317,0.00201663,0.1347243,0.0002553134,0.003250894,0.00008085572,0.0001325745],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5184189,0.00006467424,0.4811147,0.00006375429,0.0001404208,0.0001761885,0.000003205669,0.00001162311,0.000006480818],"genre_scores_gemma":[0.7965456,0.000001390867,0.2033544,0.00002189438,0.00005997679,0.000007967018,0.000001939257,0.000004921654,0.000001915413],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7039503,"threshold_uncertainty_score":0.3606572,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00753239,0.0001438047,0.0002359902,0.0004866372,0.0002778259,0.0005422656,0.004652269,0.00007556584,0.000004648274],"category_scores_gemma":[0.001316625,0.0001014788,0.0001692383,0.0003444924,0.0001369434,0.0002881187,0.0003571018,0.000731776,0.00002119171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001892355,"about_ca_system_score_gemma":0.0004022403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000110497,"about_ca_topic_score_gemma":3.025962e-7,"domain_scores_codex":[0.9961327,0.0003271054,0.0005593359,0.0002374137,0.002263917,0.0004795781],"domain_scores_gemma":[0.9927089,0.003505819,0.0003446067,0.0004467394,0.002832456,0.0001614674],"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.00003503277,0.0001054491,0.0001386797,0.000007769549,0.000113069,0.00005331271,0.0003443515,0.7734774,0.0005282725,0.008637451,0.003749896,0.2128093],"study_design_scores_gemma":[0.0007634248,0.0003416356,0.0003424785,0.0001517729,0.000007766757,0.0001566178,0.00004416141,0.9825841,0.0007179552,0.0100268,0.004748578,0.0001147638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001320133,0.0001980627,0.9871013,0.01033115,0.001837685,0.0001539675,0.000004019277,0.00002804277,0.0002138322],"genre_scores_gemma":[0.03174125,0.00001254731,0.966417,0.0004220013,0.001206817,0.000008470171,0.000003905642,0.00002091756,0.0001670836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2126946,"threshold_uncertainty_score":0.8645151,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004029823,0.0006532076,0.0005980663,0.0002618969,0.0007059958,0.000377045,0.001215,0.0003265957,0.00001473142],"category_scores_gemma":[0.000007206678,0.0006321485,0.0003280252,0.00107667,0.00006336979,0.0006469357,0.000006044208,0.001217319,0.00003236917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001373855,"about_ca_system_score_gemma":0.00007705511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003051446,"about_ca_topic_score_gemma":9.105311e-7,"domain_scores_codex":[0.9959434,0.0002477555,0.0006404527,0.001132796,0.0007247485,0.001310791],"domain_scores_gemma":[0.9975256,0.0004726682,0.0002209565,0.001276816,0.00008797539,0.000415998],"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.0001786162,0.0002060409,0.000003813285,0.000003359951,0.00001884072,0.0001504193,0.00008893709,0.9773858,0.0002819465,0.00005039714,0.000600797,0.02103109],"study_design_scores_gemma":[0.001040533,0.0007731057,0.0003585641,0.0001255845,0.00003782305,0.00003734185,0.000002646059,0.996742,0.00006593735,0.0001942039,0.0000020849,0.0006202549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007183038,0.00003063345,0.9879872,0.0009993955,0.001432657,0.0004983093,0.000006691454,0.001239077,0.0006229989],"genre_scores_gemma":[0.9255691,0.000009957764,0.07140836,0.002300011,0.0003400193,0.00005057987,0.00001313761,0.00005435775,0.0002545025],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.918386,"threshold_uncertainty_score":0.999613,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006610413,0.0001995865,0.0002881932,0.0001760494,0.0001810078,0.0001019466,0.0002453288,0.00008864426,8.754702e-7],"category_scores_gemma":[0.000001518996,0.000181368,0.00004433106,0.0004603931,0.00005462434,0.00008955817,0.000005039465,0.0001867269,0.00005116225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004670826,"about_ca_system_score_gemma":0.00001528638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002617755,"about_ca_topic_score_gemma":0.000002986795,"domain_scores_codex":[0.9983727,0.0001028412,0.0005247541,0.0005397464,0.0002001072,0.0002598214],"domain_scores_gemma":[0.9990414,0.00007637417,0.000119029,0.0005361789,0.00002019001,0.0002068731],"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.00002063782,0.001643089,0.0002636712,0.0006766677,0.0000408378,0.0000113183,0.001352463,0.3939812,0.002275752,0.007326975,0.0003994787,0.5920079],"study_design_scores_gemma":[0.001304413,0.0005116048,0.001970753,0.0008837086,0.00008225322,0.000132074,0.0001772795,0.3159897,0.001421244,0.0001039874,0.6763421,0.001080792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001308917,0.001663535,0.9941404,0.00005765559,0.0001695617,0.002035247,0.000006949829,0.00004704722,0.0005706586],"genre_scores_gemma":[0.9051428,0.002148526,0.08598121,0.0003943244,0.0001010949,0.004509718,0.00001997703,0.00003919825,0.001663185],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9081592,"threshold_uncertainty_score":0.7395973,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008468772,0.0001149719,0.0001314719,0.0001570414,0.00004557224,0.00007573736,0.0006184291,0.00006379931,0.000007652473],"category_scores_gemma":[0.00005232109,0.0001041088,0.00002900372,0.0003800312,0.00002060891,0.0003115312,0.0001673662,0.0001736667,0.00008396271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005244808,"about_ca_system_score_gemma":0.00003528275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007025978,"about_ca_topic_score_gemma":0.000001279527,"domain_scores_codex":[0.998717,0.00002520958,0.0002380337,0.0003207504,0.0002249152,0.0004740839],"domain_scores_gemma":[0.9993261,0.0001491967,0.00004398165,0.0003512352,0.00001985639,0.0001096401],"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.00002662541,0.0004383954,0.225066,0.00002635866,0.00003199581,0.004721434,0.01068283,0.1855223,0.0008224268,0.05509682,0.008316246,0.5092486],"study_design_scores_gemma":[0.000401055,0.00008550285,0.1861292,0.00003974005,0.000001218345,0.00004960904,0.000107526,0.8109168,0.0007778999,0.0002715511,0.0009454263,0.000274481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03629221,0.00007461353,0.9513901,0.0001405566,0.0003354627,0.00007634192,2.114953e-7,0.0002388925,0.0114516],"genre_scores_gemma":[0.4284415,7.082426e-7,0.5710291,0.0001831333,0.0000510899,0.000002637779,9.854336e-7,0.000005293064,0.0002855324],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6253945,"threshold_uncertainty_score":0.4245436,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003916864,0.000347868,0.0004398041,0.000301254,0.0003493159,0.0001111407,0.0008112577,0.0002137315,0.000008135309],"category_scores_gemma":[0.00001341671,0.0003498227,0.0002139562,0.001126739,0.00009969665,0.0004124523,0.000006914773,0.0005300656,0.00000303457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001756387,"about_ca_system_score_gemma":0.00007348698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007173444,"about_ca_topic_score_gemma":0.000001756137,"domain_scores_codex":[0.9973809,0.000356789,0.0005526882,0.0006581368,0.0004804567,0.0005710865],"domain_scores_gemma":[0.9980837,0.0003386956,0.0002587032,0.001025668,0.0001131954,0.0001800404],"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.00003247247,0.0002217385,0.0000343284,0.00001529442,0.00002158572,0.0000244136,0.0001131509,0.9950026,0.0004417237,0.00004095853,0.00002898273,0.004022796],"study_design_scores_gemma":[0.0007924455,0.0002812061,0.00008250222,0.00007063992,0.00003775885,0.00009133496,0.00002931472,0.9974017,0.0008721744,0.00003290154,0.000001316667,0.000306768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04272464,0.00003431952,0.9552565,0.00003220706,0.0009752982,0.0004729727,0.0000163584,0.0002997972,0.0001878831],"genre_scores_gemma":[0.7813134,0.000003116559,0.2184568,0.00005044926,0.00003699859,0.00004438951,0.000007686694,0.00003418326,0.00005294257],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7385888,"threshold_uncertainty_score":0.9998954,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003344986,0.0001467316,0.0002997663,0.0000836992,0.0003365902,0.0002232361,0.001109977,0.00009997297,0.00000124757],"category_scores_gemma":[0.0003086083,0.0001265892,0.0001251115,0.00002746467,0.00003942782,0.0009973672,0.0002120358,0.0003910321,0.000002506808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006132545,"about_ca_system_score_gemma":0.00006556058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000340251,"about_ca_topic_score_gemma":9.442116e-8,"domain_scores_codex":[0.9988568,0.00002396472,0.0004217906,0.0001200256,0.0003137311,0.0002636796],"domain_scores_gemma":[0.9980209,0.000357831,0.001016907,0.0003874606,0.00009135676,0.0001254706],"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.0003841248,0.0007350169,0.09156932,0.000108293,0.0008018095,0.001287964,0.02332644,0.6951337,0.001675542,0.004809998,0.01212202,0.1680457],"study_design_scores_gemma":[0.004074593,0.004305721,0.07882933,0.001376398,0.0001329267,0.0006848607,0.003872579,0.8946391,0.006977271,0.002345292,0.001870031,0.0008918275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01090458,0.0001827191,0.985745,0.001121067,0.001706933,0.000113214,0.000006450513,0.00001671063,0.000203283],"genre_scores_gemma":[0.3202519,0.00002444504,0.6790422,0.00008015829,0.0004739398,0.000001030685,6.526353e-7,0.000007277263,0.00011836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3093473,"threshold_uncertainty_score":0.516216,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002391736,0.0001321083,0.00016333,0.0001421285,0.0002423109,0.00007656599,0.0002860426,0.00007573,8.690976e-7],"category_scores_gemma":[0.00002926525,0.0001247211,0.0000376313,0.0002146941,0.00002856885,0.0002295194,0.0001197307,0.00008387155,0.0000310402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001885563,"about_ca_system_score_gemma":0.0000311866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005911007,"about_ca_topic_score_gemma":8.828862e-7,"domain_scores_codex":[0.9990183,0.00002780313,0.0001342829,0.0003831396,0.0001246621,0.0003118211],"domain_scores_gemma":[0.99935,0.0001932245,0.00005226102,0.0002921878,0.00003247336,0.00007985219],"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.000007969339,0.00006821572,0.0005736006,0.0002107823,0.00008182169,0.0001206703,0.03481369,0.001236076,0.0001509098,0.04548152,0.006276933,0.9109778],"study_design_scores_gemma":[0.0008174577,0.000307984,0.08007865,0.0001502096,0.00002674556,0.0001514111,0.003127826,0.5812427,0.0001168504,0.01290447,0.3203608,0.0007149373],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05661461,0.07459214,0.7811236,0.05302888,0.0151918,0.001906059,0.00008606529,0.01024361,0.007213205],"genre_scores_gemma":[0.2042975,0.01327523,0.7672962,0.0006890705,0.006906979,0.001171076,0.0001240145,0.0001985606,0.006041395],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9102629,"threshold_uncertainty_score":0.5085979,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003648074,0.0001797517,0.0002218108,0.0001894894,0.0001409181,0.0002195551,0.001433398,0.00005856749,0.000005549378],"category_scores_gemma":[0.00005496918,0.0001890893,0.00004729983,0.0001589082,0.000119444,0.0008015336,0.0001480942,0.0001350637,0.00003373071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001102103,"about_ca_system_score_gemma":0.00009068254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002623125,"about_ca_topic_score_gemma":0.000002247505,"domain_scores_codex":[0.9984127,0.00004975278,0.0003104913,0.0005230918,0.0002108599,0.0004930488],"domain_scores_gemma":[0.9990767,0.000226572,0.0001312291,0.0004447534,0.00001928431,0.0001014611],"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.0002006691,0.001693837,0.2488699,0.0003285483,0.0005113198,0.002905771,0.02386899,0.2277081,0.08987167,0.005385396,0.02680288,0.371853],"study_design_scores_gemma":[0.001940198,0.0003030787,0.07085912,0.0002068924,0.00001330705,0.00008232485,0.00002893831,0.8745933,0.04670931,0.001802387,0.002722198,0.0007389949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.230289,0.00002651291,0.7673023,0.0001049838,0.001281445,0.0002507992,0.000004928534,0.000128127,0.0006120031],"genre_scores_gemma":[0.9150285,8.916988e-7,0.08424382,0.0002473228,0.0002815113,0.00005077242,0.000003550088,0.0000165513,0.0001271502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6847395,"threshold_uncertainty_score":0.7710839,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007127465,0.0006232336,0.000713598,0.0003610825,0.0005542868,0.000660974,0.0008815472,0.0003255024,0.000004163388],"category_scores_gemma":[0.000004273227,0.0006323613,0.0001856945,0.0004086462,0.0001437582,0.0001880126,0.00001147904,0.0003334855,0.0001230359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002638713,"about_ca_system_score_gemma":0.00009302841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000428196,"about_ca_topic_score_gemma":0.000009967021,"domain_scores_codex":[0.9958218,0.000273427,0.0009852072,0.001244751,0.000730344,0.0009444897],"domain_scores_gemma":[0.9974265,0.000325572,0.000363852,0.0012748,0.0002107554,0.0003985805],"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.00003295846,0.000349074,0.00003765455,0.0002174281,0.00007055361,0.00006131589,0.0006852272,0.990671,0.002314872,0.003278212,0.0005854346,0.001696266],"study_design_scores_gemma":[0.001127148,0.0005937559,0.0005512903,0.0005699986,0.0001067389,0.0002211006,0.0002352044,0.9938201,0.001136212,0.00005824086,0.0008349764,0.0007452327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03748866,0.0003191425,0.9556459,0.00006302731,0.002355123,0.001178591,0.0001128239,0.0008638086,0.001972885],"genre_scores_gemma":[0.962433,0.00002503645,0.03345473,0.00002681526,0.0002366418,0.0002470795,0.00003070781,0.00009926163,0.003446725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9249443,"threshold_uncertainty_score":0.9996127,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002850154,0.0001581341,0.0001846502,0.00008010556,0.0001593801,0.0001347243,0.0009325533,0.00006432498,0.00008591199],"category_scores_gemma":[0.0000179201,0.0001482371,0.00004554402,0.0001991561,0.00005274692,0.0007839521,0.0002627947,0.000112464,0.0001013161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003834053,"about_ca_system_score_gemma":0.00005980899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004160067,"about_ca_topic_score_gemma":0.000003102177,"domain_scores_codex":[0.9986033,0.0001082792,0.0002221339,0.0004227658,0.0002361713,0.0004072893],"domain_scores_gemma":[0.9990559,0.00002997496,0.00007380208,0.0006235112,0.00004411105,0.0001726567],"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.0005104375,0.00428838,0.01383253,0.0001116103,0.000482217,0.003834704,0.1089585,0.38473,0.2606402,0.1323526,0.00504492,0.08521385],"study_design_scores_gemma":[0.0004980832,0.0002087492,0.003899843,0.000009455047,0.000004554609,0.0000580433,0.00003970362,0.992349,0.002040075,0.0005063033,0.0001358762,0.0002502992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2378412,0.00000422765,0.7576567,0.00003690436,0.0005264066,0.00009227057,0.000003301779,0.0002725753,0.003566416],"genre_scores_gemma":[0.426242,2.022943e-7,0.57333,0.0002294671,0.00009894465,0.000001906675,0.000002788328,0.000009487,0.00008524071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.607619,"threshold_uncertainty_score":0.6044933,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002803941,0.0002736531,0.0002873894,0.0002511261,0.0003337052,0.0001611914,0.0006026178,0.0001874192,0.000004958325],"category_scores_gemma":[0.00000516083,0.0002942395,0.0001720755,0.0005415967,0.00001973274,0.0001618646,0.000003712197,0.0002484542,0.00004590311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001077758,"about_ca_system_score_gemma":0.0001078513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007592883,"about_ca_topic_score_gemma":0.000004762435,"domain_scores_codex":[0.9980618,0.00006421687,0.0003938127,0.0006135285,0.0003948034,0.0004717851],"domain_scores_gemma":[0.9985408,0.0003881037,0.0001055027,0.0006722881,0.0001379659,0.0001553761],"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.00004070661,0.0002035319,5.011136e-7,0.00001903634,0.00001619891,0.000007058914,0.00005800069,0.9748513,0.003035808,0.001300846,0.0005896855,0.01987732],"study_design_scores_gemma":[0.0008250925,0.0003293037,0.00002012759,0.0000288988,0.00004380363,0.000009616777,0.000009698313,0.9473703,0.04982987,0.001139367,0.00007011485,0.0003238054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002288383,0.000005748478,0.995387,0.001347386,0.001433362,0.00100894,0.0000205149,0.0004134592,0.0001547357],"genre_scores_gemma":[0.1727831,3.708501e-7,0.8258122,0.0005296674,0.0001169633,0.000303573,0.00001463026,0.00002909698,0.00041033],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1725543,"threshold_uncertainty_score":0.9999509,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00566308,0.0001282529,0.0001478344,0.0003121319,0.0003829095,0.0008968863,0.005942091,0.00005625374,0.00001632687],"category_scores_gemma":[0.0007000215,0.00006070802,0.00008297813,0.0004417082,0.0003376245,0.0003485254,0.0004945556,0.002165621,0.00006189784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001280509,"about_ca_system_score_gemma":0.0003848835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003070597,"about_ca_topic_score_gemma":0.0000161532,"domain_scores_codex":[0.9957784,0.0003082037,0.0003214869,0.0001898287,0.00301086,0.0003912044],"domain_scores_gemma":[0.9958299,0.001863047,0.0002516571,0.0006065979,0.001332206,0.0001165589],"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.0003107566,0.0003999305,0.00109146,0.000008224024,0.0005760074,0.001184547,0.008175249,0.7113529,0.01083253,0.2090059,0.02397794,0.03308448],"study_design_scores_gemma":[0.003248705,0.002828848,0.01464583,0.0007133396,0.0000489135,0.009040639,0.001453442,0.8868448,0.008226557,0.04017702,0.03199648,0.0007754926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02963787,0.00008380479,0.7470246,0.214292,0.003969876,0.0002549772,0.000002282606,0.00003806979,0.004696505],"genre_scores_gemma":[0.8776926,0.00002018401,0.1190457,0.0006471843,0.001444714,0.000004769204,7.549644e-7,0.00002025765,0.001123874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8480547,"threshold_uncertainty_score":0.9994363,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002773732,0.0003902728,0.00039157,0.0001205581,0.0003833056,0.00009015294,0.0007179283,0.0002083308,0.00001709765],"category_scores_gemma":[0.000005888647,0.00038852,0.0001478452,0.0005811402,0.00009868728,0.0005512292,0.000009605931,0.0004923598,0.00002509533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009308428,"about_ca_system_score_gemma":0.00001873292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001310131,"about_ca_topic_score_gemma":0.00002297618,"domain_scores_codex":[0.9973484,0.0002112051,0.0005243924,0.0007879091,0.0002373425,0.0008907488],"domain_scores_gemma":[0.9987414,0.0003381164,0.0001642231,0.0005410896,0.00002834708,0.0001868222],"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.00005957021,0.0001927197,0.0001271801,0.000003484827,0.00002480436,0.00002210332,0.0003225383,0.9725873,0.0008658709,0.00001708162,0.000462738,0.02531457],"study_design_scores_gemma":[0.0009669833,0.0003581164,0.000907689,0.00004558382,0.00001834707,0.00001324332,0.00000799388,0.9959362,0.001278228,0.00001715849,0.00006055392,0.0003898647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01758654,0.00005632865,0.979629,0.0001191267,0.00147298,0.0007309214,0.0000166298,0.0002477074,0.0001407015],"genre_scores_gemma":[0.8989496,0.00005044016,0.09939659,0.000417952,0.0001691403,0.0002177932,0.00001873631,0.00006168726,0.0007180464],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8813631,"threshold_uncertainty_score":0.9998567,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004743765,0.0001377521,0.0002305065,0.000202136,0.0002172955,0.0001356115,0.0006424141,0.000114009,4.354389e-7],"category_scores_gemma":[0.0001488435,0.0001194594,0.00001233667,0.0007570526,0.0006496079,0.0006210189,0.000233461,0.0001087917,0.000001247486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003164829,"about_ca_system_score_gemma":0.0001396777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001370739,"about_ca_topic_score_gemma":9.304961e-7,"domain_scores_codex":[0.9985784,0.00002142429,0.000172566,0.0005886378,0.0002499642,0.0003889881],"domain_scores_gemma":[0.9990581,0.0001104292,0.0001393905,0.0004060018,0.0001965654,0.00008952268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004484279,0.0001509819,0.08015972,0.00004518821,0.00002483087,0.00001680011,0.002326744,0.004937992,0.8494101,0.04036217,0.0001595405,0.02236112],"study_design_scores_gemma":[0.002010992,0.003023073,0.01763071,0.0001101502,0.00001103455,0.000048454,0.002117215,0.8374451,0.1310075,0.005984231,0.0001736209,0.0004379722],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7321066,0.0001057379,0.2665601,0.0005911849,0.0001499815,0.0003322286,0.00002570583,0.0001130635,0.00001534713],"genre_scores_gemma":[0.9507264,0.000004277562,0.04919057,0.00002603234,0.00001098065,0.0000213002,0.000004812351,0.000004571284,0.00001101771],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8325071,"threshold_uncertainty_score":0.4871411,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004871945,0.0002440986,0.000263589,0.0001796306,0.0001071706,0.0001381603,0.001127393,0.0001455289,0.00004893243],"category_scores_gemma":[0.00001046366,0.0002298523,0.0000470163,0.0002186694,0.00002621882,0.0006233765,0.0002513033,0.0002073645,0.0001141374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006026664,"about_ca_system_score_gemma":0.00004596026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005544764,"about_ca_topic_score_gemma":0.000002356568,"domain_scores_codex":[0.9977313,0.0001419278,0.0003951628,0.0008617209,0.0002945878,0.0005752604],"domain_scores_gemma":[0.9985572,0.00003024139,0.00008146939,0.0009822823,0.00001958783,0.0003292754],"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.0002360414,0.005138867,0.003389763,0.00002945765,0.00005159041,0.0005061088,0.03765329,0.5893462,0.2113573,0.004162005,0.0007547573,0.1473746],"study_design_scores_gemma":[0.0002167471,0.001219361,0.008265945,0.0000115459,0.000005537396,0.00001659964,0.0002263735,0.9850358,0.004262697,0.0003277448,0.00002069949,0.0003908921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09965572,0.000005604199,0.8944536,0.00003578898,0.0002114924,0.0004550968,0.000001806457,0.0002600498,0.004920802],"genre_scores_gemma":[0.4148937,8.057614e-7,0.5845945,0.0001295983,0.00009531,0.0000748828,0.0000116864,0.00001573248,0.0001837335],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3956896,"threshold_uncertainty_score":0.9373105,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01033623,0.0001455305,0.0003328918,0.001374863,0.0002705409,0.0004647128,0.001654898,0.0001604268,0.00004245384],"category_scores_gemma":[0.001649243,0.000133658,0.0001093362,0.002688331,0.0002070439,0.000637517,0.0003288063,0.002427391,0.0003123608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002888864,"about_ca_system_score_gemma":0.000558878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005258476,"about_ca_topic_score_gemma":0.000009373973,"domain_scores_codex":[0.9949518,0.001036638,0.0009982968,0.0003278861,0.001781988,0.0009033508],"domain_scores_gemma":[0.9962087,0.002142813,0.0002173681,0.0003776048,0.0008606186,0.0001928437],"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.0001388479,0.0006022715,0.004509574,0.00004811616,0.00003221434,0.00313568,0.006673924,0.5033144,0.03425399,0.103186,0.0004709832,0.343634],"study_design_scores_gemma":[0.00005930094,0.000882573,0.002348847,0.0006409806,0.000003238696,0.0002218366,0.001583286,0.8166136,0.02377272,0.1533879,0.0002019518,0.0002837951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1685371,0.0001776013,0.8265545,0.001891941,0.0003092291,0.0001659357,3.633494e-7,0.00006204361,0.002301385],"genre_scores_gemma":[0.7215489,0.0001218905,0.2773754,0.00001258082,0.0005903968,0.000002871073,4.874795e-7,0.00001938343,0.0003280975],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5530119,"threshold_uncertainty_score":0.9998741,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003579776,0.0001317061,0.0001763915,0.0001090965,0.0001150669,0.00005485167,0.00008700302,0.00004381566,8.176577e-8],"category_scores_gemma":[0.000188317,0.000121125,0.00001172425,0.000130239,0.00002148179,0.001343154,0.00005333886,0.0000936544,1.53609e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001988257,"about_ca_system_score_gemma":0.00001352341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001297687,"about_ca_topic_score_gemma":3.030278e-8,"domain_scores_codex":[0.9991581,0.000005563257,0.0003496194,0.00008691716,0.0001280508,0.0002717364],"domain_scores_gemma":[0.9992461,0.0002820361,0.0001964224,0.0001428366,0.00006025655,0.00007229991],"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.000007502555,0.000005273011,0.002261964,0.0003717637,0.000009071047,5.770323e-7,0.009327552,0.9694111,0.0007605312,0.001250878,8.956693e-7,0.01659288],"study_design_scores_gemma":[0.0004250807,0.00008580159,0.003084464,0.0002546099,0.000009047809,0.00004733366,0.0003851134,0.9939213,0.001569657,0.00001159898,0.00005053996,0.0001554316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06573451,0.000335445,0.9334463,0.00001154681,0.0001283173,0.0001773661,0.000001817824,0.000115215,0.00004948524],"genre_scores_gemma":[0.4480794,0.000002576669,0.5518744,0.00001144492,0.00001662776,0.000005025762,0.000002768014,0.000006209635,0.000001547646],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3823449,"threshold_uncertainty_score":0.4939333,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005133871,0.0004873061,0.0004931578,0.0002643718,0.0004219208,0.0004355703,0.0004930956,0.0003045411,0.000007706522],"category_scores_gemma":[0.000007841244,0.0005127426,0.0001541704,0.0004169142,0.0001092468,0.0004064713,0.00001019491,0.0004030242,0.00009496749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001637853,"about_ca_system_score_gemma":0.00007083813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001020529,"about_ca_topic_score_gemma":0.00001244981,"domain_scores_codex":[0.9967125,0.0001872379,0.0008431681,0.0009479137,0.0005961452,0.0007130231],"domain_scores_gemma":[0.9980808,0.0002425912,0.0003206072,0.0007685327,0.0002433083,0.0003441292],"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.00003734256,0.0002973801,0.0000515306,0.000105857,0.00009397689,0.000014488,0.001776306,0.9613858,0.0008407984,0.002563568,0.0005421927,0.0322907],"study_design_scores_gemma":[0.001997362,0.0009499806,0.0004060208,0.0004833427,0.00009779797,0.0001692306,0.0004889503,0.981477,0.004735981,0.0002862891,0.008100477,0.000807628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02948812,0.0005759471,0.9653588,0.0001334108,0.001667158,0.001383345,0.00007077249,0.000413955,0.0009085014],"genre_scores_gemma":[0.9711182,0.00005722406,0.02476674,0.00007873565,0.0003458504,0.0005105212,0.00003405204,0.00006205875,0.003026641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9416301,"threshold_uncertainty_score":0.9997324,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004101132,0.0002321086,0.0002423559,0.0001546747,0.0002951105,0.0002137787,0.0004880029,0.0001461288,0.000002639644],"category_scores_gemma":[0.00001311901,0.0002349048,0.00007049239,0.0002075408,0.00009170538,0.0001864493,0.000005543519,0.0003240331,0.00001898665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005108144,"about_ca_system_score_gemma":0.00007811672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000116808,"about_ca_topic_score_gemma":0.000008888965,"domain_scores_codex":[0.9982951,0.0001088295,0.0002811177,0.0005618745,0.0002828266,0.0004702123],"domain_scores_gemma":[0.9987504,0.0003863645,0.00003640243,0.0005349769,0.00009765698,0.000194153],"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.00001289201,0.00009670706,0.0000201217,0.00003061974,0.00002353588,0.000009244553,0.0009943772,0.869621,0.0004097925,0.0009922043,0.00005118613,0.1277383],"study_design_scores_gemma":[0.0007845983,0.0004612071,0.0008566314,0.00007027106,0.00002036217,0.00004764133,0.00005215773,0.9931204,0.003687314,0.0003081333,0.0003049862,0.0002862666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0188222,0.00004710814,0.9796064,0.0002219424,0.0005241563,0.0003336278,0.00001484652,0.0002484577,0.0001812065],"genre_scores_gemma":[0.7678994,0.000009741379,0.2312446,0.0001034571,0.00006026828,0.00004932797,0.000001871713,0.0000261047,0.0006052082],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7490772,"threshold_uncertainty_score":0.9579138,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002038756,0.00009468437,0.00009651561,0.00004324827,0.0001043913,0.0001112203,0.001383244,0.00003975157,0.00047443],"category_scores_gemma":[0.0000136845,0.00007899768,0.00001692919,0.0001994544,0.00001836357,0.0005806187,0.0004304887,0.00008051494,0.0005946876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001528314,"about_ca_system_score_gemma":0.00002945588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008876275,"about_ca_topic_score_gemma":7.6156e-7,"domain_scores_codex":[0.9989252,0.00004255138,0.0001406309,0.0004309556,0.0002185737,0.000242109],"domain_scores_gemma":[0.9986317,0.00004046443,0.00002458462,0.001209414,0.00001810163,0.00007577636],"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.00001005416,0.0001928203,0.001354823,0.00002047227,0.00004218778,0.000559213,0.001191984,0.02387227,0.007184232,0.001857185,0.05268342,0.9110314],"study_design_scores_gemma":[0.0001119671,0.00001352182,0.000939921,0.00001369477,0.00000286587,0.00009096578,0.000005244079,0.9894509,0.000236973,0.0001171513,0.008889887,0.0001269333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0167872,0.00002886892,0.9693333,0.0005049014,0.0002195905,0.00007508567,0.000007198159,0.0002916781,0.01275217],"genre_scores_gemma":[0.006695131,0.000004143015,0.9886128,0.0005767248,0.0001133843,4.809813e-7,0.00001292365,0.000007163309,0.003977291],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9655786,"threshold_uncertainty_score":0.7643705,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005975454,0.0002528359,0.0003199432,0.0003292326,0.0002180029,0.0002270963,0.0009338938,0.00008668718,0.00001608655],"category_scores_gemma":[0.0002248618,0.0002475109,0.00009584664,0.001233994,0.00004445524,0.0001564493,0.0001399856,0.000163129,0.0001866831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008153446,"about_ca_system_score_gemma":0.000111366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005952881,"about_ca_topic_score_gemma":1.412196e-7,"domain_scores_codex":[0.9981294,0.00002885551,0.0004368292,0.0003908236,0.0005674162,0.0004466896],"domain_scores_gemma":[0.9983295,0.0003820273,0.0001695803,0.0008720428,0.0001192189,0.000127699],"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":[2.824659e-7,0.0001417764,0.000008418274,0.000105546,0.00001837911,0.00003924178,0.0002709071,0.9954154,0.0001913957,0.002592925,0.0007046957,0.0005110599],"study_design_scores_gemma":[0.0004982657,0.00005387991,0.00003236583,0.0001029417,0.00002161911,0.00001239315,0.00002745024,0.9975604,0.0004892829,0.0007734656,0.0001450496,0.0002828903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001241427,0.0000129121,0.9970291,0.000324511,0.0002808075,0.0002418812,0.00001232083,0.001387034,0.0005873208],"genre_scores_gemma":[0.00431996,4.445286e-7,0.9949753,0.0001546731,0.00007193965,0.00005926556,0.00003524933,0.00004204012,0.0003410924],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004195817,"threshold_uncertainty_score":0.9999977,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006570946,0.0001409261,0.0001096669,0.00005439613,0.0003102081,0.0003065367,0.0005145764,0.00005656873,0.000001144491],"category_scores_gemma":[0.0001974716,0.00009715578,0.00002844052,0.0003001099,0.00006825491,0.0002767897,0.0001093344,0.0001743119,0.00008368838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007212097,"about_ca_system_score_gemma":0.00008037491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005576339,"about_ca_topic_score_gemma":0.000004684603,"domain_scores_codex":[0.9986246,0.0001135431,0.0001654621,0.0003705495,0.0004095122,0.0003163057],"domain_scores_gemma":[0.9986606,0.0003681446,0.00006581133,0.0006139908,0.0001011933,0.0001903167],"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.00001149866,0.00005131118,0.000214505,0.000003409247,0.000008416177,0.00003293807,0.0004412056,0.005215758,0.000179624,0.001267477,0.0009600866,0.9916137],"study_design_scores_gemma":[0.0004329781,0.0002168241,0.002365371,0.00001114863,0.00000228341,0.0000262389,0.00006992019,0.9879572,0.002340977,0.001016511,0.005411052,0.0001495383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002267524,0.0001639534,0.9928331,0.001114643,0.000799593,0.0001420598,0.000001267328,0.0002995352,0.002378305],"genre_scores_gemma":[0.3324723,0.000006151518,0.6646749,0.0009498011,0.0001487268,0.00003131602,9.847497e-7,0.00001907989,0.001696738],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9914643,"threshold_uncertainty_score":0.3961898,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002446151,0.0001858584,0.0002643295,0.0004200774,0.0001655761,0.00005731038,0.0003390571,0.0001321568,0.000003410578],"category_scores_gemma":[0.000003179806,0.0001945441,0.00008663833,0.0007159416,0.00002155755,0.0002013089,0.00000121837,0.0001901964,0.00005182599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003497232,"about_ca_system_score_gemma":0.00007510669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006359132,"about_ca_topic_score_gemma":0.000003191192,"domain_scores_codex":[0.9982743,0.00004288337,0.0006012096,0.0004422885,0.0003768204,0.0002625349],"domain_scores_gemma":[0.9990843,0.0001945236,0.0001175423,0.0003117842,0.0001293783,0.0001624709],"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.00002016886,0.0000554931,0.000009767587,0.0000832902,0.00003394944,0.00001334314,0.002557209,0.9770714,0.001128617,0.0007785932,0.00008858882,0.01815955],"study_design_scores_gemma":[0.0001821996,0.0001647602,0.0001144538,0.00014071,0.00002814001,0.000008835144,0.0004286318,0.9872884,0.0112491,0.0000747005,0.0001281302,0.0001919356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01405922,0.00008321283,0.9840097,0.0001834733,0.0005306563,0.0006627247,0.00007910517,0.0003459305,0.00004595339],"genre_scores_gemma":[0.9882888,0.00003498614,0.01088686,0.00007727838,0.00002669365,0.0003303548,0.00001115719,0.00001738376,0.0003265405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9742295,"threshold_uncertainty_score":0.7933277,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009911142,0.00017608,0.0002326858,0.0001096466,0.0001641488,0.0001076597,0.0006769426,0.00004530396,0.00005300504],"category_scores_gemma":[0.000006669461,0.0001552586,0.00004232381,0.0002646592,0.00006247787,0.0001223616,0.0002251448,0.0001050413,0.0007611439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008911412,"about_ca_system_score_gemma":0.0001323434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001821716,"about_ca_topic_score_gemma":0.000002531097,"domain_scores_codex":[0.9986067,0.00004565658,0.0003168471,0.0004497447,0.0002694672,0.0003116227],"domain_scores_gemma":[0.998816,0.00006192504,0.00007669527,0.0008057778,0.0000539612,0.0001856925],"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.000001976885,0.0001567773,0.00005876569,0.000005624569,0.00001885813,0.000003557079,0.0004898356,0.9840518,0.00268942,0.006131756,0.000138795,0.00625281],"study_design_scores_gemma":[0.000547797,0.0003235482,0.01163918,0.00003046172,0.00001451145,0.00003775922,0.00001808414,0.9833356,0.0008950949,0.0002298085,0.002561064,0.0003670765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01767901,0.00003079994,0.9785192,0.0008028556,0.0001005181,0.00111825,0.00001619784,0.0001221106,0.001611082],"genre_scores_gemma":[0.3650085,0.000001642482,0.6338419,0.0003148217,0.00005880162,0.0005287423,0.0000134916,0.0000145533,0.0002175587],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3473295,"threshold_uncertainty_score":0.9783219,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004727394,0.0002058679,0.0003371693,0.0001109329,0.0003278026,0.0003475206,0.0003981259,0.0001069016,0.000002503208],"category_scores_gemma":[0.0000202489,0.0001977905,0.00006901022,0.0001172142,0.0000296475,0.0003696025,0.0001212058,0.0001140587,0.00007333221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001667411,"about_ca_system_score_gemma":0.00005716769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001099724,"about_ca_topic_score_gemma":0.000002205294,"domain_scores_codex":[0.9984551,0.00005930336,0.0004790068,0.000459499,0.0001670056,0.0003801066],"domain_scores_gemma":[0.9989371,0.0001659237,0.0002147029,0.0004555062,0.00009006677,0.0001366888],"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.000006561851,0.00008785622,0.00008648323,0.00008567876,0.00005612553,0.000009189121,0.000710322,0.9060646,0.004575517,0.07376271,0.001253003,0.01330192],"study_design_scores_gemma":[0.0004011297,0.000125901,0.0003313452,0.00008261222,0.00001470264,0.00009225497,0.00002702345,0.9911444,0.0001156168,0.0001604503,0.007245629,0.0002588893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009961944,0.0001578077,0.9930831,0.0008480446,0.0009778338,0.0005149235,0.000009450274,0.000367891,0.003044706],"genre_scores_gemma":[0.3997808,0.0000415844,0.5913454,0.00009676797,0.001082077,0.00006941011,0.00004022873,0.00005127522,0.007492468],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4017377,"threshold_uncertainty_score":0.8065664,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01211847,0.0008016422,0.002031436,0.0004768058,0.0006436303,0.0004652425,0.003760199,0.0003270117,0.00001094096],"category_scores_gemma":[0.00313241,0.0007923789,0.000288388,0.001479488,0.00008614607,0.0002478365,0.004526347,0.001212112,0.0000573568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002207481,"about_ca_system_score_gemma":0.0003050866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000557886,"about_ca_topic_score_gemma":0.000006611084,"domain_scores_codex":[0.9875367,0.008086229,0.001077548,0.001714346,0.000716264,0.0008689517],"domain_scores_gemma":[0.9856286,0.01077966,0.0009011525,0.002345402,0.00009602501,0.000249152],"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":[5.559448e-7,0.00005944435,0.001980206,0.001050777,0.00009404062,0.0001017083,0.0003063485,0.005103867,7.654089e-8,0.000007862874,0.0004242347,0.9908709],"study_design_scores_gemma":[0.0007995141,0.0004088611,0.02684187,0.005335174,0.0002003296,0.0008246549,0.00003080966,0.2771253,3.851204e-7,0.00009004203,0.6855189,0.002824123],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00002032081,0.5962524,0.4012361,0.000004320126,0.001360939,0.000594409,0.00005703809,0.0004339057,0.00004057509],"genre_scores_gemma":[0.0004638586,0.8554147,0.1418802,0.00005231297,0.0003395157,0.0001386028,0.001340838,0.0001760575,0.0001938934],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9880468,"threshold_uncertainty_score":0.9994527,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000226517,0.0003508704,0.0003954144,0.0001678638,0.0002495181,0.00009711595,0.0008904646,0.0001563379,0.000003587169],"category_scores_gemma":[0.000002145245,0.0003347326,0.0001988317,0.001037446,0.00006826426,0.0002578981,0.00001102932,0.0005117772,0.000012778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001006707,"about_ca_system_score_gemma":0.00002281725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009123396,"about_ca_topic_score_gemma":0.00001060027,"domain_scores_codex":[0.9973384,0.0001748921,0.0005416747,0.0007137212,0.0004782874,0.0007530142],"domain_scores_gemma":[0.9985791,0.0001992183,0.0001593903,0.0008005782,0.00006243089,0.0001993015],"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.00002306521,0.000265449,0.0000297812,0.000007113856,0.00002087593,0.00001419359,0.0000646,0.9720879,0.0001669707,0.00006124936,0.0006549552,0.02660382],"study_design_scores_gemma":[0.0004161981,0.0002286107,0.001517829,0.00003354488,0.0000230158,0.00003644911,0.000005885298,0.9972051,0.0001304461,0.00005429007,0.00003202682,0.0003166545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003761131,0.00008712895,0.9927705,0.0002826081,0.001976649,0.0005028734,0.00000809921,0.0003081573,0.0003028892],"genre_scores_gemma":[0.8686644,0.000003839352,0.1305025,0.0003062997,0.0001519842,0.00007500025,0.000005353589,0.00002949193,0.0002611009],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8649033,"threshold_uncertainty_score":0.9999105,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008308982,0.0005802407,0.0005482941,0.0008928312,0.0002801711,0.0005158429,0.002016122,0.0003298794,0.000002502335],"category_scores_gemma":[0.00007263495,0.000577098,0.00008483723,0.000432995,0.0004996154,0.0004805292,0.0005446424,0.0009083429,0.000008023004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002441139,"about_ca_system_score_gemma":0.0005347769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006453407,"about_ca_topic_score_gemma":0.000001637633,"domain_scores_codex":[0.9963339,0.00003417696,0.0004439963,0.001566049,0.0008597519,0.000762154],"domain_scores_gemma":[0.9978805,0.0004131677,0.0002206534,0.001124098,0.0001151973,0.0002464343],"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.00000161384,0.00001011042,0.00005144126,0.00003476806,0.00000519756,0.000116205,0.0006095825,0.9135643,0.00008277672,0.001254583,0.00001456509,0.08425491],"study_design_scores_gemma":[0.0002590652,0.00009564391,0.00007376466,0.0005603252,0.000006101176,0.00007609064,1.579506e-7,0.9834433,0.0003348383,0.01438362,0.0001355042,0.0006315837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001042543,0.0009234168,0.9948355,0.0002349849,0.001166599,0.000251892,0.000003050298,0.000225694,0.002254628],"genre_scores_gemma":[0.02424159,0.00000733402,0.9736492,0.00170752,0.0001485699,0.000007009417,0.000002353392,0.00004344966,0.0001929439],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08362332,"threshold_uncertainty_score":0.9996681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}