<abstract xmlns="http://www.w3.org/1999/xhtml"><p> A path planning problem for a heterogeneous vehicle is considered. Such a vehicle consists of two parts which have the ability to move individually, but one of them has a shorter range and is therefore required to keep in a close distance to the main vehicle. The objective is to devise an optimal path of minimal length under the condition that at least one part of the heterogeneous system visits all desired waypoints exactly once. Two versions of the problem are considered. One assumes that the order in which the waypoints are visited is known a priori. In such a case we show that the optimal path can be found by solving a mixed-integer second-order cone problem. The second version assumes that the order in which the waypoints are visited is not known a priori, but can be optimized so as to shorten the length of the path. Two approaches to solve this problem are presented and evaluated with respect to computational complexity.</p></abstract>

A path planning problem for a heterogeneous vehicle is considered. Such a vehicle consists of two parts which have the ability to move individually, but one of them has a shorter range and is therefore required to keep in a close distance to the main vehicle. The objective is to devise an optimal path of minimal length under the condition that at least one part of the heterogeneous system visits all desired waypoints exactly once. Two versions of the problem are considered. One assumes that the order in which the waypoints are visited is known a priori. In such a case we show that the optimal path can be found by solving a mixed-integer second-order cone problem. The second version assumes that the order in which the waypoints are visited is not known a priori, but can be optimized so as to shorten the length of the path. Two approaches to solve this problem are presented and evaluated with respect to computational complexity.

An optimal path planning problem for heterogeneous multi-vehicle systems

Institute of Information Engineering, Automation and Mathematics Slovak University of Technology in Bratislava, Radlinského 9, Bratislava, Slovakia

International Journal of Applied Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"An optimal path planning problem for heterogeneous multi-vehicle systems"}

A path planning problem for a heterogeneous vehicle is considered. Such a vehicle consists of two parts which have the ability to move individually, but one of...

An optimal path planning problem for heterogeneous multi-vehicle systems

Data publikacji: 02 lip 2016

Zakres stron: 297 - 308

Otrzymano: 24 cze 2015

Przyjęty: 16 sty 2016

DOI: https://doi.org/10.1515/amcs-2016-0021

Słowa kluczowe
path planning, multi-vehicle system, mixed-integer programming

© by Martin Klaučo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

An optimal path planning problem for heterogeneous multi-vehicle systems

Data publikacji: 02 lip 2016

Zakres stron: 297 - 308

Otrzymano: 24 cze 2015

Przyjęty: 16 sty 2016

DOI: https://doi.org/10.1515/amcs-2016-0021

Słowa kluczowepath planning, multi-vehicle system, mixed-integer programming

© by Martin Klaučo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Słowa kluczowe
path planning, multi-vehicle system, mixed-integer programming