Skip to main navigation Skip to search Skip to main content

Adaptive ant colony algorithm for on-orbit assembly planning

  • Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

On-orbit assembly of space structures has long been considered as a means of enabling the construction of large space platforms. An adaptive ant colony algorithm approach is presented to generate optimal sequences for on-orbit assembly planning of large space truss structures. The assembly sequences are considered from two levels: strut level and structural volume element (SVE) level. At the strut level, assembly sequences are represented by the connectivity matrix. And, at the SVE level, the directed graph representation is used to guarantee the feasibility conditions of assembly tasks. Furthermore, an adaptive ant colony algorithm Is improved to plan assembly sequences of large space truss structures. This algorithm is based on adaptive updating of pheromone. Finally, a case shows that the comparison of converged iterations of adaptive ant colony algorithm and basic ant colony algorithm, and illustrates the effectiveness of the approach.

Original languageEnglish
Title of host publicationICIEA 2007
Subtitle of host publication2007 Second IEEE Conference on Industrial Electronics and Applications
Pages1590-1593
Number of pages4
DOIs
StatePublished - 2007
Event2007 2nd IEEE Conference on Industrial Electronics and Applications, ICIEA 2007 - Harbin, China
Duration: 23 May 200725 May 2007

Publication series

NameICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications

Conference

Conference2007 2nd IEEE Conference on Industrial Electronics and Applications, ICIEA 2007
Country/TerritoryChina
CityHarbin
Period23/05/0725/05/07

Fingerprint

Dive into the research topics of 'Adaptive ant colony algorithm for on-orbit assembly planning'. Together they form a unique fingerprint.

Cite this