{"id":"W4402677380","doi":"10.3390/a17090420","title":"An Algorithm to Find the Shortest Path through Obstacles of Arbitrary Shapes and Positions in 2D","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Shortest path problem; Path (computing); Algorithm; Computer science; Shortest Path Faster Algorithm; K shortest path routing; Yen's algorithm; Mathematics; Combinatorics; Mathematical optimization; Dijkstra's algorithm; Graph","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.0003394417,0.001424361,0.0007744273,0.001204032,0.001156367,0.0009503813,0.001562416,0.001210658,0.00813189],"category_scores_gemma":[0.0008740495,0.0007013695,0.0009128385,0.001151635,0.0006052767,0.001245903,0.001656393,0.001068896,0.002388602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007803976,"about_ca_system_score_gemma":0.001769031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007393636,"about_ca_topic_score_gemma":0.008475897,"domain_scores_codex":[0.9997094,0.0000400278,0.00002192481,0.00008616824,0.0001064877,0.00003586731],"domain_scores_gemma":[0.9997417,0.0001120295,0.00002673821,0.00002911268,0.00007131705,0.00001915968],"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.0001189458,0.0001316509,0.0008837433,0.0003741819,0.00007845029,0.0002353135,0.0001956474,0.4312256,0.0099494,0.03538529,0.01443688,0.5069849],"study_design_scores_gemma":[0.00008101443,0.0001035518,0.0002436891,0.0000307565,0.00002079292,0.0002089472,0.00007029666,0.9563686,0.003031794,0.02051353,0.01929544,0.00003160314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002120793,0.00005773786,0.9941848,0.00006228299,0.00002837661,0.000101389,0.000108117,0.001140433,0.002196101],"genre_scores_gemma":[0.02181814,0.00008157078,0.9753059,0.0000352154,0.000009973052,0.000276136,0.0003328226,0.0001395444,0.002000646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00813189,"threshold_uncertainty_score":0.02720386,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01892442466466172,"score_gpt":0.2890340159810184,"score_spread":0.2701095913163567,"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."}}