Lesson Notes By Weeks and Term v4 - SHS 2
Robot Control Principles
Download the Lessonotes Mobile Ghana app for faster lesson access on Android and iPhone.
Robot Control Principles
Download the Lessonotes Mobile Ghana app for faster lesson access on Android and iPhone.
Subject: Robotics
Class: SHS 2
Term: 1st Term
Week: 16
Grade code: 2.1.2.LI.2
Strand code: 1
Sub-strand code: 2
Content standard code: 2.1.2.CS.2
Indicator code: 2.1.2.LI.2
Theme: Principles of Robotic Systems
Subtheme: Robot Control Principles
This page supports the lesson note with a companion video and a short classroom-ready summary.
For class groups and homework, share this lesson page so learners also get the summary, objectives, and full lesson context.
Welcome, future engineers and innovators! Today, we are exploring one of the most fundamental ideas in robotics: how a robot "thinks" and makes decisions. A robot without a clear set of rules is just a collection of parts – it cannot perform any useful task. We will learn about a powerful tool called a Finite-State Machine (FSM), which is like a simple brain or a set of instructions we give to a robot to make it behave predictably and logically. In Ghana, from the traffic lights that control cars in Accra to the USSD menu we use for mobile money (*170#), we interact with systems that use these same principles every single day.
What is a Logical Model for Robot Control?
Imagine you are giving instructions to a friend on how to operate a simple water pump (a "polytank" pump). You wouldn't just say "pump water." You would give specific, step-by-step instructions based on different conditions: "IF the polytank is empty, THEN turn the pump ON." "IF the polytank is full, THEN turn the pump OFF." "IF there is no power ('dumsor'), THEN do nothing."
These "IF-THEN" rules create a logical model. The robot isn't truly "thinking"; it's just following a set of rules we have carefully designed. The most common and powerful way to design these rules is using a Finite-State Machine. The Finite-State Machine (FSM)
A Finite-State Machine is a model of behaviour that describes a system which can be in only one of a limited (finite) number of conditions or states at any given time. The machine changes from one state to another in response to external inputs or events. This change is called a transition. When a machine enters a state or makes a transition, it can perform an action or produce an output.