Open AccessDomain-Dependent Heuristics and Tie-Breakers: Topics in Automated Planning
Author(s) -
Augusto B. Corrêa,
André Grahl Pereira,
Marcus Ritt
Publication year - 2018
Publication title -
revista eletrônica de iniciação científica
Language(s) - English
Resource type - Journals
ISSN - 1519-8219
DOI - 10.5753/reic.2018.1057
Subject(s) - heuristics , computer science , domain (mathematical analysis) , set (abstract data type) , automated planning and scheduling , sequence (biology) , artificial intelligence , state (computer science) , theoretical computer science , algorithm , mathematics , mathematical analysis , biology , genetics , programming language , operating system
Automated planning is an important general problem solving technique in Artificial Intelligence. Given an initial state, a goal and a set of operators, we want to find a sequence of operators leading us to the goal. What makes planning interesting is that it can model different domains into planning tasks and solve them using a single method. In this work, we approach two different topics in planning. First, we study heuristics for the airport ground traffic problem and propose new heuristics that are better than any other known method. In the second part, we study tie-breakers for the A* search algorithm. We propose a new tie-breaking method that is proved to be the best possible and also show that our methods solve more instances than previous methods in literature