{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003829075,0.004462345,0.00284564,0.003308926,0.001887599,0.006564862,0.003955197,0.003637412,0.02026645],"category_scores_gemma":[0.01848999,0.00151063,0.002315784,0.003748088,0.002226351,0.006966071,0.003726503,0.006660966,0.002490007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004443335,"about_ca_system_score_gemma":0.002834684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005466264,"about_ca_topic_score_gemma":0.006265602,"domain_scores_codex":[0.9965486,0.00108006,0.000131815,0.0005344413,0.0009316456,0.0007734445],"domain_scores_gemma":[0.9828903,0.01403463,0.0008312385,0.0005185514,0.000994968,0.0007303164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003395971,0.0002892578,0.0006868941,0.0008632523,0.0001795146,0.0001911063,0.0002230414,0.7962714,0.00160903,0.1464639,0.01879448,0.03408856],"study_design_scores_gemma":[0.00007187249,0.0001169284,0.0002594049,0.0001631947,0.0000628769,0.00008083801,0.00007857169,0.8577895,0.0004934411,0.1350152,0.005839312,0.00002880606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02991249,0.006834593,0.8857266,0.005700703,0.0006653289,0.0003467044,0.002519749,0.001154306,0.06713949],"genre_scores_gemma":[0.4908831,0.009591344,0.4447302,0.002404099,0.001925359,0.002226233,0.007037025,0.001678716,0.039524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02026645,"threshold_uncertainty_score":0.06779802,"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."}}