• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.87-90
• /
• 1987

This paper gives the Sonic Range Finder(SRF) Array which detects the unknown obstacles on the mobile robot's path. This SRF Array gives mobile robot's circumstance information wider, processes and transfers them to the locomotion module to construct the modify path. In this system, 8 pairs of the 40 KHz ultrasonic sensors constitute the SRF Array, including a pair of reference sensors to correct the errors, 4051 analog multiplexer and demultiplexer swtch the sensor with time and 8031-on chip micro computer controls processes the data and communication the others.

• Journal of KIEE
• /
• v.10 no.1
• /
• pp.23-27
• /
• 2000

The relative degree one and weakly minimum-phase conditions have been major obstacles for passification of the given system. In this paper, a dynamic output feedback passifier which can remove the obstacles is presented. The proposed method does not require any modification of the given output except just adding a new term. Therefore, the scheme is more suitable for output feedback passification.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1939-1944
• /
• 2003

This paper presents a global path planning algorithm based on a visibility graph method, and applies additionally various constraints for constructing the reduced visibility graph. The modification algorithm for generating the rounded path is applied to the globally shortest path of the visibility graph using the robot size constraint in order to avoid the obstacle. In order to check the visibility in given 3D map data, 3D CAD data with VRML format is projected to the 2D plane of the mobile robot, and the projected map is converted into an image for easy map analysis. The image processing are applied to this grid map for extracting the obstacles and the free space. Generally, the tree size of visibility graph is proportional to the factorial of the number of the corner points. In order to reduce the tree size and search the shortest path efficiently, the various constraints are proposed. After short paths that crosses the corner points of obstacles lists up, the shortest path among these paths is selected and it is modified to the combination of the line path and the arc path for the mobile robot to avoid the obstacles and follow the rounded path in the environment. The proposed path planning algorithm is applied to the mobile robot LCAR-III.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.7
• /
• pp.631-636
• /
• 2007

An efficient obstacle avoidance algorithm is proposed in this paper to avoid dynamic obstacles using a collision vector while a tele-operated mobile robot is moving. For the verification of the algorithm, an operator watches through a monitor and controls the mobile robot with a force-reflection joystick. The force-reflection joystick transmits a virtual force to the operator through the Inter-net, which is generated by an adaptive impedance algorithm. To keep the mobile robot safe from collisions in an uncertain environment, the adaptive impedance algorithm generates the virtual force which changes the command of the operator by pushing the operator's hand to a direction to avoid the obstacle. In the conventional virtual force algorithm, the avoidance of moving obstacles was not solved since the operator cannot recognize the environment realistically by the limited communication bandwidth and the narrow view-angle of the camera. To achieve the dynamic obstacle avoidance, the adaptive virtual force algorithm is proposed based on the collision vector that is a normal vector from the obstacle to the mobile robot. To verify the effectiveness of the proposed algorithm, mobile robot navigation experiments with multiple moving obstacles have been performed, and the results are demonstrated.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.4
• /
• pp.362-367
• /
• 2011

The collision-free path of a manipulator should be regenerated in the real time to achieve collision safety when obstacles or humans come into the workspace of the manipulator. A probabilistic roadmap (PRM) method, one of the popular path planning schemes for a manipulator, can find a collision-free path by connecting the start and goal poses through the roadmap constructed by drawing random nodes in the free configuration space. The path planning method based on the configuration space shows robust performance for static environments which can be converted into the off-line processing. However, since this method spends considerable time on converting dynamic obstacles into the configuration space, it is not appropriate for real-time generation of a collision-free path. On the other hand, the method based on the workspace can provide fast response even for dynamic environments because it does not need the conversion into the configuration space. In this paper, we propose an efficient real-time path planning by combining the PRM and the potential field methods to cope with static and dynamic environments. The PRM can generate a collision-free path and the potential field method can determine the configuration of the manipulator. A series of experiments show that the proposed path planning method can provide robust performance for various obstacles.

