{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004826282,0.0009098527,0.0008111139,0.00106321,0.00108989,0.00116801,0.002485886,0.001105858,0.004455415],"category_scores_gemma":[0.00143521,0.0004993108,0.001114489,0.001335587,0.001079602,0.001946193,0.001512346,0.001386426,0.00053849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001458387,"about_ca_system_score_gemma":0.001562566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01099379,"about_ca_topic_score_gemma":0.0130784,"domain_scores_codex":[0.9994805,0.0001603037,0.00002189866,0.0001520357,0.0001177205,0.00006749768],"domain_scores_gemma":[0.9994469,0.0002927693,0.000064118,0.00007934253,0.00006339561,0.00005349193],"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.00004346172,0.00005558753,0.0002058689,0.0001267109,0.0000309331,0.0001479995,0.0001320508,0.9101064,0.001578551,0.04940695,0.001686212,0.03647934],"study_design_scores_gemma":[0.00001544462,0.00003761519,0.00009516095,0.00001322729,0.00001336501,0.00005759168,0.00007732643,0.9555356,0.0005500998,0.03960219,0.003989279,0.00001309072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005627106,0.0001910582,0.9901428,0.0002209295,0.00004036478,0.0000706602,0.00006854869,0.0002770665,0.003361454],"genre_scores_gemma":[0.3493895,0.0007311484,0.6417723,0.0001621665,0.00006566419,0.0002984064,0.000323542,0.0002695774,0.006987574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01099379,"threshold_uncertainty_score":0.02185965,"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."}}