{"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":"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"},"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."}}