• Industrial Engineering and Management Systems
• /
• v.3 no.1
• /
• pp.78-84
• /
• 2004

To optimize movement of a multi-joint robot arm is known to be a difficult problem, because it is a kind of redundant system. Although the end-effector is set its position by each angle of the joints, the angle of each joint cannot be uniquely determined by the position of the end-effector. There exist the infinite number of different sets of joint angles which represent the same position of the end-effector. This paper describes how to manage the angle of each joint to move its end-effector preferably on an X-Y plane with obstacles in the end-effector’s reachable area, and how to optimize the movement of a multi-joint robot arm, evading obstacles. The definition of “preferable” movement depends upon a purpose of robot operation. First, we divide viewpoints of preference into two, 1) the standpoint of the end-effector, and 2) the standpoint of joints. Then, we define multiple objective functions, and formulate it into a multi-objective programming problem. Finally, we solve it using multi-purpose genetic algorithm, and obtain reasonable results. The method described here is possible to add appropriate objective function if necessary for the purpose.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.137-143
• /
• 2005

Autonomous mobile robot has an ability to navigate using both map in known environment and sensors for detecting obstacles in unknown environment. In general, autonomous mobile robot navigates by global path planning on the basis of already made map and local path planning on the basis of various kinds of sensors to avoid abrupt obstacles. This paper provides a global path planning method using self-organizing feature map which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

• Journal of Information Processing Systems
• /
• v.14 no.6
• /
• pp.1457-1463
• /
• 2018

In recent times, Natural User Interface/Natural User Experience (NUI/NUX) technology has found widespread application across a diverse range of fields and is also utilized for controlling unmanned aerial vehicles (UAVs). Even if the user controls the UAV by utilizing the NUI/NUX technology, it is difficult for the user to easily control the UAV. The user needs an autopilot to easily control the UAV. The user needs a flight path to use the autopilot. The user sets the flight path based on the waypoints. UAVs normally fly straight from one waypoint to another. However, if flight between two waypoints is in a straight line, UAVs may collide with obstacles. In order to solve collision problems, flight records can be utilized to adjust the generated path taking the locations of the obstacles into consideration. This paper proposes a natural path generation method between waypoints based on flight records collected through UAVs flown by users. Bayesian probability is utilized to select paths most similar to the flight records to connect two waypoints. These paths are generated by selection of the center path corresponding to the highest Bayesian probability. While the K-means algorithm-based straight-line method generated paths that led to UAV collisions, the proposed method generates paths that allow UAVs to avoid obstacles.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1692-1699
• /
• 2004

In this paper, we propose a method to avoid obstacles that have unstable limit cycles in a chaos trajectory surface. We assume all obstacles in the chaos trajectory surface have a Van der Pol equation with an unstable limit cycle. We also show computer simulation results of Arnold equation, Chua's equation, Hyper-chaos equation, Hamilton equation and Lorenz chaos trajectories with one or more Van der Pol obstacles.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1128-1131
• /
• 1996

The collision-free path planning presented here uses linear parametric curve with one intermediate connection point between start and target points. The algorithm, in which connection point is organized in elliptic chord.(.theta., .delta.), maps objects in Euclidean Space into images in CPS through intersection check between path and obstacles a process defined as GM. Elliptic locus has special property that the total distance between focus points through a point on ellipse is the same regardless of .theta.. Hence by locating the start and target points to focus points of ellipse, and organizing connection point in elliptic coordinate, the .delta.-axis of CPS represents length of path. The GM of EWS requires calculation of interference in circumferential direction only. The procedures for GM is developed which include categorization of obstacles to reduce calculation amount. Simulations of GM of EWS, on a PC with Pentium/90MHz, is carried out to measure performance of algorithm and the results are reported on a table. The simulations are done for number of cases with different number of obstacles and location of start/target points.