{"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,"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","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003682049,0.0006540128,0.0005582075,0.0003215224,0.0006355961,0.0005668825,0.000870724,0.0005331654,0.002317419],"category_scores_gemma":[0.0007254049,0.0003760798,0.0005284927,0.0004286786,0.0006970307,0.0007116226,0.0008226242,0.0006323592,0.0002351457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001061028,"about_ca_system_score_gemma":0.001010837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01371593,"about_ca_topic_score_gemma":0.01470031,"domain_scores_codex":[0.9998073,0.00004940218,0.000007200457,0.00005724187,0.00003640386,0.00004254256],"domain_scores_gemma":[0.999786,0.0001123478,0.00003494849,0.00001874326,0.00002199122,0.00002601192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004817029,0.0000172262,0.000173263,0.00003446984,0.000009861441,0.00006397833,0.0000771047,0.985031,0.000994052,0.004475729,0.0003146506,0.008760544],"study_design_scores_gemma":[0.00001302894,0.00003077173,0.00009323618,0.000003927677,0.000003943667,0.00001270337,0.0000500136,0.9934829,0.0005157663,0.005119862,0.0006698118,0.000004137226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06737916,0.0002402481,0.9271354,0.0001806728,0.00002545863,0.00007795684,0.0001067024,0.000383187,0.004471196],"genre_scores_gemma":[0.8611295,0.0001669817,0.1341412,0.00003872799,0.00001270122,0.0001593305,0.0001742194,0.00009633583,0.004080941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01371593,"threshold_uncertainty_score":0.02727216,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1063186945706296,"score_gpt":0.3101755045786667,"score_spread":0.2038568100080371,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}