{"id":"W2976599095","doi":"10.18280/isi.240313","title":"Design and Simulation of a Collision-free Path Planning Algorithm for Mobile Robots Based on Improved Ant Colony Optimization","year":2019,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Ant colony optimization algorithms; Motion planning; Computer science; Mobile robot; Path (computing); Robot; Collision; Collision avoidance; Simulation; Artificial intelligence; Mathematical optimization; Algorithm; Computer network; Mathematics; Computer security","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007932804,0.0001922746,0.0002773385,0.0003129994,0.0001689306,0.0002091753,0.0003662482,0.0001378448,0.000002184955],"category_scores_gemma":[0.0002949167,0.0001857453,0.00004576654,0.0003882839,0.00004233069,0.002056699,0.00008630841,0.00008314769,0.000004283663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001592203,"about_ca_system_score_gemma":0.0001393051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001053125,"about_ca_topic_score_gemma":3.181937e-8,"domain_scores_codex":[0.998536,0.00008575091,0.0005803117,0.0002245574,0.0003145669,0.0002588202],"domain_scores_gemma":[0.9978225,0.0007201628,0.0005416645,0.0004595286,0.0003860942,0.00007008194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004814858,0.00002345255,0.00007213884,0.0001172474,0.000009986754,5.555581e-7,0.001680225,0.9604473,0.0000744971,0.00005198455,0.00004270896,0.0374318],"study_design_scores_gemma":[0.001418597,0.0009965212,0.0003047404,0.0002896788,0.000009820086,0.000004345113,0.0001098726,0.9956874,0.0006890444,0.0002516363,0.00003494121,0.0002033932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004573793,0.00003258034,0.9929917,0.00001264395,0.0003151261,0.001801205,0.00002673985,0.0001430172,0.0001031902],"genre_scores_gemma":[0.2106422,0.0000020849,0.7890251,0.00008086958,0.00001792324,0.0001389777,0.00007180103,0.00001084328,0.00001013581],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2060684,"threshold_uncertainty_score":0.7574472,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01467092682537847,"score_gpt":0.245842842915873,"score_spread":0.2311719160904946,"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."}}