artificial intelligence-planning: using strips/adl

Action (or task) planning Consider the Crazy Frog puzzle: A little frog is located in an n xn land, with few obstacles and a lot of insects. The frog can jump in any length in four cardinal directions and cannot land on any obstacles or already visited places. The frog eats insects whenever it lands on them. The goal is to eat all insects in the land. The input corresponds to a n x n grid where F specifies the initial location of the frog, o's denote insects and 1's denote obstacles. For example, the sample input on Figure la, corresponds to the land specified in Figure 1b: 00001 10110 00001 OF000 00000 (a) Sample input (b) Sample land Formalize the domain above in STRIPS or ADL, prepare two different instances of the puzzle and use the planner FASTDOWNWARDto solve your instances. Submit the STRIPS/ADL description of the domain (i.e., operators) presented to the planner, corre- sponding planning problems of your instances, and the input and output of the planner