{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002955426,0.000485028,0.0004847363,0.0004079902,0.0003929051,0.0004813546,0.0008850693,0.0007818226,0.001944328],"category_scores_gemma":[0.000678938,0.0002989886,0.000459655,0.0003179095,0.0003639835,0.0004360756,0.0003881003,0.0005182392,0.000270489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003599749,"about_ca_system_score_gemma":0.0008544058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005700262,"about_ca_topic_score_gemma":0.00337215,"domain_scores_codex":[0.999858,0.00003138071,0.000006385845,0.00002061478,0.0000664658,0.00001703816],"domain_scores_gemma":[0.9997551,0.0001070617,0.00002644392,0.00002409519,0.00006862471,0.00001861536],"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.00002871851,0.00002299982,0.0003271646,0.00004244653,0.00001500517,0.00005262383,0.00003855112,0.9842629,0.003146122,0.001989172,0.0002500116,0.009824242],"study_design_scores_gemma":[0.000007513599,0.00001587849,0.00005084613,0.000001727403,0.000002640562,0.000006644617,0.000003516006,0.9987733,0.0005697857,0.0001866644,0.0003791271,0.000002349048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07575992,0.0001995539,0.9134608,0.0001515553,0.00009013508,0.0001928492,0.00008362249,0.00154823,0.008513366],"genre_scores_gemma":[0.6323542,0.0002163972,0.3639403,0.00003898634,0.00001089935,0.0004723636,0.0001237655,0.0001104207,0.002732571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005700262,"threshold_uncertainty_score":0.01133418,"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."}}