• Proceedings of the KIEE Conference
• /
• 1991.11a
• /
• pp.361-365
• /
• 1991

The problem being considered here is the determination of optimal guidance laws for a launch vehicle for scientific missions. The optimal guidance commands are determined in the sense that the least amount of fuel is used. A numerical solution was obtained for the case where the position and velocity state variables satisfy a specified constraint at the time of thrust cutoff. The method used here is based on the Pontryagin's maximum principle. This is the method of solving a problem in the calculus of variations. In particular, it applies to the problem considered here where the magnitude of the control is bounded. Simulations for the optimal guidance algorithm, during the 2nd and the 3rd-stage flight of the Japanese rocket M-3H-3, are carried out. The results show that the guided trajectory that satisfying the terminal constraints is optimal, and the guidance algorithm works well in the presence of some errors during the 1st-stage pre-programmed guidance phase.

• International Journal of Aeronautical and Space Sciences
• /
• v.10 no.1
• /
• pp.67-74
• /
• 2009

In general, the lunar landing stage can be divided into two distinct phases: de-orbit and descent, and the descent phase usually comprises two sub-phases: braking and approach. And many optimization problems of minimal energy are usually focused on descent phases. In these approaches, the energy of de-orbit burning is not considered. Therefore, a possible low perilune altitude can be chosen to save fuel for the descent phase. Perilune altitude is typically specified between 10 and 15km because of the mountainous lunar terrain and possible guidance errors. However, it requires more de-orbit burning energy for the lower perilune altitude. Therefore, in this paper, the perilune altitude of the intermediate orbit is also considered with optimal thrust programming for minimal energy. Furthermore, the perilune altitude and optimal thrust programming can be expressed by a function of the radius of a parking orbit by using continuation method and co-state estimator.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.1
• /
• pp.78-86
• /
• 1998

This paper presents a numerical method of the minimum-time trajectory planning for a robot manipulator amid obstacles. Each joint displacement is represented by the linear combination of the finite-term quintic B-splines which are the known functions of the path parameter. The time is represented by the linear function of the same path parameter. Since the geometric path is not fixed and the time is linear to the path parameter, the coefficients of the splines and the time-scale factor span a finite-dimensional vector space, a point in which uniquely represents the manipulator motion. The displacement, the velocity and the acceleration conditions at the starting and the goal positions are transformed into the linear equality constraints on the coefficients of the splines, which reduce the dimension of the vector space. The optimization is performed in the reduced vector space using nonlinear programming. The total moving time is the main performance index which should be minimized. The constraints on the actuator forces and that of the obstacle-avoidance, together with sufficiently large weighting coefficients, are included in the augmented performance index. In the numerical implementation, the minimum-time motion is obtained for a planar 3-1ink manipulator amid several rectangular obstacles without simplifying any dynamic or geometric models.

• Journal of Korean Society of Water and Wastewater
• /
• v.18 no.2
• /
• pp.222-227
• /
• 2004

Flotation processes involve the use of very small bubbles (micro-bubbles) to separate particles from water. The process has become a good alternative to sedimentation, especially where the particles are small or of low density. Although the flotation process commences with a collision between particles and bubbles, most research has been focused only on the characteristics of the particles. In this paper, recent theoretical and experimental research on the characteristics of bubbles is summarized. The effect on the collision efficiency of the size and charge of bubbles is calculated through trajectory analysis. The size and charge of bubbles are measured under different conditions and the ramifications of the results are discussed. The results may lead to a better understanding and optimization of the existing process. In particular, we discuss an idea that a new advanced flotation process might be possible by the modification of the characteristics of the bubble alone or of both bubble and particle.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.12
• /
• pp.1021-1026
• /
• 2016

The graph-based SLAM (Simultaneous Localization and Mapping) approach has been gaining much attention in SLAM research recently thanks to its ability to provide better maps and full trajectory estimations when compared to the filtering-based SLAM approach. Even though graph-based SLAM requires batch processing causing it to be computationally heavy, recent advancements in optimization and computing power enable it to run fast enough to be used in real-time. However, data association problems still require large amount of computation when building a pose graph. For example, to find loop closures it is necessary to consider the whole history of the robot trajectory and sensor data within the confident range. As a pose graph grows, the number of candidates to be searched also grows. It makes searching the loop closures a bottleneck when solving the SLAM problem. Our approach to alleviate this bottleneck is to sample a limited number of pose nodes in which loop closures are searched. We propose a heuristic for sampling pose nodes that are most advantageous to closing loops by providing a way of ranking pose nodes in order of usefulness for closing loops.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1200-1215
• /
• 2023

