{"id":1216,"date":"2026-01-25T19:31:22","date_gmt":"2026-01-25T19:31:22","guid":{"rendered":"https:\/\/www.cs.ubbcluj.ro\/~meco\/multi-objective-optimization-for-multi-robot-path-planning-on-warehouse-environments-2023\/"},"modified":"2026-02-01T12:07:58","modified_gmt":"2026-02-01T12:07:58","slug":"multi-objective-optimization-for-multi-robot-path-planning-on-warehouse-environments-2023","status":"publish","type":"post","link":"https:\/\/www.cs.ubbcluj.ro\/~meco\/multi-objective-optimization-for-multi-robot-path-planning-on-warehouse-environments-2023\/","title":{"rendered":"Multi-objective Optimization for Multi-Robot Path Planning on Warehouse Environments (2023)"},"content":{"rendered":"<div class=\"entry-content\">\n<p>Soft Computing Models in Industrial and Environmental Applications<\/p>\n<h2>Authors<\/h2>\n<p>Enol Garc\u00eda Gonz\u00e1lez, J. Villar, Camelia Chira, E. D. L. Cal, Luciano S\u00e1nchez, J. Sedano<\/p>\n<h2>Abstract<\/h2>\n<p>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.<\/p>\n<h2>Citation<\/h2>\n<pre class=\"wp-block-preformatted\">@Inproceedings{Gonz\u00e1lez2023MultiobjectiveOF,\n author = {Enol Garc\u00eda Gonz\u00e1lez and J. Villar and Camelia Chira and E. D. L. Cal and Luciano S\u00e1nchez and J. Sedano},\n booktitle = {Soft Computing Models in Industrial and Environmental Applications},\n title = {Multi-objective Optimization for Multi-Robot Path Planning on Warehouse Environments},\n year = {2023}\n}<\/pre>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>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.<\/p>\n","protected":false},"author":6,"featured_media":0,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":[],"categories":[4],"tags":[10,20,50],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1216"}],"collection":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/users\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/comments?post=1216"}],"version-history":[{"count":1,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1216\/revisions"}],"predecessor-version":[{"id":1463,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1216\/revisions\/1463"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/media?parent=1216"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/categories?post=1216"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/tags?post=1216"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}