{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004605268,0.0002454378,0.0002871198,0.0001974571,0.000141628,0.0003158207,0.0009279907,0.00009888778,0.000007865908],"category_scores_gemma":[0.00003227188,0.0001875662,0.00006380409,0.001059633,0.0001288423,0.0009004588,0.0002396442,0.0003301651,0.0000268701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004149618,"about_ca_system_score_gemma":0.0001267351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003322066,"about_ca_topic_score_gemma":0.000008142302,"domain_scores_codex":[0.9979813,0.000122433,0.000404781,0.0006723446,0.0003926343,0.0004264871],"domain_scores_gemma":[0.998758,0.0004148136,0.00004934461,0.000576565,0.00005962535,0.0001416914],"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.00000554986,0.0004188486,0.000947081,0.00006277652,0.0001201485,0.001227158,0.0254942,0.005063365,0.002111587,0.0210556,0.00139,0.9421037],"study_design_scores_gemma":[0.0001646637,0.0003237092,0.03048901,0.0002525021,0.00002057334,0.0002471613,0.000383361,0.9578848,0.0005402084,0.00862139,0.0007454802,0.0003270776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02015289,0.003426995,0.9715284,0.002861777,0.0006163089,0.0004575784,0.0001101008,0.0002975773,0.0005483799],"genre_scores_gemma":[0.1577276,0.0001137411,0.8410887,0.0006602549,0.0002062018,0.00006396926,0.00001771675,0.00003201221,0.00008981347],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9528215,"threshold_uncertainty_score":0.7648726,"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."}}