AAAI Publications, Thirty-Second AAAI Conference on Artificial Intelligence

Font Size: 
Meta-Search Through the Space of Representations and Heuristics on a Problem by Problem Basis
Raquel Fuentetaja, Michael Barley, Daniel Borrajo, Jordan Douglas, Santiago Franco, Patricia Riddle

Last modified: 2018-04-26


Two key aspects of problem solving are representation and search heuristics. Both theoretical and experimental studies have shown that there is no one best problem representation nor one best search heuristic. Therefore, some recent methods, e.g., portfolios, learn a good combination of problem solvers to be used in a given domain or set of domains. There are even dynamic portfolios that select a particular combination of problem solvers specific to a problem. These approaches: (1) need to perform a learning step; (2) do not usually focus on changing the representation of the input domain/problem; and (3) frequently do not adapt the portfolio to the specific problem. This paper describes a meta-reasoning system that searches through the space of combinations of representations and heuristics to find one suitable for optimally solving the specific problem. We show that this approach can be better than selecting a combination to use for all problems within a domain and is competitive with state of the art optimal planners.


online meta-search; representation change

Full Text: PDF