Navegação Computação por Autor "Pereira, André Grahl"

Resultados 1-3 de 3

    • Sequencing operator counts with state-space search 

      Kaizer, Wesley Luciano (2020) [Dissertação]
      A search algorithm with an admissible heuristic function is the most common approach to optimally solve classical planning tasks. Recently DAVIES et al. (2015) introduced the solver OpSeq using Logic-Based Benders ...

    • Solving moving-blocks problems 

      Pereira, André Grahl (2016) [Tese]
      In this thesis, we study the class of moving-blocks problems. A moving-blocks problem consists of k movable blocks placed on a grid-square maze where there is an additional movable block called the man, which is the only ...

    • Understanding sample generation strategies for learning heuristic functions in classical planning 

      Bettker, Rafael Valesx (2023) [Dissertação]
      Heuristic functions are essential in guiding search algorithms to solve planning tasks. We study the problem of learning good heuristic functions for classical planning tasks with neural networks based on samples that are ...