Reinforcement Learning Framework for Combinatorial Optimization Problem Application to Dynamic Weapon Target Assignment
Spremljeno u:
| Izdano u: | ProQuest Dissertations and Theses (2024) |
|---|---|
| Glavni autor: | |
| Izdano: |
ProQuest Dissertations & Theses
|
| Teme: | |
| Online pristup: | Citation/Abstract Full Text - PDF |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3074791019 | ||
| 003 | UK-CbPIL | ||
| 020 | |a 9798383191583 | ||
| 035 | |a 3074791019 | ||
| 045 | 2 | |b d20240101 |b d20241231 | |
| 084 | |a 66569 |2 nlm | ||
| 100 | 1 | |a Yoon, Chaehwan | |
| 245 | 1 | |a Reinforcement Learning Framework for Combinatorial Optimization Problem Application to Dynamic Weapon Target Assignment | |
| 260 | |b ProQuest Dissertations & Theses |c 2024 | ||
| 513 | |a Dissertation/Thesis | ||
| 520 | 3 | |a This research presents a Reinforcement Learning (RL) framework for the Dynamic Weapon Target Assignment (DWTA) problem, a combinatorial optimization problem with military applications. The DWTA is an extension of the static Weapon Target Assignment problem (WTA), incorporating time-dependent elements to model the dynamic nature of warfare. Traditional approaches to WTA include simplification, exact algorithms, and heuristic methods. These methods face scalability and computational complexity challenges. This research introduces a mathematical model for DWTA that incorporates time stages, allowing for strategic planning over multiple time stages. The model is formulated as a nonlinear integer programming problem with constraints ensuring the feasibility of weapon assignments over time. To tackle the computational challenges of large-scale DWTA, the paper employs Deep Reinforcement Learning (DRL) algorithms, specifically Deep Q-Network (DQN) and Actor-Critic (AC), to learn efficient policies for weapon assignment. The proposed RL framework is evaluated on various problem instances, demonstrating its ability to provide viable solutions with reasonable inference time, making it suitable for time-efficient applications. The results show that the RL approach outperforms the exact algorithm using constraint programming, especially as the problem size increases, highlighting its potential for practical implementation in DWTA problems. | |
| 653 | |a Computer science | ||
| 653 | |a Industrial engineering | ||
| 653 | |a Applied mathematics | ||
| 653 | |a Operations research | ||
| 773 | 0 | |t ProQuest Dissertations and Theses |g (2024) | |
| 786 | 0 | |d ProQuest |t ProQuest Dissertations & Theses Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3074791019/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3074791019/fulltextPDF/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |