{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008076425,0.001137935,0.00143639,0.0006087181,0.0007667632,0.001149352,0.001271277,0.001201258,0.003363265],"category_scores_gemma":[0.002292303,0.000855151,0.0008280315,0.0008841188,0.001151265,0.00118415,0.001368689,0.001998207,0.0006379329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001397316,"about_ca_system_score_gemma":0.00184305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007349924,"about_ca_topic_score_gemma":0.005264214,"domain_scores_codex":[0.9994217,0.0001514489,0.00001785663,0.00012894,0.0001704733,0.0001095236],"domain_scores_gemma":[0.9992774,0.0005086474,0.00005280671,0.00003812793,0.00009003918,0.0000329825],"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.00003721427,0.00003191154,0.00009752366,0.00003837456,0.00001370809,0.00003194518,0.00003411386,0.9577084,0.0005989968,0.02240587,0.0008251427,0.01817692],"study_design_scores_gemma":[0.0000135418,0.00001166631,0.00001922861,0.000003514329,0.000002676839,0.000007061907,0.000007577663,0.9884162,0.0002662201,0.01070924,0.0005392113,0.000003888924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005162333,0.0001111439,0.9916753,0.0001323923,0.00001593524,0.00002832917,0.00003313413,0.00020553,0.002636042],"genre_scores_gemma":[0.3263842,0.0003532163,0.6656993,0.0001119792,0.00003839017,0.0004997045,0.0002441936,0.0002941029,0.00637487],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007349924,"threshold_uncertainty_score":0.01461428,"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."}}