{"id":"W2133424327","doi":"10.1109/ccece.2005.1557014","title":"A hybrid optimal-approximate path planning algorithm","year":2006,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Path (computing); Algorithm; Computer science; Longest path problem; Terrain; Path length; Time complexity; Mathematical optimization; Graph; Mathematics; Theoretical computer science; Shortest path problem","routes":{"ca_aff":true,"ca_fund":true,"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.000530505,0.0005965639,0.0007312211,0.0009336304,0.0006549666,0.0008908233,0.001723387,0.001164598,0.004953116],"category_scores_gemma":[0.002002598,0.0004471223,0.0005135571,0.001332515,0.0005322884,0.001524468,0.0015009,0.0007118074,0.001044104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007002602,"about_ca_system_score_gemma":0.001644829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005971759,"about_ca_topic_score_gemma":0.007457428,"domain_scores_codex":[0.9993457,0.00009610172,0.00004075867,0.0001752199,0.0002677113,0.00007456319],"domain_scores_gemma":[0.9994584,0.0002220338,0.00004343442,0.0001213686,0.0001237039,0.00003110857],"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.000248346,0.0001233664,0.001060288,0.0001199132,0.00006120693,0.0001187731,0.00007878532,0.569192,0.004717736,0.0235547,0.007289791,0.3934351],"study_design_scores_gemma":[0.00003335923,0.00004217878,0.0001245879,0.000005871234,0.00001076937,0.00009086668,0.00001751445,0.987869,0.001298416,0.007487724,0.003011324,0.0000084214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01136222,0.0001846667,0.9826349,0.0001530531,0.00003913589,0.0000920568,0.0001870905,0.001873947,0.003472894],"genre_scores_gemma":[0.174853,0.000130546,0.8205078,0.0001171058,0.00002310837,0.0002001161,0.000498427,0.0001380122,0.003531855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005971759,"threshold_uncertainty_score":0.01656985,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0133171925777672,"score_gpt":0.2387361258685366,"score_spread":0.2254189332907694,"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."}}