|title:||Using Heuristic Search to Solve Planning Problems in GROOVE|
|keywords:||Planning, graph transitions, GROOVE, heuristic search, A* algorithm|
Planning is a part of artificial intelligence that concerns strategies for solving difficult problems that have no clear algorithmic path to a desired goal. For computer models that generate a big search space it is often difficult to find a path to a specific state because of all the different options given. Planning can help here by handing the strategies to find a path easier and faster. GROOVE is a graph transformation tool which can be used to model problems and then generate the search space for these problems. However, GROOVE currently does not support the func- tionality of a planning algorithm. In this research we will investigate the impact of a famous state space exploration algorithm on certain problems in GROOVE.