2026-09-19T12:43:23Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1432882022-06-16T03:01:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

How, Jonathan P. Huang, Vivian Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2022-06-15T13:09:59Z 2022-06-15T13:09:59Z 2022-02 2022-02-22T18:32:30.252Z https://hdl.handle.net/1721.1/143288 Deep reinforcement learning (RL) methods have made significant advancements over recent years toward mastering challenging problems. Because many real-world systems involve multiple agents interacting with each other in a shared environment, one particularly active subfield of RL is multi-agent reinforcement learning (MARL). Learning robust multi-agent policies in real-time strategy games, such as StarCraft II, is an important objective. In particular, being able to quickly adapt game playing agents to perturbations in rules and successfully displaying the ability to take advantage of such changes can yield insights about properties, such as game balance. However, progress in MARL research faces a major challenge associated with the high cost of sample complexity, which makes learning a complicated task from scratch computationally intensive. Therefore, this thesis work details the design and implementation of a MARL framework that facilitates the training of robust agents which are adaptive to perturbations in a multi-agent, StarCraft II-based real-time strategy game such that the features that most affect game balance can be determined. The framework also includes an incremental warm-start approach to improve the computational complexity of agent adaptation. The results show that our approach achieves up to 97% improvement in computational time compared to the standard approach of training the policy with a random initialization. M.Eng. Massachusetts Institute of Technology In Copyright - Educational Use Permitted Copyright MIT http://rightsstatements.org/page/InC-EDU/1.0/ Warm-Starting Networks for Sample-Efficient Continuous Adaptation to Parameter Perturbations in Multi-Agent Reinforcement Learning Thesis application/pdf Master Master of Engineering in Electrical Engineering and Computer Science Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="fa8b2eed-02e3-4d52-ba8e-36bb8c9641c9"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Title>Warm-Starting Networks for Sample-Efficient Continuous Adaptation to Parameter Perturbations in Multi-Agent Reinforcement Learning</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2022-02</PublicationDate> <Authors> <Author> <DisplayName>Huang, Vivian</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://rightsstatements.org/page/InC-EDU/1.0/</License> <Abstract>Deep reinforcement learning (RL) methods have made significant advancements over recent years toward mastering challenging problems. Because many real-world systems involve multiple agents interacting with each other in a shared environment, one particularly active subfield of RL is multi-agent reinforcement learning (MARL). Learning robust multi-agent policies in real-time strategy games, such as StarCraft II, is an important objective. In particular, being able to quickly adapt game playing agents to perturbations in rules and successfully displaying the ability to take advantage of such changes can yield insights about properties, such as game balance. However, progress in MARL research faces a major challenge associated with the high cost of sample complexity, which makes learning a complicated task from scratch computationally intensive. Therefore, this thesis work details the design and implementation of a MARL framework that facilitates the training of robust agents which are adaptive to perturbations in a multi-agent, StarCraft II-based real-time strategy game such that the features that most affect game balance can be determined. The framework also includes an incremental warm-start approach to improve the computational complexity of agent adaptation. The results show that our approach achieves up to 97% improvement in computational time compared to the standard approach of training the policy with a random initialization.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>