{"id":"W3193202621","doi":"10.1109/iwcmc51323.2021.9498671","title":"A Graph Attention Mechanism Based Multi-Agent Reinforcement Learning Method for Efficient Traffic Light Control","year":2021,"lang":"en","type":"article","venue":"","topic":"Traffic control and management","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Traffic signal; Graph; Mechanism (biology); Control (management); Distributed computing; Multi-agent system; Artificial intelligence; Real-time computing; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":true,"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.0005860062,0.0006162749,0.0008687861,0.0003355577,0.0004009255,0.000497516,0.001182907,0.0007754823,0.001591012],"category_scores_gemma":[0.001121984,0.0002670988,0.0004301042,0.000278129,0.0005141478,0.0006273288,0.0007667307,0.0008294184,0.0001825411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006082669,"about_ca_system_score_gemma":0.0009807401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006692287,"about_ca_topic_score_gemma":0.004797603,"domain_scores_codex":[0.9997268,0.00007255258,0.0000123009,0.00006995362,0.00006965851,0.00004881859],"domain_scores_gemma":[0.9996388,0.0001504531,0.00005101546,0.00002004784,0.0001029239,0.00003667172],"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.00006195329,0.00006843499,0.0006450684,0.00006310861,0.00004888324,0.0001032642,0.00008078122,0.9208401,0.003695324,0.01042887,0.001583138,0.0623811],"study_design_scores_gemma":[0.000008168482,0.0000142495,0.00004092437,0.000001586772,0.000004359138,0.000006634333,0.000002302763,0.9988569,0.0001564993,0.0007474754,0.0001584321,0.000002485487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01726813,0.0002413859,0.9793887,0.0002004768,0.00005254672,0.00003707999,0.00001340054,0.0003052729,0.002493031],"genre_scores_gemma":[0.9235979,0.0001735783,0.07263531,0.000161811,0.00004125129,0.00011451,0.00003748865,0.0000391017,0.003198944],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006692287,"threshold_uncertainty_score":0.01330668,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009919236177198176,"score_gpt":0.2250955043129129,"score_spread":0.2151762681357147,"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."}}