• ETRI Journal
• /
• v.44 no.4
• /
• pp.641-653
• /
• 2022

In the process of autonomous vehicle motion planning and to create comfort for vehicle occupants, factors that must be considered are the vehicle's safety features and the road's slipperiness and smoothness. In this paper, we build a mathematical model based on the combination of a genetic algorithm and a neural network to offer lane-change solutions of autonomous vehicles, focusing on human vehicle control skills. Traditional moving planning methods often use vehicle kinematic and dynamic constraints when creating lane-change trajectories for autonomous vehicles. When comparing this generated trajectory with a man-generated moving trajectory, however, there is in fact a significant difference. Therefore, to draw the optimal factors from the actual driver's lane-change operations, the solution in this paper builds the training data set for the moving planning process with lane change operation by humans with optimal elements. The simulation results are performed in a MATLAB simulation environment to demonstrate that the proposed solution operates effectively with optimal points such as operator maneuvers and improved comfort for passengers as well as creating a smooth and slippery lane-change trajectory.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.72-75
• /
• 1988

Due to the fact that the set point regulation scheme by the variable structure control method concerns only the initial and final locations of a manipulator, many constraints may exist in the application of path tracking with obstracle avoidance. The variable structure parameter should be selected in the trajectory planning step by satisfying the constraints of the travel time and the path deviations This paper presents the selection algorithm of the variable structure parameters with the constraints of the system dynamics and the travel time and the path deviation. This study makes unify the trajectory planning and tracking control using the variable structure control method.

• Advances in aircraft and spacecraft science
• /
• v.5 no.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.

• Journal of Multimedia Information System
• /
• v.8 no.2
• /
• pp.121-130
• /
• 2021

Foot bionic robot could be supported and towed through a series of discrete footholds and be adapted to rugged terrain through attitude adjustment. The vibration isolation of the robot could decouple the fuselage from foot-end trajectories, thus, the robot walked smoothly even if in a significant terrain. The gait programming and foot end trajectory algorithm were simulated. The quadruped robot of parallel five linkages with eight degrees of freedom were tested. The kinematics model of the robot was established by setting the corresponding coordinate system. The forward and inverse kinematics of both supporting and swinging legs were analyzed, and the angle function of single leg driving joint was obtained. The trajectory planning of both supporting and swinging phases was carried out, based on the control strategy of compound cycloid foot-end trajectory planning algorithm with zero impact. The single leg was simulated in Matlab with the established kinematic model. Finally, the walking mode of the robot was studied according to bionics principles. The diagonal gait was simulated and verified through the foot-end trajectory and the kinematics.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.1
• /
• pp.69-77
• /
• 1991

A collision-free trajectory planning algorithm using an iterative learning concept is proposed for dual robot arms in a 3-D common workspace to accurately follow their specified paths with constant velocities. Specifically, a collision-free trajectory minimizing the trajectory error is obtained first by employing the linear programming technique. Then the total operating time is iteratively adjusted based on the maximum trajectory error of the previous iteration so that the collision-free trajectory has no deviation from the specified path and also that the operating time is near-minimal. To show the validity of the proposed algorithm, a numerical example is presented based on two planar robots.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.51-60
• /
• 1997

A practically applicable collision free trajectory planning technique for tow robot systems is proposed. The robot trajectories considered in this work are composed of many segments, an at the intersection points between segments robots stop to assemble, weld, ordo other jobs by the attached a end-effectors. The proposed method is based on the Planning-Coordination Decomposition where planning is to find a trajectory of each robot independently according to their tasks and coordination is to find a velocity modification profile to avoid collision with each other. To fully utilize the independently planned trajectories and to ensure no geometrical path deviation after coordination, we develop a simple technique added the minimal delay time to avoid collision just before moving along path segments. We determine the least delay time by the graphical method in the Coordination space where collisions and coordinations are easily visualized. We classify all possible cases into 3 group and derive the optimal solution for each group.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3197-3218
• /
• 2012

Compared with traditional itinerary planning, intention-oriented itinerary recommendations can provide more flexible activity planning without requiring the user's predetermined destinations and is especially helpful for those in unfamiliar environments. The rank and classification of points of interest (POI) from location-based social networks (LBSN) are used to indicate different user intentions. The mining of vehicles' physical trajectories can provide exact civil traffic information for path planning. This paper proposes a POI category-based itinerary recommendation framework combining physical trajectories with LBSN. Specifically, a Voronoi graph-based GPS trajectory analysis method is utilized to build traffic information networks, and an ant colony algorithm for multi-object optimization is implemented to locate the most appropriate itineraries. We conduct experiments on datasets from the Foursquare and GeoLife projects. A test of users' satisfaction with the recommended items is also performed. Our results show that the satisfaction level reaches an average of 80%.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.57 no.4
• /
• pp.334-341
• /
• 2021

The fishery compensation by marine spatial planning such as routeing of ships and offshore wind farms is required objective data on whether fishing vessels are engaged in a target area. There has still been no research that calculated the number of fishing operation days scientifically. This study proposes a novel method for calculating the number of fishing operation days using the fishing trajectory data when investigating fishery compensation in marine spatial planning areas. It was calculated by multiplying the average reporting interval of trajectory data, the number of collected data, the status weighting factor, and the weighting factor for fishery compensation according to the location of each fishing vessel. In particular, the number of fishing operation days for the compensation of driftnet fishery was considered the daily average number of large vessels from the port and the fishery loss hours for avoiding collisions with them. The target area for applying the proposed method is the routeing area of ships of Jeju outer port. The yearly average fishing operation days were calculated from three years of data from 2017 to 2019. As a result of the study, the yearly average fishing operation days for the compensation of each fishing village fraternity varied from 0.0 to 39.0 days. The proposed method can be used for fishery compensation as an objective indicator in various marine spatial planning areas.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.4
• /
• pp.2370-2378
• /
• 2015

This paper proposes an algorithm using Lagrange interpolation method to realize trajectory planning for torque minimization of robot manipulators. For the algorithm, position constraints of robot manipulators should be given and the stability of robot manipulators should be satisfied. In order to avoid Runge's phenomenon, we set up time interpolation points using Chebyshev interpolation points. After that, we found suitable angle which corresponds to the points and then we got trajectories of joint's angle, velocity, acceleration using Lagrange interpolation method. We selected performance index for torque consumption optimization of robot manipulator. The method went through repetitive computation process to have minimum value of the performance index by calculated trajectory. Through the process, we could get optimized trajectory to minimize torque and performance index and guarantee safety of the motion for manipulator performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1402-1407
• /
• 2004

Moving a fragile object from an initial point to a goal location in minimum time without damage is pursued in this paper. In order to achieve the goal, first of all, the range of maximum acceleration and velocity are specified, which the manipulator can generate dynamically on the path that is planned a priori considering the geometrical constraints. Later, considering the impulsive force constraint of the object, the range of maximum acceleration and velocity are going to be obtained to keep the object safe while the manipulator is carrying it along the curved path. Finally, a time-optimal trajectory is planned within the maximum allowable range of the acceleration and velocity. This time optimal trajectory planning can be applied for real applications and is suitable for not only a continuous path but also a discrete path.