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...

Descripció completa

Dades bibliogràfiques

Autors principals:	Tamás Kegyes, Alex Kummer, Zoltán Süle, János Abonyi
Format:	Artigo
Idioma:	Inglês
Publicat:	MDPI AG 2024-03-01
Col·lecció:	Information
Matèries:	constrainedshortest path constrained shortest Hamiltonian path disassembly line balancing optimization stochastic shortest path stochastic graph-based routing reinforcement learning
Accés en línia:	https://www.mdpi.com/2078-2489/15/4/193
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!