{"id":"W2171157557","doi":"10.1109/cdc.2008.4738911","title":"Efficient dynamic programming for optimal multi-location robot rendezvous","year":2008,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rendezvous; Correctness; Dynamic programming; Computer science; Robot; Tree (set theory); Node (physics); Mathematical optimization; Robot kinematics; Algorithm; Mobile robot; 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.0002423701,0.0001406957,0.0001413119,0.00009872758,0.0002575694,0.00006319222,0.0005416754,0.00006081349,0.000001253313],"category_scores_gemma":[0.0000885131,0.0001279222,0.00005727525,0.0003563876,0.00004570689,0.00009975232,0.0001065498,0.00008435837,0.00004057568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008663164,"about_ca_system_score_gemma":0.00009851889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002182083,"about_ca_topic_score_gemma":0.000001457963,"domain_scores_codex":[0.9986743,0.0000259869,0.000228001,0.0004412582,0.0002378931,0.000392535],"domain_scores_gemma":[0.9991586,0.00008497888,0.00008145985,0.0004300995,0.0001497057,0.00009521698],"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.00000387253,0.0001863534,0.0001285989,0.00001500259,0.0000116289,0.00002362599,0.001005233,0.9399818,0.0002330147,0.0006573423,0.0001219077,0.05763163],"study_design_scores_gemma":[0.0004621494,0.0001065885,0.003557672,0.00001398638,0.00000372534,0.0001171898,0.00002624252,0.9951668,0.0002239456,0.000007042559,0.0001408878,0.0001737516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00562402,0.0000804174,0.9926242,0.0002497511,0.0003838137,0.0004632805,8.227265e-7,0.0004994497,0.00007425465],"genre_scores_gemma":[0.2376793,9.239631e-7,0.7613733,0.00004359929,0.00002234065,0.00007074342,0.000005525944,0.00000959998,0.0007946887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2320552,"threshold_uncertainty_score":0.5216518,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0384504274314318,"score_gpt":0.2883308256371076,"score_spread":0.2498803982056758,"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."}}