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

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

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...

Full description

Bibliographic Details
Main Author: Petr Kadlec
Format: Article
Language:English
Published: MDPI AG 2023-06-01
Series:Algorithms
Subjects:
space robot
pathfinding
heuristic algorithm
particle swarm optimization
variable number of dimensions
metameric optimization
Online Access:https://www.mdpi.com/1999-4893/16/6/307

Internet

https://www.mdpi.com/1999-4893/16/6/307

Similar Items