{"id":"W2408178243","doi":"10.2316/journal.206.2015.3.206-3956","title":"LOWER BOUNDS FOR A VEHICLE ROUTING PROBLEM WITH MOTION CONSTRAINTS","year":2015,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Motion planning; Path (computing); Vehicle routing problem; Motion (physics); Routing (electronic design automation); Set (abstract data type); Mathematical optimization; Computer science; Mathematics; Artificial intelligence; Computer network; Robot","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005651091,0.0000743857,0.0001082437,0.0001199999,0.00004265952,0.0002631142,0.000275383,0.00003417457,7.583004e-7],"category_scores_gemma":[0.0001035439,0.00005974395,0.00003011414,0.00007465477,0.00003905063,0.0006323908,0.00003922726,0.00007779176,0.000001361736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007800359,"about_ca_system_score_gemma":0.0001289899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002403926,"about_ca_topic_score_gemma":3.143189e-7,"domain_scores_codex":[0.9990605,0.00002418634,0.0002902514,0.0001033739,0.0004178209,0.0001038311],"domain_scores_gemma":[0.9985344,0.00006835689,0.000378508,0.00006518822,0.000870779,0.00008275636],"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.0001145532,0.0002752963,0.005652067,0.00002637485,0.0002851705,0.0001480668,0.00318258,0.6400883,0.000766305,0.07736997,0.000831292,0.2712601],"study_design_scores_gemma":[0.001317977,0.0003450833,0.002718028,0.0001405294,0.00001300262,0.0005173347,0.00006847958,0.9893855,0.0001483048,0.00515507,0.0000983768,0.00009232058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01216417,0.00002527849,0.9845571,0.002258073,0.0006877964,0.00008244372,0.000001864021,0.00002819442,0.0001950628],"genre_scores_gemma":[0.5698479,0.000001582909,0.4299696,0.00005553219,0.0001035113,0.000001127067,0.000001948159,0.000003630505,0.00001515689],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5576837,"threshold_uncertainty_score":0.2537216,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0243183802025688,"score_gpt":0.2735373691974018,"score_spread":0.249218988994833,"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."}}