K-Focal Search for Slow Learned Heuristics
Bounded suboptimal heuristic search is a family of search algorithms capable of solving hard combinatorial problems, returning suboptimal solutions within a given bound. Recent machine learning approaches have been shown to learn accurate heuristic functions. Learned heuristics, however, are slow to...
Gardado en:
| Principais autores: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
IEEE
2024-01-01
|
| Series: | IEEE Access |
| Assuntos: | |
| Acceso en liña: | https://ieeexplore.ieee.org/document/10373859/ |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|