With the development of IoT and artificial intelligence, location-based services are getting more and more attention. For solving the current problem that indoor positioning error is large and generalization is poor, this paper proposes a Model Stacking Algorithm for Indoor Positioning System using WiFi fingerprinting. Firstly, we adopt a model stacking method based on Bayesian optimization to predict the location of indoor targets to improve indoor localization accuracy and model generalization. Secondly, Taking the predicted position based on model stacking as the observation value of particle filter, collaborative particle filter localization based on model stacking algorithm is realized. The experimental results show that the algorithm can control the position error within 2m, which is superior to KNN, GBDT, Xgboost, LightGBM, RF. The location accuracy of the fusion particle filter algorithm is improved by 31%, and the predicted trajectory is close to the real trajectory. The algorithm can also adapt to the application scenarios with fewer wireless access points.

• Nuclear Engineering and Technology
• /
• v.56 no.2
• /
• pp.498-505
• /
• 2024

In this paper, a cable-driven endoscopic manipulator (CEM) is designed for the Chinese latest compact fusion reactor. The whole CEM arm is more than 3000 mm long and includes end vision tools, an endoscopic manipulator/control system, a feeding system, a drag chain system, support systems, a neutron shield door, etc. It can cover a range of ±45° of the vacuum chamber by working in a wrap-around mode, etc., to meet the need for observation at any position and angle. By placing all drive motors in the end drive box via a cable drive, cooling, and radiation protection of the entire robot can be facilitated. To address the CEM motion control problem, a discrete trajectory tracking method is proposed. By restricting each joint of the CEM to the target curve through segmental fitting, the trajectory tracking control is completed. To avoid the joint rotation angle overrun, a joint limit rotation angle optimization method is proposed based on the equivalent rod length principle. Finally, the CEM simulation system is established. The rationality of the structure design and the effectiveness of the motion control algorithm are verified by the simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.436-438
• /
• 2019

Air hockey robots are machine vision systems that allow users to play hockey balls through the camera. The position detection of the hockey ball is realized by using the color information of the ball using OpenCV library. It senses the position of the hockey ball, predicts its trajectory, and sends the result to the ARM Cortex-M board. The ARM Cortex-M board controls a 2- Axis Cartesian Coordinate Robot to run an air hockey game. Depending on the strategy of the air hockey robot, it can operate in defensive, offensive, defensive and offensive mode. In this paper, we describe a vision system development and trajectory prediction system and propose a new method to control a biaxial orthogonal robot in an air hockey game.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2889-2909
• /
• 2017

Wireless sensor networks (WSNs) have attracted lots of attention in recent years due to their potential for various applications. In this paper, we seek how to efficiently deploy relay nodes into traditional static WSNs with constrained locations, aiming to satisfy specific requirements of the industry, such as average energy consumption and average network reliability. This constrained relay node deployment problem (CRNDP) is known as NP-hard optimization problem in the literature. We consider addressing this multi-objective (MO) optimization problem with an improved Artificial Bee Colony (ABC) algorithm with a linear local search (MOABCLLS), which is an extension of an improved ABC and applies two strategies of MO optimization. In order to verify the effectiveness of the MOABCLLS, two versions of MO ABC, two additional standard genetic algorithms, NSGA-II and SPEA2, and two different MO trajectory algorithms are included for comparison. We employ these metaheuristics on a test data set obtained from the literature. For an in-depth analysis of the behavior of the MOABCLLS compared to traditional methodologies, a statistical procedure is utilized to analyze the results. After studying the results, it is concluded that constrained relay node deployment using the MOABCLLS outperforms the performance of the other algorithms, based on two MO quality metrics: hypervolume and coverage of two sets.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.23 no.4
• /
• pp.407-416
• /
• 2020

Recent complex battle field demands Network Centric Warfare(NCW) ability to control various parts into a cohesive unit. In path planning filed, the NCW ability increases complexity of path planning algorithm, and it has to consider a communication coverage map as well as traditional parameters such as minimum radar exposure and survivability. In this paper, pros and cons of various propagation models are summarized, and we suggest a coverage map generation method using a Longley-Rice propagation model. Previous coverage map based on line of sight has significant discontinuities that limits selection of path planning algorithms such as Dijkstra and fast marching only. If there is method to remove discontinuities in the coverage map, optimization based path planning algorithms such as trajectory optimization and Particle Swarm Optimization(PSO) can also be used. In this paper, the Longley-Rice propagation model is used to calculate continuous RF strengths, and convert the strength data using smoothed leaky BER for the coverage map. In addition, we also suggest other types of rough coverage map generation using a lookup table method with simple inputs such as terrain type and antenna heights only. The implemented communication coverage map can be used various path planning algorithms, especially in the optimization based algorithms.