• 전기의세계
• /
• 제21권1호
• /
• pp.13-16
• /
• 1972

Dynamic Programming is regarded as a very powerful tool for solving nonlinear optimization problem subject to a number of constraints of state and control variables, but has definite disadvantages that it requires much more computing time and consumes much more memory spaces than other technigues. In order to eliminate the above-mentioned demerits, this paper suggests a news technique called Multiple Dynamic Programming. The underlying principles are based on the concept of multiple passes that, instead of forming fin lattices in time-state plane as adopted in the conventional Dynamic Programming, the Multiple Dynamic Programming constitutes, at the first pass, coarse lattices in the feasible domain of time-state plane and determines the optimal state trajectory by the usual method of Dynamic Programming, and at the second pass again constitutes finer lattices in the narrower domain surrounded by both the upperand lower edges next to the lattice edges through which the first pass optimal trajectory passes and determines the more accurate optimal trajectory of state, and then at the third pass repeats the same processes, and so on. The suggested technique insures remarkable curtailment in amounts of computer memory spaces and conputing time, and its applicability has been demonstrated by a case study on the hydro-thermal power coordination in Korean power system.

• 드라이브 ㆍ 컨트롤
• /
• 제15권3호
• /
• pp.1-7
• /
• 2018

Humanoid robots have fascinated many researchers since they appeared decades ago. For the requirement of both accurate tracking control and the safety of physical human-robot interaction, torque control is basically desirable for humanoid robots. Humanoid robots are highly nonlinear, coupled, complex systems, accordingly the calculation of robot model is difficult and even impossible if precise model of the humanoid robots are unknown. Therefore, it is difficult to control using traditional model-based techniques. To realize model-free torque control, time-delay control (TDC) for humanoid robot was proposed with time-delay estimation technique. Using optimal walking trajectory obtained by particle swarm optimization, TDC with proposed scheme is implemented on whole body of a humanoid, not on biped legs even though it is performed by a virtual humanoid robot. The simulation results show the validity of the proposed TDC for humanoid robots.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1993년도 하계학술대회 논문집 A
• /
• pp.395-398
• /
• 1993

This paper proposes an algorithm to find an optimal trajectory for unspecified paths of the tips of two arms of a dual arm robot. The effective handling a specified object of a dual arm robot closely depends on the effective collision avoidance between parts of robot and the object. For time optimal trajectory without collision, a graphical method is applied for a robot with two degree of freedom. The effectiveness of the proposed method is demonstrated by some simulation results.

• 전자공학회논문지B
• /
• 제29B권11호
• /
• pp.36-45
• /
• 1992

