{"id":"W3146613331","doi":"10.1109/his.2006.264936","title":"Optimum Path Planning for Mobile Robots Based on a Hybrid Genetic Algorithm","year":2006,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Crossover; Motion planning; Genetic algorithm; Mobile robot; Computer science; Robot; Path (computing); Algorithm; Mutation; Hybrid algorithm (constraint satisfaction); Mathematical optimization; Artificial intelligence; Mathematics; Machine learning","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.0002741048,0.0002695868,0.0002591247,0.0001806493,0.0001920712,0.000202665,0.0008199288,0.00006658473,0.00001090008],"category_scores_gemma":[0.00002269779,0.0002453494,0.0001183997,0.0002528365,0.0000317091,0.0001715121,0.0000927136,0.000132482,0.00006284757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007029121,"about_ca_system_score_gemma":0.0001045193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004269135,"about_ca_topic_score_gemma":9.411473e-8,"domain_scores_codex":[0.9979025,0.00005021699,0.000335722,0.0006959705,0.000404931,0.0006106807],"domain_scores_gemma":[0.9986334,0.0003155742,0.0001109461,0.0007275488,0.00008725735,0.0001252893],"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.000004583849,0.0001242701,0.0001747363,0.000009953498,0.000006209405,0.0001268539,0.00003074514,0.9336976,0.0000606378,0.0001869447,0.009069926,0.05650755],"study_design_scores_gemma":[0.0007609508,0.0004616834,0.001779582,0.00004896478,0.000007113023,0.00003395095,0.000006518313,0.9931528,0.001486165,0.0007388791,0.00118879,0.000334579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009404703,0.0001017733,0.9953134,0.0001532341,0.0005277927,0.0005789913,0.00001640251,0.0005157291,0.001852216],"genre_scores_gemma":[0.02509521,4.897266e-7,0.9731116,0.000535861,0.0002414736,0.0002353716,0.00002790817,0.00002849689,0.0007236099],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05945523,"threshold_uncertainty_score":0.9999999,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01301292753611942,"score_gpt":0.2493717232440083,"score_spread":0.2363587957078889,"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."}}