{"id":"W2743295872","doi":"10.2316/journal.206.2017.4.206-4998","title":"A MEMETIC ALGORITHM WITH VARIABLE LENGTH CHROMOSOME FOR ROBOT PATH PLANNING UNDER DYNAMIC ENVIRONMENTS","year":2017,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Memetic algorithm; Motion planning; Computer science; Path (computing); Variable (mathematics); Chromosome; Path length; Algorithm; Mathematical optimization; Artificial intelligence; Robot; Mathematics; Local search (optimization); Biology; Genetics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004502441,0.0004197399,0.0005230859,0.0006168181,0.0005699763,0.0006014893,0.001175736,0.0009462801,0.001670198],"category_scores_gemma":[0.001024515,0.0002474855,0.0004845451,0.0007071431,0.0004407974,0.0006418704,0.0005467302,0.0006528448,0.0002667944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004318585,"about_ca_system_score_gemma":0.0007354117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002221434,"about_ca_topic_score_gemma":0.001734969,"domain_scores_codex":[0.9998438,0.00004338013,0.00000832772,0.00002763474,0.00005794929,0.00001883304],"domain_scores_gemma":[0.9998292,0.00008406759,0.00001404206,0.00001893144,0.00004549956,0.000008208098],"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.00009969367,0.00008459497,0.0005266588,0.00016385,0.0001258999,0.0002237209,0.0001247891,0.7377781,0.009591783,0.03077632,0.005696541,0.2148081],"study_design_scores_gemma":[0.00002735436,0.00004793304,0.0001294749,0.0000125665,0.00002069229,0.0000824416,0.00001437132,0.9896513,0.001689756,0.004592515,0.003718463,0.00001319808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01733135,0.001119452,0.9722682,0.0003450268,0.0002791715,0.0000801788,0.00005336946,0.0004800403,0.008043331],"genre_scores_gemma":[0.437651,0.001287175,0.5479657,0.0003811209,0.0001592538,0.0005989459,0.0001341532,0.0001301613,0.01169249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002221434,"threshold_uncertainty_score":0.005587399,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01609915289129845,"score_gpt":0.2782613534441433,"score_spread":0.2621622005528449,"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."}}