• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.5
• /
• pp.408-415
• /
• 2011

The moon landing is composed of the de-orbit descent phase, powered descent phase, and the powered descent phase is divide into 3-sub phase of the braking, approach, final landing phase. In this paper, the lunar lander perform landing control using 3-sub phase of optimal trajectory. First, generate the reference trajectory using gauss pseudo-spectral method. Thereafter generate PID controller using altitude and velocity error in each direction. Finally the lunar lander landing system constitute using the Simulink of Matlab, and perform simulation.

• Industrial Engineering and Management Systems
• /
• v.4 no.1
• /
• pp.94-101
• /
• 2005

This paper presents the first known application of a meta-heuristic algorithm, variable neighbourhood descent (VND), to the redundancy allocation problem (RAP). The RAP, a well-known NP-hard problem, has been the subject of much prior work, generally in a restricted form where each subsystem must consist of identical components. The newer meta-heuristic methods overcome this limitation and offer a practical way to solve large instances of the relaxed RAP where different components can be used in parallel. The variable neighbourhood descent method has not yet been used in reliability design, yet it is a method that fits perfectly in those combinatorial problems with potential neighbourhood structures, as in the case of the RAP. A variable neighbourhood descent algorithm for the RAP is developed and tested on a set of well-known benchmark problems from the literature. Results on 33 test problems ranging from less to severely constrained conditions show that the variable neighbourhood descent method provides comparable solution quality at a very moderate computational cost in comparison with the best-known heuristics. Results also indicate that the VND method performs with little variability over random number seeds.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.31 no.1
• /
• pp.79-91
• /
• 2023

In response to the recent surge in aviation demand, major airports and aviation authorities continue to make efforts to formulate arrival and approach procedures that take into account efficient aircraft separation, noise and environmental issues of carbon (CO2) emissions. In order to ensure efficient traffic control and environmental issues, as a result, a new concept Trombone, Point Merge, etc. have been introduced and widely used in the domestic airspace. However, these new concept procedures which do not properly reflect the characteristics of the aircraft operation performance and the FMS vertical descent guidance hinder flight efficiency as well as bring in turn negative factors such as level-off flight and the use of drag device at the busiest phase of the flight descent operation, like the Continuous Descent Operation (CDO). Accordingly, throughout modification the current Standard Terminal Arrival Route (STAR) and Instrument Approach Procedure(IAP) that reflect the aircraft descent performance and the FMS guidance, the flight operation safety and efficiency is expected to be improved eventually. We herewith analyze and propose the way of improving flight efficiency in the arrival operation procedure by supplementary modification which consequently contribute to the aviation industry international competitiveness.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.12
• /
• pp.1184-1194
• /
• 2010

The descent and ascent phases for a lunar lander are composed of several phases. Accordingly, the constraints and control values adequate for each phase are required in order to generate optimal lander's trajectory. The optimal trajectories for descent and ascent phases are generated by the cost function to minimize fuel consumption & attitude variation rates. In this paper, the optimal control problem to make trajectory uses Gauss pseudo-spectral method which is one of the direct approach method. This problem generates lander's reference trajectory, states and controls.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.701-716
• /
• 1998

In this paper we develop algorithms in programming lan-guage SCHEME for implementation of the main first order gradient techniques for unconstrained optimization. Implementation of the de-scent techniques which use non-optimal descent steps as well as imple-mentation of the optimal descent techniques are described. Also we investigate implementation of the global problem called optimization along a line. Developed programs are effective and simpler with re-spect to the corresponding in the procedural programming languages. Several numerical examples are reported.

• Advances in aircraft and spacecraft science
• /
• v.9 no.6
• /
• pp.493-506
• /
• 2022

The study presents the results of the research of heat and heat exchange processes on the heat-stressed elements of the structure of an advanced TsAGI descent vehicle. The studies were carried out using a mathematical model based on solving discrete analogs of continuum mechanics equations. Conclusions were drawn about the correctness of the model and the dependence of the intensity of heat and mass transfer processes on the most heat-stressed sections of the apparatus surface on its geometry and the catalytic activity of the surface.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.19 no.2
• /
• pp.52-57
• /
• 2011

The procedures of Continuous Descent Approach(CDA) is designed to minimize the thrust required during landing, thereby reducing fuel consumption, noise and emissions compared to conventional approach procedures. Widespread implementation of CDA would result in significant reductions in the environmental impact and aircraft operation costs. This paper estimated the possible economic effects from the perspective of airliners through cost-benefit analysis, provided that the CDA is introduced. It is now proposed that a more comprehensive analysis model, which includes the reduced ATC communication burden between controllers and pilots, not to mention the economic aspect, should be established for the improvement.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.58 no.2
• /
• pp.164-171
• /
• 2009

This paper presents new learning algorithm of dynamic Bayesian networks (DBN) by means of constrained least square (LS) estimation algorithm and gradient descent method. First, we propose constrained LS based parameter estimation for a Markov chain (MC) model given observation data sets. Next, a gradient descent optimization is utilized for online estimation of a hidden Markov model (HMM), which is bi-linearly constructed by adding an observation variable to a MC model. We achieve numerical simulations to prove its reliability and superiority in which a series of non stationary random signal is applied for the DBN models respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.6
• /
• pp.396-401
• /
• 1986

The method of steepest descent is applied to the analysis of electrostatic problems. The differences between iterative method and direct method, e.g. the method of moments, are not lined. It is shown that this method converges monotonically to the exact solution and is suitable for solving a problem of large system. Numerical results are presented for electrostatic case which show a good agreement with momet solution.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.823-828
• /
• 1992

A novel steepest descent adaptive filter algorithm, which uses the instantaneous stochastic gradient for the steepest descent direction, is derived from a newly devised performance index function. The performance function for the new algorithm is improved from that for the LMS in consideration that the stochastic steepest descent method is utilized to minimize the performance index iterativly. Through mathematical analysis and computer simulations, it is verified that there are substantial improvements in convergence and misadjustments even though the computational simplicity and the robustness of the LMS algorithm are hardly sacrificed. On the other hand, the new algorithm can be interpreted as a variable step size adaptive filter, and in this respect a heuristic method is proposed in order to reduce the noise caused by the step size fluctuation.