电子电气工程与控制

多航天器非严格守序并行装配任务规划方法

  • 岳程斐 ,
  • 张枭 ,
  • 曹喜滨
展开
  • 1.哈尔滨工业大学(深圳) 空天科技学院,深圳 518055
    2.哈尔滨工业大学 微小型航天器快速设计与智能集群全国重点实验室,哈尔滨 150001
    3.哈尔滨工业大学 卫星技术研究所,哈尔滨 150001
.E-mail: xbcao@hit.edu.cn

收稿日期: 2024-09-24

  修回日期: 2024-11-04

  录用日期: 2024-12-12

  网络出版日期: 2024-12-18

基金资助

国家自然科学基金(12372045);广东省基础与应用基础研究基金项目区域联合基金(2023B1515120018);深圳市科技计划资助项目(JCYJ20220818102207015)

摘要

针对多分支航天器集群装配任务中部分航天器空闲、装配效率低的问题,提出了一种多航天器集群装配任务规划建模与序列分配方法。首先,考虑非严格守序并行装配场景,基于装配约束关系图建立了多航天器装配任务规划模型。其次,提出了装配前序指标和同路惯性指标,对非严格守序装配时子装配体数量和装配过程进行了约束,以避免不同航天器在连续装配任务中装配体之间来回切换的问题。最后,基于深度优先搜索策略改进了拓扑排序算法,解决了非严格守序并行装配中的序列分配规划问题;采用遗传算法对装配序列进行优化,在提高装配效率的同时有效降低了零散子装配体数量和连续任务切换次数;采用Gumbel-Sinkhorn网络为装配任务序列分配解集,实现了单一装配序列到可行装配解集的映射。最后通过典型在轨装配任务仿真,验证了任务规划模型与序列分配方法的有效性。

本文引用格式

岳程斐 , 张枭 , 曹喜滨 . 多航天器非严格守序并行装配任务规划方法[J]. 航空学报, 2025 , 46(14) : 331258 -331258 . DOI: 10.7527/S1000-6893.2024.31258

参考文献

[1] 王明明, 罗建军, 袁建平, 等. 空间在轨装配技术综述[J]. 航空学报202142(1): 523913.
  WANG M M, LUO J J, YUAN J P, et al. In-orbit assembly technology: Review[J]. Acta Aeronautica et Astronautica Sinica202142(1): 523913 (in Chinese).
[2] 岳程斐, 陆浪, 吴云华, 等. 在轨集群操控关键技术研究进展与展望[J]. 宇航学报202344(6): 817-828.
  YUE C F, LU L, WU Y H, et al. Research progress and prospect of the key technologies for on-orbit spacecraft swarm manipulation[J]. Journal of Astronautics202344(6): 817-828 (in Chinese).
[3] 刘宏, 刘冬雨, 蒋再男. 空间机械臂技术综述及展望[J]. 航空学报202142(1): 524164.
  LIU H, LIU D Y, JIANG Z N. Space manipulator technology: review and prospect[J]. Acta Aeronautica et Astronautica Sinica202142(1): 524164 (in Chinese).
[4] LU L, YUE C F, SHEN Q, et al. Hierarchical passivity-based force-position-configuration coordinated control of multi-branch spacecraft[J]. IEEE Transactions on Aerospace and Electronic Systems2024(99): 1-16.
[5] 孟光, 韩亮亮, 张崇峰. 空间机器人研究进展及技术挑战[J]. 航空学报202142(1): 523963.
  MENG G, HAN L L, ZHANG C F. Research progress and technical challenges of space robot[J]. Acta Aeronautica et Astronautica Sinica202142(1): 523963 (in Chinese).
[6] YUE C F, LIN T, ZHANG X, et al. Hierarchical path planning for multi-arm spacecraft with general translational and rotational locomotion mode[J]. Science China Technological Sciences202366(4): 1180-1191.
[7] LIU J G, ZHAO P Y, CHEN K L, et al. 1U-Sized deployable space manipulator for future on-orbit servicing, assembly, and manufacturing[J]. Space: Science & Technology20222022: 9894604.
[8] 牟帅, 卜慧蛟, 张进, 等. 面向突发任务的空间站任务重规划方法[J]. 航空学报201738(7): 320793.
  MU S, BU H J, ZHANG J, et al. Re-planning method for space station pop-up missions[J]. Acta Aeronautica et Astronautica Sinica201738(7): 320793 (in Chinese).
