.png){kind=icon}
.png){kind=icon}
Return
Dynamic distributed constraint optimization using multi-agent reinforcement learning
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-022-06820-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An inherent difficulty in dynamic distributed constraint optimization problems (dynamic DCOP) is the uncertainty of future events when making an assignment at the current time. This dependency is not well addressed in the research community. This paper proposes a reinforcement-learning-based solver for dynamic distributed constraint optimization. We show that reinforcement learning techniques are an alternative approach to solve the given problem over time and are computationally more efficient than sequential DCOP solvers. We also use the novel heuristic to obtain the correct results and describe a formalism that has been adopted to model dynamic DCOPs with cooperative agents. We evaluate this approach in dynamic weapon target assignment (dynamic WTA) problem, via experimental results. We observe that the system dynamic WTA problem remains a safe zone after convergence while satisfying the constraints. Moreover, in the experiment we have implemented the agents that finally converge to the correct assignment.
Keywords:
Dynamic distributed constraint optimization problem
Reinforcement learning
Multi-agent systems
Weapon target assignment
Markov decision process
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W