{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003430841,0.0002325142,0.0002315452,0.0001387237,0.0001707615,0.0002840387,0.00095126,0.00005149079,0.00001654832],"category_scores_gemma":[0.00001598943,0.0002078418,0.00007456946,0.0002744895,0.0000410259,0.0005115594,0.0002875052,0.0001803733,0.0001852101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004693294,"about_ca_system_score_gemma":0.00006004627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001173908,"about_ca_topic_score_gemma":6.281112e-8,"domain_scores_codex":[0.9980433,0.0000493755,0.0003201938,0.0005763523,0.0004129551,0.0005978427],"domain_scores_gemma":[0.9989837,0.00008168969,0.0001040066,0.0006522383,0.00006378307,0.0001145383],"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.00001330679,0.0008355592,0.003953761,0.00007745993,0.0001274509,0.007032336,0.001420152,0.3264585,0.001670116,0.0891755,0.184523,0.3847128],"study_design_scores_gemma":[0.0003105272,0.000053723,0.001268979,0.00002927294,0.000004208436,0.0002766216,0.00001348113,0.9913473,0.001731803,0.002577823,0.002073129,0.0003131799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001957596,0.0001536081,0.9822911,0.0002499259,0.0004141334,0.0001364443,0.000005211563,0.0009540392,0.01383795],"genre_scores_gemma":[0.01843937,0.00000122479,0.9791676,0.0002167804,0.0001906304,0.00001929621,0.00001429016,0.00001843847,0.001932329],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6648887,"threshold_uncertainty_score":0.8475542,"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."}}