{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016767,0.0007276013,0.001126269,0.001077919,0.001367124,0.001263148,0.002099683,0.001321619,0.00327146],"category_scores_gemma":[0.003662172,0.0004901385,0.0008159691,0.001429626,0.0009848417,0.002691763,0.002469458,0.000812463,0.0007018814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211143,"about_ca_system_score_gemma":0.0008228293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005123172,"about_ca_topic_score_gemma":0.005490751,"domain_scores_codex":[0.9991034,0.0003074339,0.00003969908,0.000217001,0.0001947795,0.0001377786],"domain_scores_gemma":[0.9985362,0.0008052704,0.0001816661,0.0002200198,0.0001574908,0.00009931701],"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.0001336581,0.00003619704,0.000640068,0.00006095974,0.00003833688,0.0001474134,0.0001250696,0.9517789,0.00161054,0.01877995,0.0009092283,0.02573973],"study_design_scores_gemma":[0.00002182837,0.00002859064,0.0001010249,0.000006070202,0.000006464747,0.00004796188,0.00005840844,0.986482,0.0009889527,0.01053065,0.001721494,0.000006506317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0631675,0.000290223,0.9304844,0.0002154706,0.00003027011,0.0001343252,0.0001934279,0.0008835213,0.004600816],"genre_scores_gemma":[0.5428614,0.0002358298,0.4496227,0.00007085507,0.00002322698,0.000246803,0.0004977332,0.0001836732,0.006257837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005123172,"threshold_uncertainty_score":0.01094413,"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."}}