{"id":"W2007822373","doi":"10.1109/icra.2014.6907710","title":"Multi-agent rendezvous on street networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Rendezvous; Shortest path problem; Computer science; Task (project management); Path (computing); Mathematical optimization; Distributed computing; Computer network; Mathematics; Theoretical computer science; Engineering; Graph","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.0002045825,0.00008519452,0.00007035485,0.00004516522,0.0000596564,0.0001615934,0.0007922103,0.00002172641,0.00002917917],"category_scores_gemma":[0.00001136722,0.00006643136,0.00002905597,0.0001351232,0.00001085749,0.0002570436,0.0003352434,0.00006127356,0.000234827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009747557,"about_ca_system_score_gemma":0.000002758642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002331399,"about_ca_topic_score_gemma":0.00002958293,"domain_scores_codex":[0.9992361,0.00002950581,0.00009509436,0.000285349,0.0001527603,0.0002011726],"domain_scores_gemma":[0.9992465,0.00003062492,0.00002824652,0.0006221147,0.00001184631,0.0000606234],"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.000001445431,0.0001388267,0.0004344418,0.000003512678,0.00001585,0.00001057618,0.0000295091,0.003180058,0.000006442349,0.2163022,0.06706251,0.7128146],"study_design_scores_gemma":[0.0002282049,0.00006903902,0.002440526,0.000004447098,0.000001724119,2.678389e-7,0.00000436225,0.9238787,0.00003777195,0.0001892867,0.07303678,0.0001089112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002248912,0.000007689935,0.9787638,0.0004044233,0.0004987652,0.0000626688,5.548076e-7,0.0002189878,0.01981829],"genre_scores_gemma":[0.6842563,0.00002170746,0.2973529,0.003666395,0.0003109178,0.00001104082,0.00002001263,0.0000118226,0.01434888],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9206986,"threshold_uncertainty_score":0.3018305,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02206231649215098,"score_gpt":0.2390775722026118,"score_spread":0.2170152557104608,"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."}}