[9] BROWN K J. Algorithms for multi-agent robotic assembly planning[D]. Stanford: Stanford University, 2021: 8-10.
[10] BROWN K, ASMAR D M, SCHWAGER M, et al. Large-scale multi-robot assembly planning for autonomous manufacturing[DB/OL].arXiv preprint: 2311.00192; 2023.
[11] CULBERTSON P D. Planning and control for multi-robot manipulation and assembly in unstructured environments[D]. Stanford: Stanford University, 2022: 57-73.
[12] CULBERTSON P, BANDYOPADHYAY S, SCHWAGER M. Multi-robot assembly sequencing via discrete optimization[C]∥2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). Piscataway: IEEE Press, 2019: 6502-6509.
[13] CULBERTSON P, BANDYOPADHYAY S, GOEL A, et al. Multi-robot assembly scheduling for the lunar crater radio telescope on the far-side of the moon[C]∥ 2022 IEEE Aerospace Conference (AERO). Piscataway: IEEE Press, 2022: 1-9.
[14] NAGPAL K, MEHR N. Optimal robotic assembly sequence planning: A sequential decision-making approach[DB/OL]. arXiv preprint: 2310.17115, 2023.
[15] ZHANG C, CAO Z G, WU Y X, et al. Learning topological representations with bidirectional graph attention network for solving job shop scheduling problem[DB/OL]. arXiv preprint: 2402.17606, 2024.
[16] WANG N, YANG X, WANG T H, et al. Collaborative path planning and task allocation for multiple agricultural machines[J]. Computers and Electronics in Agriculture2023213: 108218.
[17] EVANS J D, KESSLER R. Allocation of parallel pro-grams with time variant resource requirements[C]∥ 1993 International Conference on Parallel Processing (ICPP’93). Piscataway: IEEE Press, 1993: 271-275.
[18] QIAN T, LIU X F, FANG Y C. A cooperative ant colony system for multiobjective multirobot task allocation with precedence constraints[J]. IEEE Transactions on Evolutionary Computation2024(99): 1.
[19] LIN T, YUE C F, LIU Z R, et al. Modular multi-level replanning TAMP framework for dynamic environment[J]. IEEE Robotics and Automation Letters20249(5): 4234-4241.
[20] 邹子缘, 陈琪锋. 基于决策树搜索的空间飞行器集群对抗目标分配方法[J]. 航空学报202243(S1): 726910.
  ZOU Z Y, CHEN Q F. Decision tree-based target assignment for confrontation of multiple space vehicles[J]. Acta Aeronautica et Astronautica Sinica202243(S1): 726910 (in Chinese).
[21] 王路桥, 王璐, 庄慧盈, 等. 约束分级的飞行器任务指令序列编排方法[J]. 航空学报202445(20): 630445.
  WANG L Q, WANG L, ZHUANG H Y, et al. A hierarchical constraint-based method for arranging aircraft mission instruction sequences[J]. Acta Aeronautica et Astronautica Sinica202445(20): 630445 (in Chinese).
[22] LIU Z S, GUO M, BAO W M, et al. Fast and adaptive multi-agent planning under collaborative temporal logic tasks via poset products[J]. Research20247: 337.
[23] LIU Z S, GUO M, LI Z K. Time minimization and online synchronization for multi-agent systems under collaborative temporal logic tasks[J]. Automatica2024159: 111377.
[24] BAI X S, FIELBAUM A, KRONMüLLER M, et al. Group-based distributed auction algorithms for multi-robot task assignment[J]. IEEE Transactions on Automation Science and Engineering202320(2): 1292-1303.
[25] BAI X S, LI C, ZHANG B, et al. Efficient performance impact algorithms for multirobot task assignment with deadlines[J]. IEEE Transactions on Industrial Electronics202471(11): 14373-14382.
[26] LIU Y, HAN D, WANG L, et al. Novel topological relationship solutions to the alv multi-indegree-multi-outdegree task sequence planning problem[J]. International Journal of Robotics and Automation202237(3): 257-265.
[27] LIU Y D, HAN D, WANG L J, et al. HGHA: task allocation and path planning for warehouse agents[J]. Assembly Automation202141(2): 165-173.
[28] MENA G, BELANGER D, LINDERMAN S, et al. Learning latent permutations with gumbel-sinkhorn networks[DB/OL]. arXiv preprint1802.08665, 2018.
文章导航

/