{"id":"W2578864413","doi":"","title":"An approximation algorithm for the subpath planning problem","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University; University of Waterloo","funders":"","keywords":"Shortest path problem; Motion planning; Computer science; Mathematical optimization; Routing (electronic design automation); Approximation algorithm; Robot; Graph; Algorithm; Artificial intelligence; Theoretical computer science; Mathematics","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.000285551,0.0001532229,0.0001064388,0.0001097823,0.0001078143,0.0001803808,0.0003469759,0.0000660525,0.0003382255],"category_scores_gemma":[0.00004604763,0.00009811697,0.00005580321,0.00008797301,0.00006877608,0.0002607381,0.00001617201,0.00007938786,0.0001364587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006768814,"about_ca_system_score_gemma":0.00002729704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000725302,"about_ca_topic_score_gemma":0.000009747672,"domain_scores_codex":[0.9989513,0.00002288849,0.0003593807,0.0002261878,0.0002384464,0.0002018055],"domain_scores_gemma":[0.9992643,0.000143797,0.00007312437,0.0001982699,0.0002601004,0.0000603851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001592336,0.00004034621,0.00001369977,0.000006039163,0.00002920167,9.025794e-7,0.0004086492,0.06778239,0.00688725,0.1898611,0.0001608767,0.7347935],"study_design_scores_gemma":[0.00004408499,0.00007671219,0.00003820216,0.0001069498,0.000005443716,0.000003148792,0.0001557637,0.933364,0.03515688,0.02942692,0.001458709,0.0001631724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007280069,0.0000131117,0.992576,0.001330249,0.0009981298,0.0003578692,0.00005012289,0.0002406312,0.003705878],"genre_scores_gemma":[0.9710719,0.00006475572,0.02800925,0.0001413947,0.0002933462,0.0001632552,0.00003065893,0.00002898783,0.0001964469],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9703439,"threshold_uncertainty_score":0.4001094,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.10361960595377,"score_gpt":0.3155399262039841,"score_spread":0.2119203202502141,"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."}}