• Kyungpook Mathematical Journal
• /
• 제48권1호
• /
• pp.81-92
• /
• 2008

In this paper, the trajectory scroll in 3-dimensional Minkowski space-time $E_1^3$ is given by a firmly connected oriented line moving with Cartan frame along curve. Some theorems and results between curvatures of base curve and distribution parameter of this surface are obtained. Moreover, some theorems and results related to being developable and minimal of this surface are given. And also, some relationships among geodesic curvature, geodesic torsion and the curvatures of base curve of trajectory scroll are found.

• Journal of Astronomy and Space Sciences
• /
• 제35권3호
• /
• pp.119-131
• /
• 2018

In spite of a short history of only 30 years in space development, Korea has achieved outstanding space development capabilities, and became the $11^{th}$ member of the "Space Club" in 2013 by launching its own satellites with its own launch vehicle from a local space center. With the successful development and operation of more than 10 earth-orbiting satellites since 1999, Korea is now rapidly expanding its own aspirations to outer space exploration. Unlike earth-orbiting missions, planetary missions are more demanding of well-rounded technological capabilities, specifically trajectory design, analysis, and navigation. Because of the importance of relevant technologies, the Korean astronautical society devoted significant efforts to secure these basic technologies from the early 2000s. This paper revisits the numerous efforts conducted to date, specifically regarding flight dynamics and navigation technology, to prepare for future upcoming planetary missions in Korea. However, sustained efforts are still required to realize such challenging planetary missions, and efforts to date will significantly advance the relevant Korean technological capabilities.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.826-829
• /
• 1995

In this paper, the problem of minimum-time trajectory planning of a robot manipulator with an arbitrary path is dealt. As for a straight path, the trajectory planning can be done without difficulty since the path is easily parameterized by its length. However, this is not the case for a non-straight path. In this paper, by noting that the others' joint angles and velocities are determined if one joint's angle and velocity are known, we reduce the problem of trajectory planning on a non-straight path to one in the 2-dimensional space of one joint's angle and velocity. Then, by applying the dynamic programming, we achieve the minimum-time trajectory planning. A simulation is done for verifying this.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권5호
• /
• pp.527-547
• /
• 2009

Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

• 한국우주과학회:학술대회논문집(한국우주과학회보)
• /
• 한국우주과학회 2004년도 한국우주과학회보 제13권2호
• /
• pp.74-74
• /
• 2004

• 한국항공우주학회지
• /
• 제45권8호
• /
• pp.662-670
• /
• 2017

본 논문에서는 한국형 달 착륙 임무를 위한 아폴로 유도 법칙의 파라미터 선정을 위한 최적화 기반의 절차를 제안하였다. 달 착륙 문제를 연료 소모량을 최소화하기 위한 궤적 최적화 문제로 공식화하였으며 비행 이전 단계에서 본 문제를 풀어 착륙선의 기준 궤적을 획득할 수 있다. 아폴로 유도의 파라미터들은 유도 명령을 정의하기 위해 사용되는 다항식의 계수들이며, 비행 이전 단계에서 구해진 기준 궤적을 기반으로 선정된다. 제안된 절차의 효과를 입증하기 위해, 본 절차를 사용한 한국형 달 착륙 임무의 착륙 유도 사례연구를 수행하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.990-995
• /
• 1990

A minimum-time trajectory planning for two robot arms with designated paths and coordination is proposed. The problem considered in this paper is a subproblem of hierarchically decomposed trajectory planning approach for multiple robots : i) path planning, ii) coordination planning, iii) velocity planning. In coordination planning stage, coordination space, a specific form of configuration space, is constructed to determine collision region and collision-free region, and a collision-free coordination curve (CFCC) passing collision-free region is selected. In velocity planning stage, normal dynamic equations of the robots, described by joint angles, velocities and accelerations, are converted into simpler forms which are described by traveling distance along collision-free coordination curve. By utilizing maximum allowable torques and joint velocity limits, admissible range of velocity and acceleration along CFCC is derived, and a minimum-time velocity planning is calculated in phase plane. Also the planning algorithm itself is converted to simple numerical iterative calculation form based on the concept of neural optimization network, which gives a feasible approximate solution to this planning problem. To show the usefulness of proposed method, an example of trajectory planning for 2 SCARA type robots in common workspace is illustrated.

• 한국항공우주학회지
• /
• 제44권6호
• /
• pp.502-511
• /
• 2016

최근 다양한 형태와 기능을 갖춘 스마트 무기들이 개발되고 있다. 화포탄의 경우 스마트 탄을 개발하기 위한 초기 연구로 신관 내부에 GNSS 수신기를 장착하여 탄자의 비행위치를 정밀하게 측정하고 이를 바탕으로 탄착점을 추정하는 연구가 진행되고 있다. 하지만, 수신기 성능 및 수신된 데이터에 포함된 다양한 오차유발 원인들로 인해 항법데이터의 위치정확도에 오차가 발생하게 된다. 본 논문에서는 PRODAS로부터 얻은 모의궤적 데이터를 수신기로부터 얻은 항법데이터에 포함된 PDOP 가중치를 적용하여 정합함으로써 탄의 발사부터 탄착까지의 전체 비행궤적 및 탄착점을 보다 정밀하게 추정하는 개선된 알고리즘을 소개한다.

• 한국전산유체공학회지
• /
• 제19권2호
• /
• pp.86-92
• /
• 2014

In this paper, prediction of separation trajectory for Two-stage-To-Orbit space launch vehicle has been numerically simulated by using an aerodynamic database based on steady state analysis. Aerodynamic database were obtained for matrix of longitudinal and vertical positions. The steady flow simulations around the launch vehicle have been made by using a 3-D RANS flow solver based on unstructured meshes. For this purpose, a vertex-centered finite-volume method was adopted to discretize inviscid and viscous fluxes. Roe's finite difference splitting was utilized to discretize the inviscid fluxes, and the viscous fluxes were computed based on central differencing. To validate this flow solver, calculations were made for the wind-tunnel experiment model of the LGBB TSTO vehicle configuration on steady state conditions. Aerodynamic database was constructed by using flow simulations based on test matrix from the wind-tunnel experiment. ANN(Artificial Neural Network) was applied to construct interpolation function among aerodynamic variables. Separation trajectory for TSTO launch vehicle was predicted from 6-DOF equation of motion based on the interpolated function. The result of present separation trajectory calculation was compared with the trajectory using experimental database. The predicted results for the separation trajectory shows fair agreement with reference[4] solution.

• Journal of Astronomy and Space Sciences
• /
• 제30권1호
• /
• pp.11-15
• /
• 2013

A collision-free formation reconfiguration trajectory subject to the linearized Hill's dynamics of relative motion is analytically developed by extending an algorithm for gravity-free space. Based on the initial solution without collision avoidance constraints, the final solution to minimize the designated performance index and avoid collision is found, based on a gradient method. Simple simulations confirm that satellites reconfigure their positions along the safe trajectories, while trying to spend minimum energies. The algorithm is applicable to wide range of formation flying under the Hill's dynamics.