Given :

Example 1 : An example of application - Soccer-Playing Robot.

The finite automata of the Soccer-Playing Robot Controller

Example 2:These Formal definitions

Design your own simple application @ small robot with AT LEAST 6 states & 10 transition functions as given in the example.

The Global Map doesn't know where the ball is Walking To Unseen Ball The robot has turmedl at least 360 without seeing the ball, and the Global Map knows where the ball is Head Scan For Ball Turning For Ball Enough time has clapsed without finding the ball become true Ball is seen Walking To Seen Ball Ball kicked to side or backwards Near ball is true and Chin Pinch is executed Ball was kicked forwards Determine And Set Kick says Chin Pinch Turn is not necessary Chin Pinch Turn Recover From Kick Robot is facing Kicking desimed direction Kiekis finished Suppose: - All items cost 400 - Coins accepted are 50, 100, 200 - Recall, formal definition of M = (Q, 2, 8, 9, F) - What are these entities? Q is a set of states What are the possible states? is the alphabet What are the input symbols? - 8 are the transitions How do we move from state to state? q, is the starting state Where does the machine start from? - F is the final state When does the machine stop? . Q: What are the possible states? - The status of the machine before and after any of the alphabet symbols have been applied The present state represents how much money has been deposited Could also represent how much is left to deposit 2: What are the input symbols? - The coin denominations 8: How do we move from state to state? - Transition when a coin is deposited 90: Where does the machine start from? - The beginning! Fis the final state - When does the machine stop? Not before you have deposited enough money What if you put in more than 40c? . 5 10 20 95 910920 Q = {90, ---, 920} The status of the machine before and after any of the alphabet symbols have been applied The present state represents how much money has been deposited Could also represent how much is left to deposit \ = {5, 10, 20} 40 8: How do we move from state to state? as - Transition when a coin is deposited 910 9. Where does the machine start from? 915 - The beginning! 920 F is the final state - When does the machine stop? 425 Not before you have deposited enough money 930 What if you put in more than 40c? 935 410915925 915 420 430 420 425 435 425 430 440 430 435 440 435 440 440 440 440 440 940 440 440 440 The Global Map doesn't know where the ball is Walking To Unseen Ball The robot has turmedl at least 360 without seeing the ball, and the Global Map knows where the ball is Head Scan For Ball Turning For Ball Enough time has clapsed without finding the ball become true Ball is seen Walking To Seen Ball Ball kicked to side or backwards Near ball is true and Chin Pinch is executed Ball was kicked forwards Determine And Set Kick says Chin Pinch Turn is not necessary Chin Pinch Turn Recover From Kick Robot is facing Kicking desimed direction Kiekis finished Suppose: - All items cost 400 - Coins accepted are 50, 100, 200 - Recall, formal definition of M = (Q, 2, 8, 9, F) - What are these entities? Q is a set of states What are the possible states? is the alphabet What are the input symbols? - 8 are the transitions How do we move from state to state? q, is the starting state Where does the machine start from? - F is the final state When does the machine stop? . Q: What are the possible states? - The status of the machine before and after any of the alphabet symbols have been applied The present state represents how much money has been deposited Could also represent how much is left to deposit 2: What are the input symbols? - The coin denominations 8: How do we move from state to state? - Transition when a coin is deposited 90: Where does the machine start from? - The beginning! Fis the final state - When does the machine stop? Not before you have deposited enough money What if you put in more than 40c? . 5 10 20 95 910920 Q = {90, ---, 920} The status of the machine before and after any of the alphabet symbols have been applied The present state represents how much money has been deposited Could also represent how much is left to deposit \ = {5, 10, 20} 40 8: How do we move from state to state? as - Transition when a coin is deposited 910 9. Where does the machine start from? 915 - The beginning! 920 F is the final state - When does the machine stop? 425 Not before you have deposited enough money 930 What if you put in more than 40c? 935 410915925 915 420 430 420 425 435 425 430 440 430 435 440 435 440 440 440 440 440 940 440 440 440