{"id":"W2021090380","doi":"10.1017/s0263574714002690","title":"A memetic algorithm approach for solving the task-based configuration optimization problem in serial modular and reconfigurable robots","year":2014,"lang":"en","type":"article","venue":"Robotica","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Modular design; Task (project management); Reachability; Genetic algorithm; Dimension (graph theory); Computer science; Robot; Memetic algorithm; Inverse kinematics; Mathematical optimization; Optimization problem; Algorithm; Mathematics; Artificial intelligence; Engineering","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":[],"consensus_categories":[],"category_scores_codex":[0.0004992643,0.0001662962,0.0002048395,0.00007291159,0.0001159652,0.0001153703,0.0001284762,0.0001077258,0.00002331143],"category_scores_gemma":[0.0000605128,0.0001362768,0.00003743782,0.0001442806,0.00003744087,0.0001241,0.000006692414,0.0001349668,0.000002333459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003881191,"about_ca_system_score_gemma":0.00001882017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002531541,"about_ca_topic_score_gemma":0.00000833262,"domain_scores_codex":[0.9990095,0.00005154351,0.0002877662,0.0002509429,0.0001205222,0.0002797027],"domain_scores_gemma":[0.9995171,0.0001081225,0.00004210426,0.0002163045,0.00006221342,0.00005418771],"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.000006776957,0.00001831405,0.000006025353,0.00009551254,0.00001106808,2.401844e-7,0.000110583,0.9816782,0.001775848,0.001010063,0.00004311913,0.01524421],"study_design_scores_gemma":[0.0003638514,0.00005137508,0.00002706061,0.00003524982,0.00002017585,0.000002828818,0.00002605177,0.9947287,0.004048251,0.000353619,0.0001643297,0.0001785178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002067454,0.0001148873,0.99703,0.0001622385,0.0001544157,0.0007651902,0.000003220455,0.00009297467,0.001470297],"genre_scores_gemma":[0.5371393,0.00003340805,0.4622501,0.00006980404,0.0001194018,0.0002067434,0.00006488331,0.00004549973,0.00007088528],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5369325,"threshold_uncertainty_score":0.5557206,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01129662601342676,"score_gpt":0.2020554343098301,"score_spread":0.1907588082964033,"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."}}