• 제목/요약/키워드: star identification algorithm

검색결과 4건 처리시간 0.023초

A New Pivot Algorithm for Star Identification

  • Nah, Jakyoung;Yi, Yu;Kim, Yong Ha
    • Journal of Astronomy and Space Sciences
    • /
    • 제31권3호
    • /
    • pp.205-214
    • /
    • 2014
  • In this study, a star identification algorithm which utilizes pivot patterns instead of apparent magnitude information was developed. The new star identification algorithm consists of two steps of recognition process. In the first step, the brightest star in a sensor image is identified using the orientation of brightness between two stars as recognition information. In the second step, cell indexes are used as new recognition information to identify dimmer stars, which are derived from the brightest star already identified. If we use the cell index information, we can search over limited portion of the star catalogue database, which enables the faster identification of dimmer stars. The new pivot algorithm does not require calibrations on the apparent magnitude of a star but it shows robust characteristics on the errors of apparent magnitude compared to conventional pivot algorithms which require the apparent magnitude information.

The robustness of continuous self tuning controller for retarded system

  • Lee, Bongkuk;Huh, Uk Youl
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
    • /
    • pp.1930-1933
    • /
    • 1991
  • In this paper, the robustness of self turning controller on the continuous time-delay system is investigated. The polynomial identification method using continuous time exponentially weighted least square algorithm is used for estimating the time.-delay system parameters. The pole-zero and pole placement method are adopted for the control algorithm. On considering the control weighting factor and reliability filter the effect of unmodeled dynamics of the plant are examined by the simulation.

  • PDF

별센서 시험을 위한 지상 S/W 시뮬레이터 연구 (A Study on the Ground S/W Simulator for the Test of a Star Tracker)

  • 이현재;방효충;정대원;석병석;김학정
    • 한국항공우주학회지
    • /
    • 제31권5호
    • /
    • pp.117-123
    • /
    • 2003
  • 인공위성의 자세를 정밀하게 제어함에 있어서 중요한 기술 요소가운데 하나로 센서를 들 수 있다. 일반적인 관성센서의 특징은 잡음과 드리프트에 의해서 지속적인 오차를 유발할 수 있다는 단점을 가지고 있다. 이를 해결하기 위해서는 기준이 되는 절대값이 필요하게 되는데, 이를 위해서 인공위성에서는 별센서를 활용한다. 별센서의 중요성은 정밀하게 자세를 제어함에 있어서 매우 필요한 센서이다. 그러나 국내에서는 이러한 별센서를 개발하기 위한 기초적인 연구나 지상에서의 시험방안이 아직 마련되어 있지 않다. 그리하여 본 논문에서는 이러한 별센서의 기본적인 원리를 이해하고 이를 바탕으로 S/W 방식의 별센서 시뮬레이터를 소개하도록 한다. 천구 시뮬레이터는 별센서 자체의 기능 시험 및 별센서가 부착된 인공위성 전체의 시험에 활용될 수 있을 것으로 기대한다.

A new hybrid optimization algorithm based on path projection

  • Gharebaghi, Saeed Asil;Ardalan Asl, Mohammad
    • Structural Engineering and Mechanics
    • /
    • 제65권6호
    • /
    • pp.707-719
    • /
    • 2018
  • In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.