{"id":"W2968601138","doi":"10.1109/icra.2019.8794252","title":"The Robust Canadian Traveler Problem Applied to Robot Routing","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Tree traversal; Robot; Computer science; Mathematical optimization; Routing (electronic design automation); Vehicle routing problem; Selection (genetic algorithm); Variation (astronomy); Operations research; Artificial intelligence; Algorithm; Mathematics; Computer network","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004186544,0.00008149128,0.00007292868,0.00007268383,0.000265684,0.0004370454,0.0008051947,0.00003317525,0.0001333024],"category_scores_gemma":[0.00001001683,0.00005414566,0.00002190954,0.0004064681,0.0000109046,0.0001347094,0.0001205502,0.0001028344,0.001056846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006629677,"about_ca_system_score_gemma":0.0002336002,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.007398002,"about_ca_topic_score_gemma":0.03722754,"domain_scores_codex":[0.9989228,0.00002501674,0.0001448263,0.0002575174,0.0001968878,0.0004530154],"domain_scores_gemma":[0.9991738,0.00003870482,0.00002170787,0.0004098087,0.0000672247,0.0002887199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001570546,0.000008772668,0.0002871373,0.00000375346,0.00000637018,9.078241e-7,0.00102931,0.2053791,0.0002258203,0.7386126,0.004194286,0.05025034],"study_design_scores_gemma":[0.0004514208,0.00007934812,0.002165294,0.00001537716,0.00000161272,0.000005092409,0.0003123604,0.894408,0.0003797296,0.002246566,0.09951093,0.0004243034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002158259,0.000004043895,0.62388,0.0092635,0.0001286602,0.0006127069,3.655627e-7,0.00009960376,0.3657953],"genre_scores_gemma":[0.7284043,0.000003572534,0.2418876,0.003842383,0.00003205298,0.00004365826,0.000001755684,0.00001300614,0.02577164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.736366,"threshold_uncertainty_score":0.9997209,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01566001059145995,"score_gpt":0.2130844335691426,"score_spread":0.1974244229776826,"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."}}