In this paper, we discuss the problem of goal assignment in the multi-robot exploration task. The presented work is focused on the underlying optimal assignment problem of the multi-robot task allocation that is addressed by three state-of-the art approaches. In addition, we propose a novel exploration strategy considering allocation of all current goals (not only immediate goal) for each robot, which leads to the multiple traveling salesman problem formulation. Although the problem is strongly NP-hard, we show its approximate solution is computationally feasible and its overall requirements are competitive to the previous approaches. The proposed approach and three well-known approaches are compared in series of problems considering various numbers of robots and sensor ranges. Based on the evaluation of the results the proposed exploration strategy provides shorter exploration times than the former approaches.

Accurate models of the environment are a crucial requirement for autonomous mobile robots. The process of how to acquire knowledge about the operating environment is one of the most challenging problems in this research area. The quality of the model depends on the number and types of sensors used. Occupancy grids are the most common low-level models of the environment used in robotics for fusion of noisy data. This paper first introduces a novel method for building an occupancy grid from a monocular color camera. The next part of the work describes a method for fusion of camera data with data from a rangefinder. The final part presents a new method for measuring the quality of the occupancy grid based on the quality of the path created by the grid. The methods were experimentally verified with an indoor experimental robot at the Czech Technical University.

E-learning is a modern and effective approach for training in various areas and at different levels of education. This paper gives an overview of SyRoTek, an e-learning platform for mobile robotics, artificial intelligence, control engineering, and related domains. SyRoTek provides remote access to a set of fully autonomous mobile robots placed in a restricted area with dynamically reconfigurable obstacles, which enables solving a huge variety of problems. A user is able to control the robots in real time by their own developed algorithms as well as being able to analyze gathered data and observe activity of the robots by provided interfaces. The system is currently used for education at the Czech Technical University in Prague, Prague, Czech Republic, and at the University of Buenos Aires, Buenos, Aires, Argentina, and it is freely accessible to other institutions. In addition to the system overview, this paper presents the experience gained from the actual deployment of the system in teaching activities.

Performance of exploration strategies strongly depends on the process of determination of a next robot goal. Current approaches define different utility functions how to evaluate and select possible next goal candidates. One of the mostly used evaluation criteria is the distance cost that prefers candidates close to the current robot position. If this is the only criterion, simply the nearest candidate is chosen as the next goal. Although this criterion is simple to implement and gives feasible results there are situations where the criterion leads to wrong decisions. This paper presents the distance cost that reflects traveling through all goal candidates. The cost is determined as a solution of the Traveling Salesman Problem using the Chained Lin-Kernighan heuristic. The cost can be used as a stand-alone criterion as well as it can be integrated into complex decision systems. Experimental results for open-space and office-like experiments show that the proposed approach outperforms the standard one in the length of the traversed trajectory during the exploration while the computational burden is not significantly increased.