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...
| Published in: | IEEE Access |
|---|---|
| Main Authors: | , , , |
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10373859/ |