{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005272279,0.0002414946,0.0004059963,0.000109985,0.000221482,0.0003683122,0.0005127139,0.0001871682,6.586966e-7],"category_scores_gemma":[0.0000744828,0.0002062613,0.00005500062,0.0001845709,0.00003035559,0.0002936204,0.0003796603,0.0001505011,0.000008511603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003895794,"about_ca_system_score_gemma":0.00004989365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007336288,"about_ca_topic_score_gemma":0.000003417233,"domain_scores_codex":[0.9982682,0.00005105204,0.0003498371,0.0005780729,0.0003249753,0.0004278173],"domain_scores_gemma":[0.9986272,0.000262992,0.0001154803,0.0006848206,0.0001286554,0.0001808941],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005083409,0.0002102902,0.01168668,0.001090513,0.0002552841,0.0001591519,0.004428566,0.1461142,0.005363911,0.8161495,0.008036111,0.006454872],"study_design_scores_gemma":[0.0007680648,0.0003851036,0.0009383596,0.0002856137,0.00002337585,0.0001426582,0.0001270004,0.993593,0.00007075186,0.002761006,0.0005650994,0.0003399792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03678844,0.0006822958,0.957884,0.0004726932,0.00260042,0.001069706,0.0000382959,0.000169032,0.0002951166],"genre_scores_gemma":[0.5363962,0.00007271772,0.4616779,0.0002082301,0.000284672,0.00005954364,0.00001087802,0.00004581461,0.001244035],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8474787,"threshold_uncertainty_score":0.8411092,"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."}}