{"id":"W2972456753","doi":"10.1049/iet-csr.2019.0001","title":"FreeD∗: a mechanism for finding a short and collision free path","year":2019,"lang":"en","type":"article","venue":"IET Cyber-Systems and Robotics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"King Abdulaziz City for Science and Technology","keywords":"Motion planning; Shortest path problem; Dijkstra's algorithm; Path (computing); Obstacle avoidance; Any-angle path planning; Mobile robot; Computer science; Pathfinding; Obstacle; Fast path; Robot; Robotics; Artificial intelligence; Diagonal; Position (finance); Yen's algorithm; Mathematics; Graph; Theoretical computer science; Geography","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.0008144435,0.0009452429,0.0007434039,0.00165711,0.0009489386,0.0008980185,0.002825464,0.001523907,0.006999078],"category_scores_gemma":[0.002340937,0.0006193182,0.0009604998,0.001109398,0.0009819597,0.001659206,0.002795117,0.001199496,0.001526138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006328343,"about_ca_system_score_gemma":0.001282279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002329695,"about_ca_topic_score_gemma":0.001944036,"domain_scores_codex":[0.9996177,0.00005436023,0.0000330044,0.0001000179,0.0001471031,0.0000478235],"domain_scores_gemma":[0.9992095,0.0002925197,0.0001073096,0.0002023562,0.0001159743,0.00007224279],"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.0004972654,0.0001805402,0.00133386,0.0006341224,0.0001812186,0.0005254158,0.0003040673,0.3281893,0.02927481,0.08066559,0.01456147,0.5436524],"study_design_scores_gemma":[0.0001904962,0.0003431873,0.0004031917,0.00007792195,0.0000698689,0.0005795378,0.00008451252,0.8916178,0.01930413,0.03766027,0.04955833,0.0001106967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006888163,0.0002942571,0.9870472,0.0001216935,0.00010013,0.0001176203,0.0001355056,0.002666592,0.002628893],"genre_scores_gemma":[0.2270373,0.0005123491,0.762141,0.0002023761,0.00003099994,0.0004823682,0.0005073712,0.0005444778,0.008541738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006999078,"threshold_uncertainty_score":0.02341425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02188075674432547,"score_gpt":0.2453944052543753,"score_spread":0.2235136485100499,"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."}}