4,518 research outputs found
Solving DCOPs with Distributed Large Neighborhood Search
The field of Distributed Constraint Optimization has gained momentum in
recent years, thanks to its ability to address various applications related to
multi-agent cooperation. Nevertheless, solving Distributed Constraint
Optimization Problems (DCOPs) optimally is NP-hard. Therefore, in large-scale,
complex applications, incomplete DCOP algorithms are necessary. Current
incomplete DCOP algorithms suffer of one or more of the following limitations:
they (a) find local minima without providing quality guarantees; (b) provide
loose quality assessment; or (c) are unable to benefit from the structure of
the problem, such as domain-dependent knowledge and hard constraints.
Therefore, capitalizing on strategies from the centralized constraint solving
community, we propose a Distributed Large Neighborhood Search (D-LNS) framework
to solve DCOPs. The proposed framework (with its novel repair phase) provides
guarantees on solution quality, refining upper and lower bounds during the
iterative process, and can exploit domain-dependent structures. Our
experimental results show that D-LNS outperforms other incomplete DCOP
algorithms on both structured and unstructured problem instances
CoLight: Learning Network-level Cooperation for Traffic Signal Control
Cooperation among the traffic signals enables vehicles to move through
intersections more quickly. Conventional transportation approaches implement
cooperation by pre-calculating the offsets between two intersections. Such
pre-calculated offsets are not suitable for dynamic traffic environments. To
enable cooperation of traffic signals, in this paper, we propose a model,
CoLight, which uses graph attentional networks to facilitate communication.
Specifically, for a target intersection in a network, CoLight can not only
incorporate the temporal and spatial influences of neighboring intersections to
the target intersection, but also build up index-free modeling of neighboring
intersections. To the best of our knowledge, we are the first to use graph
attentional networks in the setting of reinforcement learning for traffic
signal control and to conduct experiments on the large-scale road network with
hundreds of traffic signals. In experiments, we demonstrate that by learning
the communication, the proposed model can achieve superior performance against
the state-of-the-art methods.Comment: 10 pages. Proceedings of the 28th ACM International on Conference on
Information and Knowledge Management. ACM, 201
Optimizing Memory-Bounded Controllers for Decentralized POMDPs
We present a memory-bounded optimization approach for solving
infinite-horizon decentralized POMDPs. Policies for each agent are represented
by stochastic finite state controllers. We formulate the problem of optimizing
these policies as a nonlinear program, leveraging powerful existing nonlinear
optimization techniques for solving the problem. While existing solvers only
guarantee locally optimal solutions, we show that our formulation produces
higher quality controllers than the state-of-the-art approach. We also
incorporate a shared source of randomness in the form of a correlation device
to further increase solution quality with only a limited increase in space and
time. Our experimental results show that nonlinear optimization can be used to
provide high quality, concise solutions to decentralized decision problems
under uncertainty.Comment: Appears in Proceedings of the Twenty-Third Conference on Uncertainty
in Artificial Intelligence (UAI2007
- …