{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003124147,0.0004447855,0.0005227263,0.0007074367,0.0003282161,0.0004326839,0.0008004294,0.0006811838,0.0007726023],"category_scores_gemma":[0.0006790907,0.000286279,0.0005382736,0.0006005109,0.0004590676,0.0005552433,0.000452268,0.0005405088,0.0001907875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003384737,"about_ca_system_score_gemma":0.0005916545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002846374,"about_ca_topic_score_gemma":0.002418854,"domain_scores_codex":[0.9997453,0.00005376479,0.00001058061,0.00004990868,0.0001173946,0.00002306668],"domain_scores_gemma":[0.9998127,0.00008157959,0.00002625316,0.00001757766,0.00005153361,0.00001050157],"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.00007268478,0.00004654124,0.0005995254,0.00007683005,0.00007271882,0.0001446188,0.0001041416,0.7797449,0.02181435,0.01401855,0.0009858862,0.1823193],"study_design_scores_gemma":[0.00001819246,0.00005689984,0.0001976149,0.000006320691,0.00001718086,0.00009008569,0.000009653062,0.992759,0.002257847,0.00271669,0.001855924,0.00001458129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009872038,0.0001748944,0.9883353,0.00004751019,0.00002315652,0.00002353081,0.000008358883,0.0002588521,0.001256468],"genre_scores_gemma":[0.3268759,0.0004394477,0.669647,0.00007678227,0.00003117199,0.000191094,0.0000596417,0.0000590514,0.002620003],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002846374,"threshold_uncertainty_score":0.00565958,"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."}}