Selected Topics in Algorithmics of Mobile Robots

Lecturer: Jerzy Czyżowicz (Université du Québec en Outaouais).

About the lecturer | Course Summary | Slides | Assignment

About the lecturer: Jerzy Czyżowicz is a Professor at the Department of Informatics and Engineering of UniversitÄ du QuÄbec en Outaouais (Canada). He works on algorithmics, escpecially related to mobile robots.

Course summary: Many questions may be solved by collections of collaborating processors distributed in the network environment. Several of these problems require processors to move along the network and the distance travelled by such mobile entities is a principal measure of the efficiency of the solutions. For several decades the tasks for mobile agents and robots has been fundamental in numerous domains of mathematics and computer science. These include robotics, operations research, network searching and exploration, web crawling, vehicle routing, cops-and-robber games and many others. Most often mobile entities represent either physical objects (e.g. robots, humans, animals) or software robots (agents, bots).

The course presents selected algorithms involving mobile robots. Some of them concern the central problems in algorithms and distributed computing like searching/exploration and rendez-vous. More thoroughly we look at some more specific questions:

Slides: Lecture slides can be found at the departmental Moodle. If you cannot access that site, please contact Bartek Klin for the slides.

Assignment: You can find the problem set here, or at the departmental Moodle. Please send the solutions to prof. Czyżowicz by Thursday, January 15.