AI Search Methods for Mobile Robots, Short Course | Part time online | Örebro University | Sweden
Studyportals
Short Online

AI Search Methods for Mobile Robots

3 days
Duration
Unknown
Tuition fee
Anytime
Unknown
Apply date
Unknown
Start date

About

The AI Search Methods for Mobile Robots course offered by Örebro University introduces students to the most important types of AI search methods. These are then instantiated in three industrially-relevant application contexts, namely, resource scheduling, motion planning, and multi-robot coordination.

Overview

Course Objectives

Knowledge and understanding

  • After completion of the AI Search Methods for Mobile Robots course offered by Örebro University , the student will have knowledge about three advanced applications of AI reasoning, namely: resource scheduling, robot motion planning, and multi-robot coordination. The student will understand the computational bottlenecks of different algorithms, and will have gained a deeper understanding of the limits of current state of the art methods.

Applied knowledge and skills

  • Completing this course, the student will be able to formulate real-world problems as search problems, and sketch methods to solve them based on heuristic, sampling-based and constraint-based search algorithms. The student will be able to develop solutions for particular applications that are relevant in industry, namely, scheduling, robot motion planning, and coordination of fleets of autonomous robots.

Making judgments and attitudes

  • Completing this course, the student will be able to judge the suitability of a particular approach to automated reasoning for a given problem, have an understanding of the capabilities and limitations of the considered algorithms. Furthermore, the student will understand how problem structure relates to computational overhead.

Programme Structure

The program focuses on:

  • Overview of systematic and local search methods.
  • Introduction to constraint reasoning, backtracking search, k-consistency.
  • Temporal constraint reasoning, constraint-based resource scheduling.
  • Lattice- and sampling-based robot motion planning algorithms.
  • State of the art methods for multi-robot motion planning, coordination and control.

Key information

Duration

  • Part-time
    • 3 days

Start dates & application deadlines

Language

English

Credits

3 ECTS

Delivered

Online

Academic requirements

We are not aware of any specific GRE, GMAT or GPA grading score requirements for this programme.

English requirements

We are not aware of any English requirements for this programme.

Other requirements

General requirements

  • At least 180 credits including 15 credits programming as well as qualifications corresponding to the course "English 5"/"English A" from the Swedish Upper Secondary School.

Tuition Fee

Funding

Other interesting programmes for you

Our partners

AI Search Methods for Mobile Robots
Örebro University
AI Search Methods for Mobile Robots
-
Örebro University

Wishlist

Go to your profile page to get personalised recommendations!