{"id":"W1884799660","doi":"10.1016/j.ifacol.2015.08.147","title":"Adaptive Charged System Search Approach to Path Planning for Multiple Mobile Robots","year":2015,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"Ministry of Education and Research, Romania; Autoritatea Natională pentru Cercetare Stiintifică; Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Corporation for National and Community Service; Michigan Economic Development Corporation","keywords":"Particle swarm optimization; Motion planning; Computer science; Mobile robot; Mathematical optimization; Fitness function; Gravitational search algorithm; Holonomic; Algorithm; Path (computing); Robot; Mathematics; Artificial intelligence; Genetic algorithm","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.0006052866,0.0006604453,0.000594945,0.000754681,0.0005370657,0.0007323638,0.001153895,0.0007535945,0.002624736],"category_scores_gemma":[0.001472641,0.0003531149,0.0005648887,0.0007668929,0.000773155,0.000689303,0.001167251,0.0007850601,0.0003951278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007092404,"about_ca_system_score_gemma":0.001064094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003510963,"about_ca_topic_score_gemma":0.002694311,"domain_scores_codex":[0.9996566,0.0001268801,0.00001490971,0.00005451576,0.000111247,0.00003583601],"domain_scores_gemma":[0.9996089,0.0001884355,0.00003985995,0.0000277161,0.0001110828,0.00002398048],"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.00004568814,0.00002317459,0.0003992989,0.00007609642,0.00004650288,0.0000757155,0.00008158288,0.9127967,0.002352172,0.02553842,0.0007624493,0.05780214],"study_design_scores_gemma":[0.00001038677,0.00004841413,0.00006826028,0.000005672893,0.000006011388,0.00002471752,0.00001087462,0.9926038,0.0004348645,0.005391659,0.001389389,0.00000594944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005675399,0.0001308861,0.9917877,0.00006077368,0.0000282495,0.00002870417,0.000008767862,0.00009360239,0.002185896],"genre_scores_gemma":[0.5354578,0.00040863,0.4567735,0.0001454681,0.00007147389,0.0003977186,0.00008876833,0.00009278944,0.006563879],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003510963,"threshold_uncertainty_score":0.008780658,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09886589676885361,"score_gpt":0.302446120458516,"score_spread":0.2035802236896624,"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."}}