{"id":"W2172684101","doi":"10.2316/journal.201.2014.3.201-2583","title":"EFFICIENT, SWARM-BASED PATH FINDING IN UNKNOWN GRAPHS USING REINFORCEMENT LEARNING","year":2014,"lang":"en","type":"article","venue":"Control and Intelligent Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Reinforcement learning; Computer science; Swarm behaviour; Task (project management); Path (computing); Artificial intelligence; Soundness; Node (physics); Metaheuristic; Routing (electronic design automation); Machine learning; Ant colony optimization algorithms; Engineering; Computer network","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001829864,0.000168878,0.0003140116,0.0004128953,0.0001748068,0.0003083346,0.0003674611,0.00006445518,0.000008359817],"category_scores_gemma":[0.0003658137,0.0001465437,0.00005463596,0.000468261,0.00004587128,0.00007954341,0.0000872101,0.0002089165,0.00002138248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008509571,"about_ca_system_score_gemma":0.00005988657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001277326,"about_ca_topic_score_gemma":0.000001354168,"domain_scores_codex":[0.9977794,0.0004434127,0.0005226307,0.0004009841,0.0004469634,0.0004065739],"domain_scores_gemma":[0.9988905,0.0003385276,0.0001702268,0.0003133564,0.0001441079,0.0001433141],"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.000008403192,0.00002388208,0.001409592,0.00005396192,0.00001030388,0.000004301402,0.0001524354,0.9792608,0.0001912462,0.01582103,0.000008533664,0.003055499],"study_design_scores_gemma":[0.0007607976,0.00009960277,0.00009851258,0.0001373695,0.000005242211,0.000004661812,0.00003764206,0.9965788,0.000125919,0.00003471811,0.001956486,0.0001602276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01194722,0.000440634,0.9858976,0.00005096694,0.0004647379,0.0004593756,4.532051e-7,0.00006384122,0.000675137],"genre_scores_gemma":[0.9963397,0.00001425584,0.003271529,0.00007874866,0.00004721088,0.00002903017,0.000001956597,0.00001132913,0.0002062129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9843925,"threshold_uncertainty_score":0.5975879,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0283763983215228,"score_gpt":0.2759849638412581,"score_spread":0.2476085655197353,"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."}}