{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004550404,0.000679897,0.0005601913,0.0007393833,0.0005537679,0.0006930306,0.001120313,0.001242063,0.002127369],"category_scores_gemma":[0.001210765,0.0003833524,0.0006911673,0.000779219,0.0004602668,0.0006000792,0.001013666,0.0006715146,0.0002786137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004225891,"about_ca_system_score_gemma":0.001024798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004464521,"about_ca_topic_score_gemma":0.002646959,"domain_scores_codex":[0.9997826,0.00005760002,0.00001203937,0.00005794072,0.00005987427,0.00002994902],"domain_scores_gemma":[0.999675,0.0001719365,0.00003254507,0.0000265464,0.00006973254,0.0000242871],"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.0000432784,0.00005666163,0.0005479025,0.00006507263,0.00004008244,0.000092432,0.00006595525,0.9143308,0.003732527,0.01020313,0.0006898927,0.07013223],"study_design_scores_gemma":[0.000007782218,0.00003612032,0.00007685434,0.000005199285,0.000005813839,0.00002646836,0.00001023317,0.9973028,0.0005276779,0.0014076,0.0005890424,0.000004435346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03474196,0.0002163165,0.9605171,0.0001056037,0.00003348723,0.00007613503,0.00002603887,0.0002075934,0.004075903],"genre_scores_gemma":[0.4110247,0.0002494047,0.5839548,0.00007298744,0.00001819631,0.0003747596,0.00009537913,0.00005973531,0.004150124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004464521,"threshold_uncertainty_score":0.008877039,"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."}}