A numerical trajectory planning method for path-constrained trajectory planning is proposed which ensures collision-free and time-optimal motions for two robotic manipulators with limited actuator torques and velocities. For each robot, physical constraints of the robots such as limited torques or limited rotational velocities of the actuators are converted to the constraints on velocity and acceleration along the path, which is described by a scalar variable denoting the traveled distance from starting point. Collision region is determined on the coordination space according to the kinematic structures and the geometry of the paths of the robots. An Extended Coordination Space is then constructed` an element of the space determines the postures and the velocities of the robots, and all the constraints described before are transformed to some constraints on the behaviour of the coordination-velocity curves in the space. A dynamic programming technique is them provided with on the discretized Extended Coordination Space to derive a collision-free and time-optimal trajectory pair. Numerical example is included.

• 한국해양공학회지
• /
• 제28권6호
• /
• pp.560-565
• /
• 2014

In this study, the problem of trajectory optimization for underwater gliders considering depth constraints is discussed. Typically, underwater gliders are controlled to dive and climb in a saw-tooth pattern at constant gliding angles. This approach is effective and close to optimal for deep water applications. However, the optimal path deviates from the saw-tooth path in shallow water conditions. This study focuses on finding more efficient gliding paths that can minimize the traverse time in the horizontal plane when the water depth is limited. The trajectory optimization problem is formulated into a minimum time control problem with inequality path constraints and hydrodynamic drag effects. A numerical approach based on the pseudo-spectral method is adopted as a solution approach, and the simulation results are presented.

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

In order to find the optimal control law for the precise trajectory tracking of a robot manipulator, a perturbational control method is proposed based on a linearized manipulator dynamic model which can be obtained in a very compact and computationally efficient manner using the dual number algebra. Manipulator control can be decomposed into two parts: the nominal control and the corrective perturbational control. The nominal control is precomputed from the inverse dynamic model using the quantities of a desired trajectory. The perturbational control is obtained by applying the second-variational method on the linearized dynamic model. Simulation results for a PUMA-560 robot show that, by using this controller, the desired trajectory tracking performance of the robot can be achieved, even in the presence of large initial positional disturbances.

• 한국정밀공학회지
• /
• 제13권6호
• /
• pp.122-127
• /
• 1996

The achievement of the optimal condition for the task of an industrial articulated robot used in many fields is an important problem to improve productivity. In this paper, a minimum-time trajectory for an articulated robot along the specified path is studied and simulated with a proper example. A general dynamic model of manipulator is represented as a function of path distance. Using this model, the velocity is produced as fast as possible at each point along the path. This minimum-time trajectory planning module together with the existing collision-free path planning modules is utilized to design the optimal path planning of robot in cases where obstacles present.

• 전기학회논문지
• /
• 제68권1호
• /
• pp.159-166
• /
• 2019

Due to the various engagement situations, it is very difficult to generate the optimal trajectory with several constraints. This paper investigates the sequential convex programming for the impact angle control with the additional constraint of altitude limit. Recently, the SOCP(Second-Order Cone Programming), which is one area of the convex optimization, is widely used to solve variable optimal problems because it is robust to initial values, and resolves problems quickly and reliably. The trajectory optimization problem is reconstructed as convex optimization problem using appropriate linearization and discretization. Finally, simulation results are compared with analytic result and nonlinear optimization result for verification.

• 제어로봇시스템학회논문지
• /
• 제10권9호
• /
• pp.833-839
• /
• 2004

This paper proposes a method that minimizes the consumed energy by searching the optimal locations of the mass centers of links composing of a biped robot using Real-Coded Genetic Algorithm. Generally, in order to utilize optimization algorithms, the system model and design variables must be defined. Firstly, the proposed model is a 6-DOF biped robot composed of seven links, since many of the essential characteristics of the human walking motion can be captured with a seven-link planar biped walking in the saggital plane. Next, Fourth order polynomials are used for basis functions to approximate the walking gait. The coefficients of the fourth order polynomials are defined as design variables. In order to use the method generating the optimal gait trajectory by searching the locations of mass centers of links, three variables are added to the total number of design variables. Real-Coded GA is used for optimization algorithm by reason of many advantages. Simulations and the comparison of three methods to generate gait trajectories including the GCIPM were performed. They show that the proposed method can decrease the consumed energy remarkably and be applied during the design phase of a robot actually.

• 제어로봇시스템학회논문지
• /
• 제21권9호
• /
• pp.807-810
• /
• 2015

In this paper, a finite impulse response(FIR) fixed-lag smoother is proposed for discrete-time nonlinear systems. If the actual state trajectory is sufficiently close to the nominal state trajectory, the nonlinear system model can be divided into two parts: The error-state model and the nominal model. The error state can be estimated by adapting the optimal time-varying FIR smoother to the error-state model, and the nominal state can be obtained directly from the nominal trajectory model. Moreover, in order to obtain more robust estimates, the linearization errors are considered as a linear function of the estimation errors. Since the proposed estimator has an FIR structure, the proposed smoother can be expected to have better estimation performance than the IIR-structured estimators in terms of robustness and fast convergence. Additionally the proposed method can give a more general solution than the optimal FIR filtering approach, since the optimal FIR smoother is reduced to the optimal FIR filter by setting the fixed-lag size as zero. To illustrate the performance of the proposed method, simulation results are presented by comparing the method with an optimal FIR filtering approach and linearized Kalman filter.