Planning Algorithms in AI and Robotics. MSc course at Skoltech Data Science program

Overview

Planning Algorithms in AI and Robotics course T2 2021-22

The Planning Algorithms in AI and Robotics course at Skoltech, MS in Data Science, during T2, 2021-2022. About us: we are the Mobile robotics Lab. at Skoltech

This repository includes all material used during the course: Class notes, unedited videos of the lectures and problem sets.

  • Instructor: Gonzalo Ferrer
  • Teaching Assistant: Aleksandr Gamaiunov
  • Teaching Assistant: Timur Akhtyamov

Lectures at the YouTube channel

Problem Sets

Deadline dates for submitting problem sets, in the folder PS*:

  • PS1: Discrete planning (14-November-2021)
  • PS2: Sampling-based planning (21-November-2021)
  • PS3: Value Iteration (28-November-2021)
  • PS4: Decision Making (5-December-2021)

Final Course Project

The final project could be either of the following, where in each case the topic should be closely related to the course:

  • An algorithmic or theoretical contribution that extends the current state-of-the-art.
  • An implementation of a state-of-the-art algorithm. Ideally, the project covers interesting new ground and might be the basis for a future conference paper submission or product.

You are encouraged to come up with your own project ideas, yet make sure to pass them by Prof. Ferrer before you submit your abstract

  • Ideally 3-5 students per project (the scope of multi-body projects must be commensurate).
  • Proposal: 1 page description of project + goals for milestone. This document describes the initial proposal and viability of the project.
  • Presentations: The presentation needs to be 12 minutes long; There will be a maximum of 3 minutes for questions after the presentation.If your presentation lasts more than 12 minutes, it will be stopped. So please make sure the presentation does not go over.
  • Paper: This should be a IEEE conference style paper, i.e., focus on the problem setting, why it matters and what is interesting/novel about it, your approach, your results, analysis of results, limitations, future directions.Cite and briefly survey prior work as appropriate but do not re-write prior work when not directly relevant to understand your approach.
  • Evaluation: Each team will evaluate their colleagues’ presentations.Templates will be provided the presentation day. All these points will be summed for a final evaluation (30% of the total grade).

Reference

@Misc{ferrer2021,
  author = {Gonzalo Ferrer},
  title = {Lectures on Planning Algorithms in AI and Robotics},
  howpublished = {\url{https://github.com/MobileRoboticsSkoltech/Planning-Algorithms-T2-2021-22}},
  year = {2021}
}
You might also like...
An implementation of ordered dithering algorithm in python as multimedia course project
An implementation of ordered dithering algorithm in python as multimedia course project

One way of minimizing the size of an image is to simply reduce the number of bits you use to represent each pixel.

Solving a card game with three search algorithms: BFS, IDS, and A*

Search Algorithms Overview In this project, we want to solve a card game with three search algorithms. In this card game, we have to sort our cards by

My dynamic programming algorithms for exercise and fun

My Dynamic Programming Algorithms giraycoskun [email protected] It is a repo for various dynamic programming algorithms for exercise.

CLI Eight Puzzle mini-game featuring BFS, DFS, Greedy and A* searches as solver algorithms.
CLI Eight Puzzle mini-game featuring BFS, DFS, Greedy and A* searches as solver algorithms.

🕹 Eight Puzzle CLI Jogo do quebra-cabeças de 8 peças em linha de comando desenvolvido para a disciplina de Inteligência Artificial. Escrito em python

Algorithms and utilities for SAR sensors

WARNING: THIS CODE IS NOT READY FOR USE Sarsen Algorithms and utilities for SAR sensors Objectives Be faster and simpler than ESA SNAP and cloud nativ

Distributed algorithms, reimplemented for fun and practice

Distributed Algorithms Playground for reimplementing and experimenting with algorithms for distributed computing. Usage Running the code for Ring-AllR

Classic algorithms including Fizz Buzz, Bubble Sort, the Fibonacci Sequence, a Sudoku solver, and more.
Classic algorithms including Fizz Buzz, Bubble Sort, the Fibonacci Sequence, a Sudoku solver, and more.

Algorithms Classic algorithms including Fizz Buzz, Bubble Sort, the Fibonacci Sequence, a Sudoku solver, and more. Algorithm Complexity Time and Space

Sorting-Algorithms - All information about sorting algorithm you need and you can visualize the code tracer

Sorting-Algorithms - All information about sorting algorithm you need and you can visualize the code tracer

BCI datasets and algorithms
BCI datasets and algorithms

Brainda Welcome! First and foremost, Welcome! Thank you for visiting the Brainda repository which was initially released at this repo and reorganized

Owner
Mobile Robotics Lab. at Skoltech
Mobile Robotics Lab. at Skoltech
Algorithm and Structured Programming course project for the first semester of the Internet Systems course at IFPB

Algorithm and Structured Programming course project for the first semester of the Internet Systems course at IFPB

Gabriel Macaúbas 3 May 21, 2022
zoofs is a Python library for performing feature selection using an variety of nature inspired wrapper algorithms. The algorithms range from swarm-intelligence to physics based to Evolutionary. It's easy to use ,flexible and powerful tool to reduce your feature size.

zoofs is a Python library for performing feature selection using a variety of nature-inspired wrapper algorithms. The algorithms range from swarm-intelligence to physics-based to Evolutionary. It's easy to use , flexible and powerful tool to reduce your feature size.

Jaswinder Singh 168 Dec 30, 2022
Genetic algorithms are heuristic search algorithms inspired by the process that supports the evolution of life.

Genetic algorithms are heuristic search algorithms inspired by the process that supports the evolution of life. The algorithm is designed to replicate the natural selection process to carry generation, i.e. survival of the fittest of beings.

Mahdi Hassanzadeh 4 Dec 24, 2022
Algorithms and data structures for educational, demonstrational and experimental purposes.

Algorithms and Data Structures (ands) Introduction This project was created for personal use mostly while studying for an exam (starting in the month

null 50 Dec 6, 2022
Minimal examples of data structures and algorithms in Python

Pythonic Data Structures and Algorithms Minimal and clean example implementations of data structures and algorithms in Python 3. Contributing Thanks f

Keon 22k Jan 9, 2023
Repository for data structure and algorithms in Python for coding interviews

Python Data Structures and Algorithms This repository contains questions requiring implementation of data structures and algorithms concepts. It is us

Prabhu Pant 1.9k Jan 1, 2023
:computer: Data Structures and Algorithms in Python

Algorithms in Python Implementations of a few algorithms and datastructures for fun and profit! Completed Karatsuba Multiplication Basic Sorting Rabin

Prakhar Srivastav 2.9k Jan 1, 2023
Python Client for Algorithmia Algorithms and Data API

Algorithmia Common Library (python) Python client library for accessing the Algorithmia API For API documentation, see the PythonDocs Algorithm Develo

Algorithmia 138 Oct 26, 2022
Cormen-Lib - An academic tool for data structures and algorithms courses

The Cormen-lib module is an insular data structures and algorithms library based on the Thomas H. Cormen's Introduction to Algorithms Third Edition. This library was made specifically for administering and grading assignments related to data structure and algorithms in computer science.

Cormen Lib 12 Aug 18, 2022
Path tracing obj - (taichi course final project) a path tracing renderer that can import and render obj files

Path tracing obj - (taichi course final project) a path tracing renderer that can import and render obj files

null 5 Sep 10, 2022