Generally Applicable Q-Table Compression Method and Its Application for Constrained Stochastic Graph Traversal Optimization Problems

Generally Applicable Q-Table Compression Method and Its Application for Constrained Stochastic Graph Traversal Optimization Problems

We analyzed a special class of graph traversal problems, where the distances are stochastic, and the agent is restricted to take a limited range in one go. We showed that both constrained shortest Hamiltonian pathfinding problems and disassembly line balancing problems belong to the class of constra...

Full description

Bibliographic Details
Main Authors: Tamás Kegyes, Alex Kummer, Zoltán Süle, János Abonyi
Format: Article
Language:English
Published: MDPI AG 2024-03-01
Series:Information
Subjects:
constrainedshortest path
constrained shortest Hamiltonian path
disassembly line balancing optimization
stochastic shortest path
stochastic graph-based routing
reinforcement learning
Online Access:https://www.mdpi.com/2078-2489/15/4/193

Internet

https://www.mdpi.com/2078-2489/15/4/193

Similar Items