• Graph-based search algorithms:

    • Dijkstra’s algorithm for shortest path finding

    • A* search algorithm for informed pathfinding

  • Sampling-based algorithms:

    • Probabilistic Roadmaps (PRM) for complex environment exploration

  • Grid-based search techniques:

    • D* and D* Lite algorithms for dynamic path planning

  • Practical exercises in implementing path planning algorithms using C++ or Python