{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001113437,0.0003552968,0.0004992079,0.0002082222,0.0002305513,0.0001607789,0.001255162,0.0001556818,8.002349e-7],"category_scores_gemma":[0.0002004741,0.0003223569,0.0001202138,0.0005884544,0.00003871506,0.0003549661,0.0003333645,0.0002863126,0.0001207926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002932872,"about_ca_system_score_gemma":0.0002359273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008325024,"about_ca_topic_score_gemma":7.48788e-7,"domain_scores_codex":[0.9969121,0.0001489476,0.0003961389,0.0009597496,0.0007150774,0.0008679816],"domain_scores_gemma":[0.9978399,0.0002854485,0.0001197876,0.0007709685,0.0003462981,0.0006376004],"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.0001900808,0.0004890825,0.001163768,0.0001881542,0.000129728,0.0001145362,0.02473933,0.9569024,0.001564889,0.001800376,0.0005701011,0.01214752],"study_design_scores_gemma":[0.001360702,0.0005764971,0.0003413167,0.0001442796,0.00001241886,0.00006506982,0.003651715,0.9927955,0.0003212299,0.000009784201,0.00030626,0.0004151713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008621082,0.0002783539,0.9866088,0.0001937146,0.0007799393,0.001556219,0.00009607837,0.0006193162,0.001246482],"genre_scores_gemma":[0.1104329,5.972293e-7,0.8878894,0.0001793337,0.0004395537,0.0004051907,0.00006789483,0.0000420654,0.0005430647],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1018118,"threshold_uncertainty_score":0.9999229,"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."}}