Aseba Architecture: Thymio Robot Implementation

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

This lecture explores the programming possibilities offered by the Aseba architecture, focusing on remote control, networking, and the integration with Raspberry Pi. It also covers the implementation of these concepts on the Thymio robot.

This course is intended for anyone who wants to master the Thymio educational robot, but it is especially designed for primary and secondary school teachers who want to learn about this tool and use it in the classroom. It allows teachers to acquire the basics of computer science and robotics, by proposing adapted problem situations, and by providing pedagogical tracks for the animation in class. It responds to the new programs for the introduction of digital sciences in schools in France and Switzerland an

In mathematics, nonlinear programming (NLP) is the process of solving an optimization problem where some of the constraints or the objective function are nonlinear. An optimization problem is one of calculation of the extrema (maxima, minima or stationary points) of an objective function over a set of unknown real variables and conditional to the satisfaction of a system of equalities and inequalities, collectively termed constraints. It is the sub-field of mathematical optimization that deals with problems that are not linear.

Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints.