roadmap The slide you’ve provided discusses the concept of a "roadmap" in the context of combinatorial motion planning. Here’s an explanation of the key elements: Topological Graph G: A graph $G$ is considered, where: Vertices represent different configurations $q$ that belong to a free configuration space, denoted as $C_{free}$. Edges represent paths $\Pi$ that connect … 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
