• 제어로봇시스템학회논문지
• /
• 제18권9호
• /
• pp.845-853
• /
• 2012

We propose time-optimal cornering motion trajectory planning and control algorithms for differential wheeled mobile robot with motor actuating voltage constraint, under piecewise constant control input condition. For time-optimal cornering trajectory generation, 1) we considered mobile robot's dynamics including actuator motors, 2) divided the cornering trajectory into one liner section, followed by two cornering section with angular acceleration and deceleration, and finally one liner section, and 3) formulated an efficient trajectory generation algorithm satisfying the bang-bang control principle. Also we proposed an efficient trajectory control algorithm and implemented with an X-bot to prove the performance.

• 로봇학회논문지
• /
• 제18권2호
• /
• pp.143-154
• /
• 2023

In this study, a fast motion planning method for the swing motion of a 6x6 wheel-legged robot to traverse large obstacles and gaps is proposed. The motion planning method presented in the previous paper, which was based on trajectory optimization, took up to tens of seconds and was limited to two-dimensional, structured vertical obstacles and trenches. A deep neural network based on one-dimensional Convolutional Neural Network (CNN) is introduced to generate keyframes, which are then used to represent smooth reference commands for the six leg angles along the robot's path. The network is initially trained using the behavioral cloning method with a dataset gathered from previous simulation results of the trajectory optimization. Its performance is then improved through reinforcement learning, using a one-step REINFORCE algorithm. The trained model has increased the speed of motion planning by up to 820 times and improved the success rates of obstacle crossing under harsh conditions, such as low friction and high roughness.

• Advances in aircraft and spacecraft science
• /
• 제4권3호
• /
• pp.237-267
• /
• 2017

Automatic trajectory re-planning is an integral part of unmanned aerial vehicle mission planning. In order to be able to perform this task, it is necessary to dispose of formulas or tables to assess the flyability of various typical flight segments. Notwithstanding their importance, there exist such data only for some particularly simple segments such as rectilinear and circular sub-trajectories. This article presents an analysis of a new, very efficient, way for an airplane to fly on an inclined circular trajectory. When it flies this way, the only thrust required is that which cancels the drag. It is shown that, then, much more inclined trajectories are possible than when they fly at constant speed. The corresponding equations of motion are solved exactly for the position, the speed, the load factor, the bank angle, the lift coefficient and the thrust and power required for the motion. The results obtained apply to both types of airplanes: those with internal combustion engines and propellers, and those with jet engines. Conditions on the trajectory parameters are derived, which guarantee its flyability according to the dynamical properties of a given airplane. An analytical procedure is described that ensures that all these conditions are satisfied, and which can serve for producing tables from which the trajectory flyability can be read. Sample calculations are shown for the Cessna 182, a Silver Fox like unmanned aerial vehicle, and an F-16 jet airplane.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2011년도 춘계학술대회 논문집
• /
• pp.311-312
• /
• 2011

• Advances in aircraft and spacecraft science
• /
• 제7권1호
• /
• pp.53-78
• /
• 2020

Automatic trajectory planning is an important task that will have to be performed by truly autonomous vehicles. The main method proposed, for unmanned airplanes to do this, consists in concatenating elementary segments of trajectories such as rectilinear, circular and helical segments. It is argued here that because these cannot be expected to all be flyable at a same constant speed, it is necessary to consider segments on which the airplane accelerates or decelerates. In order to preserve the planning advantages that result from having the speed constant, it is proposed to do all speed changes at maximum deceleration or acceleration, so that they are as brief as possible. The constraints on the load factor, the lift and the power required for the motion are derived. The equation of motion for such accelerated motions is solved numerically. New results are obtained concerning the value of the angle and the speed for which the longest distance and the longest duration glides happen, and then for which the steepest, the fastest and the most fuel economical climbs happen. The values obtained differ from those found in most airplane dynamics textbooks. Example of tables are produced that show how general speed changes can be effected efficiently; showing the time required for the changes, the horizontal distance traveled and the amount of fuel required. The results obtained apply to all internal combustion engine-propeller driven airplanes.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1136-1139
• /
• 1996

For on-line trajectory planning such as teleoperation it is desirable to keep good manipulability of the robot manipulators since the motion command is not given in advance. To keep good manipulability means the capability of moving any arbitrary directions of task space. An optimization process with different manipulability measures are performed and compared for a redundant robot system moving in 2-dimensional task space, and gives results that the conventional manipulability ellipsoid based on the Jacobian matrix is not good choice as far as the optimal direction of motion is concerned.

• Advances in aircraft and spacecraft science
• /
• 제5권1호
• /
• pp.73-105
• /
• 2018

A particular type of constant speed helical trajectory, with variable ascension rate, is proposed. Such trajectories are candidates of choice as motion primitives in automatic airplane trajectory planning; they can also be used by airplanes taking off or landing in limited space. The equations of motion for airplanes flying on such trajectories are exactly solvable. Their solution is presented, together with an analysis of the restrictions imposed on the geometrical parameters of the helical paths by the dynamical abilities of an airplane. The physical quantities taken into account are the airplane load factor, its lift coefficient, and the thrust its engines can produce. Formulas are provided for determining all the parameters of trajectories that would be flyable by a particular airplane, the final altitude reached, and the duration of the trajectory. It is shown how to construct speed interval tables, which would appreciably reduce the calculations to be done on board the airplane. Trajectories are characterized by their angle of inclination, their radius, and the rate of change of their inclination. Sample calculations are shown for the Cessna 182, a Silver Fox like unmanned aerial vehicle, and the F-16 Fighting Falcon.

• International Journal of Control, Automation, and Systems
• /
• 제4권2호
• /
• pp.217-226
• /
• 2006

Grasping and manipulation by hands can be considered as one of inevitable functions to achieve the performances desired in humanoid operations. When a humanoid robot manipulates an object by his hands, each finger should be well-controlled to accomplish a precise manipulation of the object grasped. So, the trajectory of each joint required for a precise finger motion is fundamentally necessary to be planned stably. In this sense, this paper proposes an effective joint motion planning method for humanoid fingers. The proposed method newly employs a bio-mimetic concept for joint motion planning. A suitable model that describes an interphalangeal coordination in a human finger is suggested and incorporated into the proposed joint motion planning method. The feature of the proposed method is illustrated by simulation results. As a result, the proposed method is useful for a facilitative finger motion. It can be applied to improve the control performance of humanoid fingers or prosthetic fingers.

• 로봇학회논문지
• /
• 제16권3호
• /
• pp.283-290
• /
• 2021

We propose a task and motion planning algorithm for clearing obstacles and wiping surfaces, which is essential for surface disinfection during the pathogen disinfection process. The proposed task and motion planning algorithm determines task parameters such as grasping pose and placement location during the planning process without using pre-specified or discretized values. Furthermore, to quickly inspect many unit motions, we propose a motion feasibility prediction algorithm consisting of collision checking and an SVM model for inverse mechanics and self-collision prediction. Planning time analysis shows that the feasibility prediction algorithm can significantly increase the planning speed and success rates in situations with multiple obstacles. Finally, we implemented a hierarchical control scheme to enable wiping motion while following a planner-generated joint trajectory. We verified our planning and control framework by conducted an obstacle-clearing and surface wiping experiment in a simulated disinfection environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 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.