Joint Task Allocation and Path Planning for Space Robot

Abstract

Space robots have a broad application prospect in the aerospace industry. It is difficult for space robots to keep running for a long time due to limited fuel. In addition, it is impossible to replenish the fuel for space robots at any time due to the unique working environment. Therefore, a proper path is crucial for the effective operation of the space robot. In this paper, we investigate the allocation of exploration tasks and the path planning of space robots jointly. The goal is to minimize the completion latency of exploration tasks. We propose two algorithms named subbranch insertion task allocation (SI-TA) and parallel search task allocation (PS-TA) to solve the problem. We also customize an algorithm named random path planning task allocation (RTA) as the baseline. At last, we implement extensive experiments to demonstrate that proposed algorithms can obtain lower completion latency than RTA. Compared with RTA, the proposed algorithms SI-TA and PS-TA can reduce completion latency by at least 20% and 40%, respectively. Moreover, both algorithms work more stably than RTA.

Keywords

• Space robot
• path planning
• combination algorithm
• completion latency