• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.120.3-120
• /
• 2001

We propose a new method of path planning for cleaning robots. Path planning problem for cleaning robots is different from conventional path planning problems in which finding a collision-free trajectory from a start point to a goal point is focused. In the case of cleaning robots, however, a planned path should cover all area to be cleaned. To resolve this problem in a systematic way, we propose a method based on a graph model as follows: at first, partition a given map into proper regions, then transform a divided region to a vertex and a connectivity between regions to an edge of a graph. Finally, a region is divided into sub-regions so that the graph has a unary tree which is the simplest Hamilton path. The effectiveness of the proposed method is shown by computer simulation results.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.3
• /
• pp.217-225
• /
• 2016

In this paper, we propose an improved path planning method and obstacle avoidance algorithm for two-wheel mobile robots, which can be effectively applied in an environment where obstacles can be represented by circles. Firstly, we briefly introduce the rapidly exploring random tree (RRT) and single polar polynomial (SPP) algorithm. Secondly, we present additional two methods for applying our proposed method. Thirdly, we propose a global path planning, smoothing and obstacle avoidance method that combines the RRT and SPP algorithms. Finally, we present a simulation using our proposed method and check the feasibility. This shows that proposed method is better than existing methods in terms of the optimality of the trajectory and the satisfaction of the kinematic constraints.

• The Journal of Korea Robotics Society
• /
• v.16 no.2
• /
• pp.122-129
• /
• 2021

For the Simultaneous Localization and Mapping (SLAM) problem, a different path results in different SLAM results. Usually, SLAM follows a trail of input data. Active SLAM, which determines where to sense for the next step, can suggest a better path for a better SLAM result during the data acquisition step. In this paper, we will use reinforcement learning to find where to perceive. By assigning entire target area coverage to a goal and uncertainty as a negative reward, the reinforcement learning network finds an optimal path to minimize trajectory uncertainty and maximize map coverage. However, most active SLAM researches are performed in indoor or aerial environments where robots can move in every direction. In the urban environment, vehicles only can move following road structure and traffic rules. Graph structure can efficiently express road environment, considering crossroads and streets as nodes and edges, respectively. In this paper, we propose a novel method to find optimal SLAM path using graph structure and reinforcement learning technique.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.18 no.2
• /
• pp.115-124
• /
• 2015

A methodology is proposed to estimate a trajectory of a flying target and its velocity using the time and frequency analysis of the acoustic signal. The measurement of sound emitted from a flying acoustic source with a microphone above a ground shall receive both direct and ground-reflected sound waves. For certain frequency contents, the destructive interference happens in received signal waveform reflected path lengths are in multiple integers of direct path length. This phenomenon is referred to as the acoustical mirror effect and it can be observed in a spectrogram plot. The spectrogram of acoustic measurement for a flying vehicle measurement shows several orders of destructive interference curves. The first or second order of curve is used to find the best approximate path by using nonlinear least-square method. Simulated acoustic signal is generated for the condition of known geometric of a sensor and a source in flight. The estimation based on cepstrogram analysis provides more accurate estimate than spectrogram.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.8
• /
• pp.61-68
• /
• 2022

In this paper, we propose a system to predict the GPS trajectory of a pedestrian based on a deep learning model. Pedestrian trajectory prediction is a study that can prevent pedestrian danger and collision situations through notifications, and has an impact on business such as various marketing. In addition, it can be used not only for pedestrians but also for path prediction of unmanned transportation, which is receiving a lot of spotlight. Among various trajectory prediction methods, this paper is a study of trajectory prediction using GPS data. It is a deep learning model-based study that predicts the next route by learning the GPS trajectory of pedestrians, which is time series data. In this paper, we presented a data set construction method that allows the deep learning model to learn the GPS route of pedestrians, and proposes a trajectory prediction deep learning model that does not have large restrictions on the prediction range. The parameters suitable for the trajectory prediction deep learning model of this study are presented, and the model's test performance are presented.

• Journal of Aerospace System Engineering
• /
• v.13 no.3
• /
• pp.70-77
• /
• 2019

This study presents the numerical investigation of the trajectory of rocket launched from a helicopter. The nonlinear mathematical model of armed configuration of UH-60 helicopter was developed while Hydra 70 unguided rocket was modeled to simulate the rocket behavior. The effects of various inflow models on the launched rocket trajectory are obtained. Similarly, rocket launch simulation was performed to determine the unsafe flight maneuver condition where the rocket trajectory is critically close to the helicopter main rotor tip path plane.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.51-56
• /
• 2011

The train travels on the track and, thus, the rear wheels precisely follow the paths of the front wheels. On the contrary, in the vehicles running on the road like automobiles, buses and trucks, the front wheels try to drag the rear ones toward them and across the inside of the curve. Off-tracking is defined as the radial offset between the path of the centerline of the front axle and the path of the centerline of the following axle. In the case of the bimodal tram with AWS(all wheel steering), the off-tracking decrease but the rear swing-out values increase because of the rear steering at the reverse phase angle. Thus, in order to determine the swept path width, maximum road width at the minimum turning radius, off-tracking and swing-out should be considered for the bimodal tram. In this paper, trajectory simulations were carried out for the various condition such as front steering, front and rear steering and suppression of swing-out to optimize the swept path width.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.78-83
• /
• 2007

The paper focuses on the establishment of optimized bucket path planning and trajectory control designated for force-reflecting backhoe reacting to excavation environment, such as potential obstacles and ground characteristics. The developed path planning method can be used for precise bucket control, and more importantly for obstacle avoidance which is directly related to safety issues. The platform of this research was based on conventional papers regarding the kinematic model of excavator. Jacobian matrix was constructed to find optimal joint angles and rotation angles of bucket from position and orientation data of excavator. By applying Newton-Raphson method optimal joint angles and bucket orientation were derived simultaneously in the way of minimizing positional errors of excavator. The model presented in this paper was intended to function as a cornerstone to build complete and advanced path planning of excavator by implementing soil mechanics and further study of excavator dynamics together.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.1
• /
• pp.53-60
• /
• 2010

We propose a motion planning method for autonomous mobile robots. In order to minimize traveling time, a smooth path and a time optimal velocity profile should be generated under kinematic and dynamic constraints. In this paper, we develop an effective and practical method to generate a good solution with lower computation time. The initial path is obtained from voronoi diagram by Dijkstra's algorithm. Then the path is improved by changing the graph and path simultaneously. We apply the dynamic programming algorithm into the stage of improvement. Simulation results are presented to verify the performance of the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.882-885
• /
• 1987

The path of an industrial manipulator in a crowded workspace generally consists of 8 set of Cartesian straight line path connecting a set of two adjacent points. To achieve the Cartesian straight line path is, however, a nontrivial task and an alternative approach is to place enough intermediate points along a desired path and linearly interpolate between these points in the joint space. A method is developed that determines the subtravelling- and the transition-time such that the total travelling time for this path is minimized subject to the maximum joint velocities and accelerations constraint. The method is based on the application of nonlinear programming technique, i.e., FTM (Flexible Tolerance Method). These results are simulated on a digital computer using a six-joint revolute manipulator to show their applications.