{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004496977,0.0006064848,0.0006819834,0.0006538371,0.0005002817,0.0005395089,0.0008742644,0.001069639,0.001047699],"category_scores_gemma":[0.001021023,0.0002888776,0.0007403726,0.00100472,0.0005425867,0.0009199853,0.0004951207,0.0008699624,0.0002910863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005734423,"about_ca_system_score_gemma":0.001030058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003560059,"about_ca_topic_score_gemma":0.003083012,"domain_scores_codex":[0.9996488,0.00009956555,0.00001955412,0.00006573334,0.0001380639,0.00002823914],"domain_scores_gemma":[0.9998337,0.00006088914,0.00001910843,0.00002041769,0.00005747357,0.000008437764],"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.00003033751,0.00002984029,0.0005631208,0.0001479467,0.00007513491,0.000118338,0.00009723115,0.7409843,0.007564633,0.04496213,0.002678824,0.2027482],"study_design_scores_gemma":[0.00001699934,0.0000548418,0.0002271222,0.00001995481,0.00003423413,0.0001653196,0.00001491097,0.9795966,0.002149459,0.01032411,0.007377108,0.00001943768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002852037,0.0002172119,0.9954214,0.00005578947,0.00003064772,0.00002890047,0.00001323741,0.0001842585,0.001196447],"genre_scores_gemma":[0.1551036,0.0009396395,0.8402605,0.0001195456,0.00005398682,0.0002401096,0.0001722318,0.00009127292,0.003019117],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003560059,"threshold_uncertainty_score":0.007078707,"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."}}