• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1995년도 추계학술대회 논문집
• /
• pp.327-330
• /
• 1995

If a mobile robot is used in a real situation, robot must face a moving obstacles. In that case, the collision avoidance algorithm for moving obstacle is a indispensible element in mobile robot control. We csrried out a research to find and evaluate the advanced algorithm for mobile robot. At first we generate the continous path for mobi;e robot. Then by creating a curved path for avoidance, the mobile robot can change its path smoothly. Smoothed path made the robot adapt more effectively to the changing of path. Under time-varying condition, computer simulation was performed to show the validation of proposed algorithm.

• 로봇학회논문지
• /
• 제5권1호
• /
• pp.41-47
• /
• 2010

This paper proposes a path planning method of a mobile robot in two-dimensional work space. The path planning method is based on a cell decomposition approach. To create a path which consists of a number of line segments, the Delaunay Triangulation algorithm is used. Using the cells produced by the Delaunay Triangulation algorithm, a mesh generation algorithm connects the starting position to the goal position. Dijkstra algorithm is used to find the shortest distance path. Greedy algorithm optimizes the path by deleting the path segments which detours without collision with obstacles.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.627-634
• /
• 1989

A collision-free trajectory planning algorithm using the iterative learning concept is proposed for dual robot arms in a 3-D 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 the operating time is near-minimal.

• International Journal of Precision Engineering and Manufacturing
• /
• 제7권1호
• /
• pp.35-41
• /
• 2006

In this paper, we develop anti-sway control in proposed techniques for an ATC system. The developed algorithm is to build the optimal path of container motion and to calculate an anti-collision path for collision avoidance in its movement to the finial coordinate. Moreover, in order to show the effectiveness in this research, we compared NNP PID controller to be tuning parameters of controller using NN with 2-DOF PID controller. The experimental results jar an ATC simulator show that the proposed control scheme guarantees performances, trolley position, sway angle, and settling time in NNP PID controller than other controller. As a result, the application of NNP PID controller is analyzed to have robustness about disturbance which is wind of fixed pattern in the yard.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.690-693
• /
• 2004

This paper proposes a multi-resolution electrostatic potential field (MREPF) based solution to the mobile robot path planning and collision avoidance problem in 2D dynamic environment. The MREPF is an environment method in calculation time and updating field map. The large scale resolution map is added to EPF and this resolution map interacts with the small scale resolution map to find an optimal solution in real time. This approach can be interpreted with Atlantis model. The simulation studies show the efficiency of the proposed algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.635-642
• /
• 1989

We formulated the multi-robot trajectory problem into a series of NLP problem, each of which is that of finding the optimal tip positions of the robots for the next time step. The NLP problem is composed of an objective function and three constraints, namely: a) Joint position limits, b) Joint velocity limits, and c) Collision-avoidance constraints. By solving a series of NLP problem, optimally coordinated trajectories can be determined without requiring any prior path information. This is a novel departure from the previous approach in which either all paths or at least one path is assumed to be given. Practical application of the developed method is for optimal synthesis of multiple robot trajectories in off-line. To test the validity and effectiveness of the method, numerical examples are illustrated.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.415-415
• /
• 2000

The functions of a mobile robot such as obstacle knowledge and collision avoidance for in-door cleaning are necessary features, as has been much studied in the field of industrial automatic guided vehicle or general mobile robot. A mobile robot, in order to avoid collision with obstacles, has to gather data with environment knowledge sensors and recognize environment and the shape of obstacles from the data. In the study, a wall-following algorithm was suggested as a autonomous moving algorithm in which a mobile robot can recognize obstacles in indoor like environment and do cleaning work in effect. The system suggested in the study is for cleaning of nuclear material dusts generated in the process of nuclear fuel manufacturing and decontamination of devices in disorder which is performed in M6 radioactive ray shield hot-cell in IMEF(Irradiated Material Examination Facility) in the Korea Atomic Energy Research Institute.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 추계학술대회 논문집
• /
• pp.554-557
• /
• 2002

This paper describes power potential field method for the collision-free path planning of stereo-vision based mobile robot. Area based stereo matching is performed for obstacle detection in uncertain environment. The repulsive potential is constructed by distributing source points discretely and evenly on the boundaries of obstacles and superposing the power potential which is defined so that the source potential will have more influence on the robot than the sink potential when the robot is near to source point. The mobile robot approaches the goal point by moving the robot directly in negative gradient direction of the main potential. We have investigated the possibility of power potential method for the collision-free path planning of mobile robot through various experiments.

• 대한전기학회논문지
• /
• 제41권7호
• /
• pp.809-822
• /
• 1992

A mathematical approach to solving the time-varying obstacle avoidance problem is pursued. The mathematical formulation of the problem is given in robot joint space(JS). View-time concept is used to deal with time-varying obstacles. The view-time is the period in which a time-varying obstacles. The view-time is the period in which a time-varying obstacle is viewed and approximated by an equivalent stationary obstacle. The equivalent stationary obstacle is the volume swept by the time-varying obstacle for the view-time. The swept volume is transformed into the JS obstacle that is the set of JS robot configurations causing the collision between the robot and the swept volume. In JS, the path avoiding the JS obstacle is planned, and a trajectory satisfying the constraints on robot motion planning is planned along the path. This method is applied to the collision-free motion planning of two SCARA robots, and the simulation results are given.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4429-4445
• /
• 2019

As low-power and low-rate WSNs are being widely used for industrial applications, the scheduling of such applications becomes a critical issue to guarantee meeting the stringent requirements of determinism and tight latencies. This paper studies the link scheduling problem for real-time industrial applications in time-slotted channel hopping (TSCH) networks. We propose a heuristic algorithm for centralized link scheduling referred to as path-collision aware least laxity first (PC-LLF) algorithm, which dynamically prioritizes the packets based on the laxity time to the end-to-end deadlines and the amount of collisions that messages might deal with along their designated paths to the destination device. We propose schedulability analysis of real-time applications scheduled under our prioritization approach over TSCH networks, based on the literature on real-time schedulability analysis of multiprocessors and distributed systems. We show that our methodology provides an improved schedulability condition with respect to the existing approaches. Performance evaluation studies quantify to quantify the performance of our proposed approach under a variety of scenarios.