{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009355369,0.001685196,0.001522512,0.001174451,0.0009819228,0.00178074,0.002529756,0.0019301,0.01027302],"category_scores_gemma":[0.004425442,0.0006912095,0.001401656,0.002238522,0.0007591054,0.00285215,0.001901886,0.002552749,0.002351222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002240887,"about_ca_system_score_gemma":0.003173085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007228947,"about_ca_topic_score_gemma":0.008702375,"domain_scores_codex":[0.9984768,0.000304828,0.00007705466,0.0003415518,0.000494266,0.0003054715],"domain_scores_gemma":[0.998425,0.0008495931,0.0001266721,0.0003147127,0.0001932478,0.00009081005],"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.0004394554,0.0003018651,0.0007764512,0.0002908415,0.00008228226,0.0001664025,0.0001963186,0.5684029,0.00314509,0.06510264,0.02743291,0.3336628],"study_design_scores_gemma":[0.00009708538,0.00006298756,0.0001269342,0.00002096619,0.000021375,0.0001119972,0.00003817395,0.9596549,0.0007433855,0.03235126,0.006756014,0.000014901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01216631,0.000677823,0.9744186,0.0005927442,0.0001600965,0.0001796713,0.0004141863,0.001897464,0.009493005],"genre_scores_gemma":[0.1243085,0.0005873516,0.8675343,0.0002979222,0.000104178,0.0003864456,0.001233826,0.0003371218,0.005210408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01027302,"threshold_uncertainty_score":0.03436667,"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."}}