{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008845166,0.0005918965,0.0007883364,0.0004534684,0.0004021218,0.0006242837,0.001426396,0.0008171043,0.001033287],"category_scores_gemma":[0.003078369,0.0003508906,0.0004814535,0.0003767819,0.001036599,0.0009407811,0.001020982,0.0007630755,0.0001523453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009185444,"about_ca_system_score_gemma":0.001045228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005762907,"about_ca_topic_score_gemma":0.004699179,"domain_scores_codex":[0.9996586,0.0001249961,0.0000176225,0.00007522301,0.00007259026,0.00005093908],"domain_scores_gemma":[0.9984724,0.001029386,0.0001967578,0.0001014157,0.0001267185,0.00007323261],"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.0000204418,0.00002185863,0.0002751796,0.00001841773,0.0000140694,0.00002771014,0.00003014733,0.9837853,0.0005830223,0.003265239,0.0001668455,0.01179178],"study_design_scores_gemma":[0.000005943502,0.0000124594,0.00002750744,0.000001603139,0.000001839705,0.000004006457,0.000004392284,0.9981085,0.0001071321,0.001640109,0.00008505643,0.00000137304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04340683,0.0001333758,0.9540887,0.0001493897,0.00002184413,0.00004743258,0.00002163477,0.0002860376,0.001844735],"genre_scores_gemma":[0.8448194,0.0001238275,0.1531209,0.00006251397,0.00002180522,0.000126239,0.00006164594,0.00004533373,0.001618254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005762907,"threshold_uncertainty_score":0.01145869,"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."}}