Cooperative planning for multi-site asteroid visual coverage. (17th November 2021)

• Record Type: Journal Article
• Authors: Satpute, Sumeet G.; Bodin, Per; Nikolakopoulos, George
• Is Part Of: Advanced robotics. Volume 35:Number 21/22(2021)
• Page Start: 1332
• Page End: 1346
• Publication Date: 2021-11-17
• Subjects: Cooperative visual coverage -- asteroid proximity operations -- cubesats -- traveling salesman problem -- fuel minimization; Robotics -- Periodicals; Robotics -- Japan -- Periodicals; Robotics; Japan; Periodicals; 629.89205
• DOI: 10.1080/01691864.2021.1955003
• Languages: English
• ISSNs: 0169-1864

Abstract

Abstract : This article proposes a novel two-staged trajectory planning algorithm toward the cooperative visual coverage of multiple asteroid sites with the utilization of multiple spacecraft. The objective of the novel established planning scheme is to determine an observation tour for each spacecraft and the associated fuel optimal trajectories, such that each site of interest is observed only once during the entire mission. The completion of the observation task of an asteroid site is limited to the observation time window, referred as the period for which a site is illuminated by the Sun. The proposed planning algorithm divides the overall multi-site coverage problem into a nonlinear and integer optimization problem as: (i) a single target optimization and (ii) a multi-target multiple spacecraft optimal sequencing problem. The first part aims to generate fuel optimal trajectories, for all the initial-final imaging site location pairs. In the second part, the problem of distributing the observation task, among the fleet of spacecraft, is addressed by designing a feasible tour to observe a subset of the desired asteroid sites, for each spacecraft, while considering their individual fuel capacity. The efficacy of the proposed algorithm is evaluated in multiple simulation scenarios and while considering different asteroids. GRAPHICAL ABSTRACT: UF0001