Abstract
Today, robots can be found in almost any field. Examples include robots for transporting materials in hospitals and warehouses, surveillance, intelligent laboratories and space exploration. Whatever the reason for moving the robot and whatever its location, all robot applications anywhere require path calculation. In this paper, we address the problem of collision-free path planning in multirobot environments, known as Free Multi-Robot Path Planning (MPP). In this paper we propose a novel approach to solve the MPP problem using multi-objective optimization, for which we define two functions that has to be minimized. In experimentation, it is compared with previous approaches to the problem, improving them in some scenarios. Finally, new lines of research are proposed to improve this path calculation problem using multi-objective optimization and to address new and more complex problems in warehouse environments.
Citare
@Inproceedings{González2023MultiobjectiveOF,
author = {Enol García González and J. Villar and Camelia Chira and E. D. L. Cal and Luciano Sánchez and J. Sedano},
booktitle = {Soft Computing Models in Industrial and Environmental Applications},
title = {Multi-objective Optimization for Multi-Robot Path Planning on Warehouse Environments},
year = {2023}
}