Multi-Objective PSO with Variable Number of Dimensions for Space Robot Path Optimization

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F23%3APU148364" target="_blank" >RIV/00216305:26220/23:PU148364 - isvavai.cz</a>

Result on the web

<a href="https://www.mdpi.com/1999-4893/16/6/307/htm" target="_blank" >https://www.mdpi.com/1999-4893/16/6/307/htm</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/a16060307" target="_blank" >10.3390/a16060307</a>

Result language

angličtina

Original language name

Multi-Objective PSO with Variable Number of Dimensions for Space Robot Path Optimization

Original language description

This paper aims to solve the space robot pathfinding problem, formulated as a multi-objective (MO) optimization problem with a variable number of dimensions (VND). This formulation enables the search and comparison of potential solutions with different model complexities within a single optimization run. A novel VND MO algorithm based on the well-known particle swarm optimization (PSO) algorithm is introduced and thoroughly described in this paper. The novel VNDMOPSO algorithm is validated on a set of 21 benchmark problems with different dimensionality settings and compared with two other state-of-the-art VND MO algorithms. Then, it is applied to solve five different instances of the space robot pathfinding problem formulated as a VND MO problem where two objectives are considered: (1) the minimal distance of the selected path, and (2) the minimal energy cost (expressed as the number of turning points). VNDMOPSO shows at least comparable or better convergence on the benchmark problems and significantly better convergence properties on the VND pathfinding problems compared with other VND MO algorithms.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

20204 - Robotics and automatic control

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2023

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Algorithms

ISSN

1999-4893

e-ISSN

—

Volume of the periodical

16

Issue of the periodical within the volume

6

Country of publishing house

CH - SWITZERLAND

Number of pages

20

Pages from-to

1-20

UT code for WoS article

001013798800001

EID of the result in the Scopus database

2-s2.0-85163718097