• Complex
  • Title
  • Author
  • Keyword
  • Abstract
  • Scholars
Search

Author:

Chen, Gang (Chen, Gang.) | Kang, Xing-Wu (Kang, Xing-Wu.) | Yan, Gui-Rong (Yan, Gui-Rong.) | Xu, Min (Xu, Min.) | Chen, Shi-Lu (Chen, Shi-Lu.)

Indexed by:

EI Scopus CSCD PKU

Abstract:

A Multi-Objective Pareto Collaboration Optimization algorithm (MOPCO) is investigated to solve multi-objective multi-disciplinary trajectory design. Through the concurrency of system level optimizer and subsystem lever optimizer with response surface technology, the multi-objective multi-disciplinary optimization (MDO) problem is decomposed. And then the NSGA-II algorithm is used to search the Pareto front. The normal test case indicates the feasibility of MOPCO. Finally MOPCO is applied to the fixed static/dynamic reentry trajectory design and search the rational Pareto front successfully.

Keyword:

Collaboration optimization Collaborative optimization Multi-disciplinary optimizations Multi objective NSGA-II algorithm Reentry trajectories Response surface Trajectory designs

Author Community:

  • [ 1 ] [Chen, Gang;Yan, Gui-Rong]MOE Key Laboratory for Strength and Vibration, Xi'an Jiaotong University, Xi'an 710049, China
  • [ 2 ] [Chen, Gang;Xu, Min;Chen, Shi-Lu]College of Astronautics, Northwestern Polytecnical University, Xi'an 710072, China
  • [ 3 ] [Kang, Xing-Wu]The Second Artillery Engineering Institute, Xi'an 710025, China

Reprint Author's Address:

Show more details

Related Keywords:

Related Article:

Source :

Yuhang Xuebao/Journal of Astronautics

ISSN: 1000-1328

Year: 2008

Issue: 4

Volume: 29

Page: 1210-1215

Cited Count:

WoS CC Cited Count: 0

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 4

FAQ| About| Online/Total:1355/168876544
Address:XI'AN JIAOTONG UNIVERSITY LIBRARY(No.28, Xianning West Road, Xi'an, Shaanxi Post Code:710049) Contact Us:029-82667865
Copyright:XI'AN JIAOTONG UNIVERSITY LIBRARY Technical Support:Beijing Aegean Software Co., Ltd.