Mapping with robots

Abstract Physics is typically introduced to students through kinematics. In general, students learn to solve simple examples, for example, how to find the time of a journey from one position to another one. With the popularization of computer science, it is important to present problems which can be analyzed playfully on the computer. With this objective, through simulations, we study different strategies for the kinematics of a robot that must map a room. The efficiencies of the different strategies were compared by calculating some quantities from the trajectories, such as Convex Hull and Entropy. Comparing these quantities, it is possible to discuss the mapping performed by each one of them.