Path Planning for a Space-Based Manipulator System Based on Quantum Genetic Algorithm

Abstract

In this study, by considering a space-based, n-joint manipulator system as research object, a kinematic and a dynamic model are constructed and the system’s nonholonomic property is discussed. In light of the nonholonomic property unique to space-based systems, a path planning method is introduced to ensure that when an end-effector moves to the desired position, a floating base achieves the expected pose. The trajectories of the joints are first parameterized using sinusoidal polynomial functions, and cost functions are defined by the pose deviation of the base and the positional error of the end-effector. At this stage, the path planning problem is converted into a target optimization problem, where the target is a function of the joints. We then adopt a quantum genetic algorithm (QGA) to solve this objective optimization problem to attain the optimized trajectories of the joints and then execute nonholonomic path planning. To test the proposed method, we carried out a simulation on a six-degree-of-freedom (DOF) space-based manipulator system (SBMS). The results showed that, compared to traditional genetic optimization algorithms, the QGA converges more rapidly and has a more accurate output.

Motion Planning for a Chain of Mobile Robots Using A* and Potential Field

“…Chen and Zohu [17] explained the problem of defining a path planning algorithm using the Quantum Genetic Algorithm. The solution works effectively for space based manipulators and help astronauts to avoid the harsh conditions faced when in space.…”

Novel Two-Dimensional Visualization Approaches for Multivariate Centroids of Clustering Algorithms

“…is contemporary optimization algorithm is in wide-spread use. Silveira et al used QGA to implement a novel approach for ordering optimization problems [37]; Chen et al used QGA for a path planning problem [38]; Guan and Lin implemented a system to obtain a structural optimal design for ships using QGA [39]; Ning et al used QGA to solve a "job shop scheduling problem" in their study [40]; and Konar et al implemented a novel QGA as a hybrid quantum-inspired genetic algorithm to solve the problem of scheduling real-time tasks in multiprocessor systems [41]. DRV-P-MC, the focus of interest in our study, is an optimization problem as well, so this algorithm's efficient run-time performance is employed to determine suitable cluster positions on a 2D map.…”

Improved Genetic Algorithm Tuning Controller Design for Autonomous Hovercraft

“…In 2007, Zhang et al adaptively adjusted crossover and mutation probabilities by utilizing a clustering-based technique [7]. Preceding this paper, GA and its innovations have been successfully deployed in a wide range of non-trivial complicated real-world issues, from optimization of flight control laws [8] to aerodynamic optimization problems [9]; from small wind turbine design [10] to path planning of a space-based of a manipulator system [11]; and from modeling collinear data [12] to ship navigation in collision situations [13].…”