Search NASA⌕ Search

NASA NTRS · 20010071976

Reinforcement Learning in Distributed Domains: Beyond Team Games

Abstract

Distributed search algorithms are crucial in dealing with large optimization problems, particularly when a centralized approach is not only impractical but infeasible. Many machine learning concepts have been applied to search algorithms in order to improve their effectiveness. In this article we present an algorithm that blends Reinforcement Learning (RL) and hill climbing directly, by using the RL signal to guide the exploration step of a hill climbing algorithm. We apply this algorithm to the domain of a constellations of communication satellites where the goal is to minimize the loss of importance weighted data. We introduce the concept of 'ghost' traffic, where correctly setting this traffic induces the satellites to act to optimize the world utility. Our results indicated that the bi-utility search introduced in this paper outperforms both traditional hill climbing algorithms and distributed RL approaches such as team games.

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wolpert, David H., Sill, Joseph, Turner, Kagan. 2000-01-09. Reinforcement Learning in Distributed Domains: Beyond Team Games. https://ntrs.nasa.gov/citations/20010071976

Cite the original work for its findings. Save a collection to share your selection of sources.