Trends in space technology development and rapidly increasing traffic in outer space are likely to lead to the emergence of a market for services for the removal of large debris objects to disposal orbits. The commercial benefits of Active Debris Removal missions are possible when multiple objects are removed by a single spacecraft-collector that flies between targets in an optimal sequence, trying to achieve a rational ratio between mission duration and fuel costs. Given the size of the large debris population, selecting candidates for removal and optimizing such a mission is a non-trivial task.

In this paper, a review of solutions, which are proposed in 65 publications between 2010 and 2023 for the problem of path planning between space debris objects in low orbits, is performed. These solutions could be categorized into three main types. The search for transfer chains in the first type of approaches is based solely on combinatorics, supplemented by various heuristics as required. In the second case, combinatorial-heuristic algorithms fully or partially utilize the secular effects of the Earth's polar compression. Solutions of the third type are based only on the use of precession of the Right Ascension of the Ascending Node of the orbit. For each analyzed work, the following information is given: objects of study, maneuvering scheme for a flight between two successive objects, method of choosing the transfer sequence, and main results. At the end of this paper, a subjective general evaluation of the analyzed works is proposed.

In order to deepen the reader's understanding of the problem of large space debris removal, this review also provides background information from related fields. The reasons for the growth of observable fragments in near-Earth space and the need to remove large objects to disposal orbits are shown. The history of experiments aimed at the development of ADR technology is given. The article contains a large number of explanatory illustrations.

空间技术发展的趋势和外层空间交通量的迅速增加可能会导致将大型碎片物体清除到处置轨道的服务市场的出现。当单个航天器收集器以最佳顺序在目标之间飞行并清除多个物体时，主动碎片清除任务的商业利益就可能实现，试图在任务持续时间和燃料成本之间实现合理的比例。考虑到大量碎片的规模，选择清除候选者并优化此类任务是一项艰巨的任务。

本文对 2010 年至 2023 年间 65 份出版物中针对低轨道空间碎片物体之间的路径规划问题提出的解决方案进行了回顾。这些解决方案可以分为三种主要类型。第一种方法中转移链的搜索仅基于组合学，并根据需要辅以各种启发法。在第二种情况下，组合启发式算法完全或部分利用地球极地压缩的长期效应。第三类解决方案仅基于使用轨道升交点赤经进动。对于每项分析工作，给出以下信息：研究对象、两个连续对象之间飞行的机动方案、选择转移顺序的方法以及主要结果。在本文的最后，提出了对所分析作品的主观总体评价。

为了加深读者对大型空间碎片清除问题的理解，本综述还提供了相关领域的背景信息。显示了近地空间可观测碎片增长的原因以及需要将大型物体移至处置轨道的必要性。给出了旨在开发 ADR 技术的实验历史。文章包含大量解释性插图。