• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.7
• /
• pp.115-123
• /
• 2004

This paper deals with the gait optimization of via points on biped robot. ZMP(Zero Moment point) is the most important index in a biped robot's dynamic walking stability. To stable walking of a biped robot, leg's trajectory and a desired ZMP trajectory is required, balancing motion is solved by FDM(Finite Difference Method). In this paper, optimal index is defined to dynamically stable walking of a biped robot, and genetic algorithm is applied to optimize gait trajectory and balancing motion of a biped robot. By genetic algorithm, the index of walking parameter is efficiently optimized, and dynamic walking stability is verified by ZMP verification equation. Genetic algorithm is only applied to balancing motion, and is totally applied to whole trajectory. All of the suggested motions of biped robot are investigated by simulations and verified through the real implementation.

• Journal of Information Processing Systems
• /
• v.19 no.5
• /
• pp.563-575
• /
• 2023

Trajectory planning is a key technology for unmanned aerial vehicles (UAVs) to achieve complex flight missions. In this paper, a terminal constraints conversion-based Gauss pseudospectral trajectory planning optimization method is proposed. Firstly, the UAV trajectory planning mathematical model is established with considering the boundary conditions and dynamic constraints of UAV. Then, a terminal constraint handling strategy is presented to tackle terminal constraints by introducing new penalty parameters so as to improve the performance index. Combined with Gauss-Legendre collocation discretization, the improved Gauss pseudospectral method is given in detail. Finally, simulation tests are carried out on a four-quadrotor UAV model with different terminal constraints to verify the performance of the proposed method. Test studies indicate that the proposed method performances well in handling complex terminal constraints and the improvements are efficient to obtain better performance indexes when compared with the traditional Gauss pseudospectral method.

• Journal of the Korea Computer Graphics Society
• /
• v.25 no.3
• /
• pp.133-142
• /
• 2019

In physics-based character animation, trajectory optimization has been widely adopted for automatic motion synthesis, through the prediction of an optimal sequence of future states of the character based on its system dynamics model. In general, the system dynamics model is neither in a closed form nor differentiable when it handles the contact dynamics between a character and the environment with rigid body collisions. Employing smoothed contact dynamics, researchers have suggested efficient trajectory optimization techniques based on numerical differentiation of the resulting system dynamics. However, the numerical derivative of the system dynamics model could be inaccurate unlike its analytical counterpart, which may affect the stability of trajectory optimization. In this paper, we propose a novel method to derive the closed-form derivative for the system dynamics by properly approximating the contact model. Based on the resulting derivatives of the system dynamics model, we also present a model predictive control (MPC)-based motion synthesis framework to robustly control the motion of a biped character according to on-line user input without any example motion data.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.361-364
• /
• 1997

The re-enty guidance design involves trajectory optimization, generation of a reference drag acceleration profile with the satisfaction of trajectory constraints. This reference drag acceleration profile can be considered as the reference trajectory. This paper proposes the atmospheric re-entry system which is composed of longitudinal, later and range control. This paper shows the a performance of a re-entry guidance and control system using feedback linearization control and predictive control.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4453-4468
• /
• 2015

This paper investigates optimization-based base station (BS) placement. An optimization model is defined and the BS placement problem is transformed to a lexicographical stratified programming (LSP) model for a given trajectory, according to different accuracy requirements. The feasible region for BS deployment is obtained from the positioning system requirement, which is also solved with signal coverage problem in BS placement. The LSP mathematical model is formulated with the average geometric dilution of precision (GDOP) as the criterion. To achieve an optimization solution, a tolerant factor based complete stratified series approach and grid searching method are utilized to obtain the possible optimal BS placement. Because of the LSP model utilization, the proposed algorithm has wider application scenarios with different accuracy requirements over different trajectory segments. Simulation results demonstrate that the proposed algorithm has better BS placement result than existing approaches for a given trajectory.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.37-50
• /
• 2021

Query applications based on nested data, the most commonly used form of data representation on the web, especially precise query, is becoming more extensively used. MapReduce, a distributed architecture with parallel computing power, provides a good solution for big data processing. However, in practical application, query requests are usually concurrent, which causes bottlenecks in server processing. To solve this problem, this paper first combines a column storage structure and an inverted index to build index for nested data on MapReduce. On this basis, this paper puts forward an optimization strategy which combines query execution service tree and frequent sub-query trajectory to reduce the response time of frequent queries and further improve the efficiency of multi-user concurrent queries on large scale nested data. Experiments show that this method greatly improves the efficiency of nested data query.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.6
• /
• pp.519-526
• /
• 2009

This paper describes a research result of a external shape optimization study to maximize the range of the guided missile with canards and tailfins in atmospheric flight. For this purpose, the external shape optimization program which can enhance the range of a missile was developed, incorporated with the trajectory analysis and the optimization technique. In the trajectory analysis part, Missile DATCOM which utilizes the semi-empirical method was directly connected to the trajectory code to supply the aerodynamic coefficients efficiently at every time step. In the gliding flight trajectory after apogee, a maximum $C_L/C_D$ trim condition calculation module was attached under the assumption of the missile continuously flying at maximum $C_L/C_D$ condition. In the optimization part, a Response Surface Method(RSM) was adopted to reduce the computing time.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.1
• /
• pp.42-52
• /
• 2006

In order to utilize hydrodynamic drag force on articulated robots moving in an underwater environment, an optimum motion planning procedure is proposed. The drag force acting on cylindrical underwater arms is modeled and a directional drag measure is defined as a quantitative measure of reaction force in a specific direction in a workspace. A repetitive trajectory planning method is formulated from the general point-to-point trajectory planning method. In order to globally optimize the parameters of repetitive trajectories under inequality constraints, a 2-level optimization scheme is proposed, which adopts the genetic algorithm (GA) as the 1st level optimization and sequential quadratic programming (SQP) as the 2nd level optimization. To verify the validity of the proposed method, optimization examples of periodic motion planning with the simple two-link planner robot are also presented in this paper.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.391-399
• /
• 2006

In order to solve the optimization problem of designing the trajectory of three-dimensional horizontal well, we establish a multi-phase, nonlinear, stochastic dynamic system of the trajectory of horizontal well. We take the precision of hitting target and the total length of the trajectory as the performance index. By the integration of the state equation, this model can be transformed into a nonlinear stochastic programming. We discuss here the necessary conditions under which a local solution exists and depends in a continuous way on the parameter (perturbation). According to the properties we propose a revised Hooke-Jeeves algorithm and work out corresponding software to calculate the local solution of the nonlinear stochastic programming and the expectancy of the performance index. The numerical results illustrate the validity of the proposed model and algorithm.

• Proceeding of EDISON Challenge
• /
• 2017.03a
• /
• pp.528-532
• /
• 2017

The Theo Jansen mechanism using 1 degree of freedom is special system of walking robot. The trajectory made by the point of ground position is similar to other walking robot using many degrees of freedom. Because of diversity of design parameter of the Jansen mechanism, it makes a lot of trajectory and takes possibilities of optimization. However this research doesn't focus on the optimization of trajectory, but it focused on comprehensive design of the robot using well-known trajectory and line tracer logic to go fast and accurate along the line. The logic to follow a line has many kinds of possibility of algorithm. To eliminate uncertainty about recognizing a line, I divide the case of line following situation and make optimized logic.