Time complexity is a way to describe how the running time of an algorithm changes relative to the size of its input. In other words, it answers the question: “If I make the input bigger, how much longer will this algorithm take to run?” Key Points: Input size is usually denoted as n. Time complexity … Read more
pooling server This image explains a Polling Server scheduling policy used in real-time systems, specifically in the context of fixed-priority scheduling. 1. Server Task Release: The server task $\tau_s$ is released periodically with a period $T_s$. This means the server is ready to perform work at regular intervals. 2. Handling Aperiodic Events: When the server … Read more
Overview of the Slide The slide starts by stating that, implementation-wise, most models for local collision avoidance can be classified into three categories. These methods are different ways a robot can process sensor data and decide how to move to avoid obstacles while heading toward a goal. Let’s dive into each one. 1. Force-Based (Related … Read more