{"id":"W1981105365","doi":"10.1109/itst.2006.288799","title":"A Specific Genetic Algorithm for Optimum Path Planning in Intelligent Transportation System","year":2006,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Crossover; Genetic algorithm; Path (computing); Motion planning; Encoding (memory); Computer science; Mathematical optimization; Shortest path problem; Mutation; Algorithm; Artificial intelligence; Mathematics; Theoretical computer science; Machine learning; Computer network","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.000268386,0.0001733465,0.0002154143,0.0001952705,0.00006725328,0.0001075305,0.000462124,0.00007624594,0.000002262967],"category_scores_gemma":[0.00000264912,0.000166369,0.00006660401,0.0003547356,0.00001615884,0.0001818394,0.00001510058,0.00009284628,0.00002175826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001251709,"about_ca_system_score_gemma":0.00004019837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000131417,"about_ca_topic_score_gemma":0.000001961049,"domain_scores_codex":[0.9983743,0.00003357929,0.000480408,0.0004745382,0.0002487448,0.000388459],"domain_scores_gemma":[0.9993669,0.00009958056,0.00009668725,0.0003193883,0.00005665883,0.00006073785],"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.00001072239,0.0002076584,0.003891914,0.0001242599,0.00001924637,0.0006095339,0.001914082,0.7526063,0.0003321728,0.01776662,0.002663518,0.219854],"study_design_scores_gemma":[0.0003983181,0.00007498718,0.01560414,0.000112214,0.000003576643,0.00002288074,0.0001442932,0.9818363,0.0006714083,0.0003748229,0.00053784,0.0002192133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002681854,0.0003514795,0.9950287,0.00004544774,0.000503083,0.0004490909,0.000009065282,0.0002760779,0.0006552248],"genre_scores_gemma":[0.08072604,0.000002917638,0.9188407,0.00002283691,0.0001307726,0.00007737397,0.00002712136,0.00001486264,0.0001573471],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2292301,"threshold_uncertainty_score":0.6784332,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02045879336089985,"score_gpt":0.2429915057270723,"score_spread":0.2225327123661725,"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."}}