Intelligent Logistics for Robotics

Optimizing robot routing

A robot routing problem can be defined as the problem of finding a route for a mobile robot that must visit all the nodes in a network minimizing the total cost that stands for distance, time or battery power. Here mathematical models and methodology can provide a great help.

This mobility project aims to develop a dynamic adaptation procedure for a wide range of heuristics applied to the mentioned robot routing problems. This will allow solutions which have a higher level of time consistency and provide a lower value of route cost function compared to a basic solution. The project covers a two-year period from January 2017 to December 2018.

Project team

Principal investigator Tero Tuovinen

Visiting professor Victor Zakharov

Professor Pekka Neittaanmäki