André Grahl Pereira

Orcid: 0000-0002-2149-8157

Affiliations:
  • Universidade Federal do Rio Grande do Sul, Brazil


According to our database1, André Grahl Pereira authored at least 24 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Goal Recognition via Linear Programming.
CoRR, 2024

Policy-Space Search: Equivalences, Improvements, and Compression.
CoRR, 2024

2023
New approaches to improve nearest neighbors (NN) search in ionospheric simulation system.
Earth Sci. Informatics, December, 2023

A Best-First Search Algorithm for FOND Planning and Heuristic Functions to Optimize Decompressed Solution Size.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
Iterative Depth-First Search for Fully Observable Non-Deterministic Planning.
CoRR, 2022

Iterative Depth-First Search for FOND Planning.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

PEA*+IDA*: An Improved Hybrid Memory-Restricted Algorithm.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
An LP-Based Approach for Goal Recognition as Planning.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Sequencing Operator Counts with State-Space Search.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019
Robust Goal Recognition with Operator-Counting Heuristics.
CoRR, 2019

Procedural Generation of Initial States of Sokoban.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Landmark-Enhanced Heuristics for Goal Recognition in Incomplete Domain Models.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
Analyzing Tie-Breaking Strategies for the A* Algorithm.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
An approximate nearest neighbors search algorithm for low-dimensional grid locations.
Earth Sci. Informatics, 2017

2016
Solving moving-blocks problems.
PhD thesis, 2016

Pull and PushPull are PSPACE-complete.
Theor. Comput. Sci., 2016

Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Improved Airport Ground Traffic Control with Domain-Dependent Heuristics.
Proceedings of the 5th Brazilian Conference on Intelligent Systems, 2016

2015
Optimal Sokoban solving using pattern databases with specific domain knowledge.
Artif. Intell., 2015

Solving Sokoban Optimally with Domain-Dependent Move Pruning.
Proceedings of the 2015 Brazilian Conference on Intelligent Systems, 2015

2013
Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

2012
Data assimilation using NeuroEvolution of Augmenting Topologies.
Proceedings of the 2012 International Joint Conference on Neural Networks (IJCNN), 2012

2010
HVet: a hypervideo environment to support veterinary surgery learning.
Proceedings of the HT'10, 2010

Design and evaluation of a hypervideo environment to support veterinary surgery learning.
Proceedings of the HT'10, 2010


  Loading...