{"id":"W1987474585","doi":"10.1109/icra.2013.6631066","title":"A graph-based approach to multi-robot rendezvous for recharging in persistent tasks","year":2013,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rendezvous; Robot; Computer science; Mathematical optimization; Travelling salesman problem; Graph; Heuristic; Vertex (graph theory); Robot kinematics; Mobile robot; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Engineering","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.0004246946,0.0001799754,0.0002193515,0.0003400446,0.00008783287,0.0001632869,0.0008510242,0.00007753501,0.000004766065],"category_scores_gemma":[0.00009991605,0.0001599245,0.0001264176,0.0005920797,0.0000191851,0.0002384408,0.0001215156,0.0001313623,0.00007052302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009317591,"about_ca_system_score_gemma":0.00006014446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003285967,"about_ca_topic_score_gemma":0.000004251789,"domain_scores_codex":[0.998297,0.00005794614,0.0002713052,0.0006176019,0.0002293793,0.0005267528],"domain_scores_gemma":[0.9989575,0.0001214336,0.00005651606,0.0005845316,0.00009229284,0.000187769],"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.00002183726,0.001343227,0.002692768,0.0001549205,0.00007220618,0.00002273927,0.007232863,0.9036323,0.004369854,0.007293282,0.0102907,0.06287334],"study_design_scores_gemma":[0.0007397177,0.0001348489,0.001861247,0.00003271933,0.000003302148,0.000007660929,0.0002005985,0.9962342,0.0003173694,0.0001316672,0.00009193447,0.0002447014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001093039,0.00002894809,0.994612,0.001382852,0.0002159958,0.000986984,0.000001747351,0.0002380333,0.001440404],"genre_scores_gemma":[0.1326473,2.76795e-7,0.8654924,0.0008274592,0.0000213317,0.0004317442,0.000004980514,0.00001291328,0.0005615723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1315543,"threshold_uncertainty_score":0.6521534,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06543835337402218,"score_gpt":0.2727956505544964,"score_spread":0.2073572971804742,"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."}}