{"id":"W4309066605","doi":"10.3233/ica-220695","title":"An efficient multi-robot path planning solution using A* and coevolutionary algorithms","year":2022,"lang":"en","type":"article","venue":"Integrated Computer-Aided Engineering","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"ca_institutions":"Athabasca University","funders":"H2020 European Research Council; Agencia Estatal de Investigación; Junta de Castilla y León; Centro para el Desarrollo Tecnológico Industrial; European Commission","keywords":"Robot; Motion planning; Computer science; Path (computing); Set (abstract data type); Process (computing); Evolutionary algorithm; Enhanced Data Rates for GSM Evolution; Collision avoidance; Collision; Artificial intelligence; Mathematical optimization; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005738186,0.0003925247,0.000349036,0.0004772866,0.0007039976,0.0002274372,0.0009115388,0.00009246934,0.000005058621],"category_scores_gemma":[0.00002409148,0.0004365304,0.00007256874,0.001063582,0.00003987409,0.000415909,0.0006312064,0.0007026179,0.000004487664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004791872,"about_ca_system_score_gemma":0.0001233607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001456583,"about_ca_topic_score_gemma":1.452266e-7,"domain_scores_codex":[0.9973857,0.0001682843,0.0004598131,0.0008184812,0.0004970647,0.0006705941],"domain_scores_gemma":[0.998805,0.0001199827,0.0001415343,0.0005730545,0.0001077692,0.0002526613],"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.00000440228,0.0001179278,0.0001684884,0.00001369624,0.00003282438,0.0002103166,0.000824304,0.9855623,0.006174084,0.0003867646,0.00005195786,0.006452881],"study_design_scores_gemma":[0.0005584666,0.0002449716,0.002811417,0.0001004229,0.00001221308,0.0007465212,0.00008292628,0.9945513,0.0001865045,0.00001783549,0.0001910028,0.0004963892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06727766,0.0004795832,0.9291493,0.00005667907,0.001778397,0.0002267963,0.0000175912,0.001008963,0.000005074596],"genre_scores_gemma":[0.3514061,0.000001230709,0.648348,0.00005021401,0.00009983733,0.00002594844,0.00003075609,0.00003131576,0.000006620528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2841285,"threshold_uncertainty_score":0.9998087,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02733164414826478,"score_gpt":0.2561648191915628,"score_spread":0.228833175043298,"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."}}