• The Journal of Korea Robotics Society
• /
• v.11 no.3
• /
• pp.127-132
• /
• 2016

For a practical mobile robot team such as carrying out a search and rescue mission in a disaster area, the localization have to be guaranteed even in an environment where the network infrastructure is destroyed or a global positioning system (GPS) is unavailable. The proposed architecture supports localizing robots seamlessly by finding their relative locations while moving from a global outdoor environment to a local indoor position. The proposed schemes use a cooperative positioning system (CPS) based on the two-way ranging (TWR) technique. In the proposed TWR-based CPS, each non-localized mobile robot act as tag, and finds its position using bilateral range measurements of all localized mobile robots. The localized mobile robots act as anchors, and support the localization of mobile robots in the GPS-shadow region such as an indoor environment. As a tag localizes its position with anchors, the position error of the anchor propagates to the tag, and the position error of the tag accumulates the position errors of the anchor. To minimize the effect of error propagation, this paper suggests the new scheme of full-mesh based CPS for improving the position accuracy. The proposed schemes assuring localization were validated through experiment results.

• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2435-2437
• /
• 2004

In this paper, an obstacle avoidance algorithm is proposed for a network-based robot considering network delay by distribution. The proposed algorithm is based on the VFH(Vector Field Histogram) algorithm, and for the network-based robot system, in which it is assumed robot localization information is transmitted through network communication. In this paper, target vector for the VFH algorithm is estimated through the robot localization information and the measurement of its delay by distribution. The delay measurement is performed by time-stamp method. To synchronize all local clocks of the nodes distributed on the network, a global clock synchronization method is adopted. With the delay measurement, the robot localization estimation is performed by calculating the kinematics of the robot. The validation of the proposed algorithm is performed through the performance comparison of the obstacle avoidance between the proposed algorithm and the existing VFH algorithm on the network-based autonomous mobile robot.

• ETRI Journal
• /
• v.37 no.2
• /
• pp.262-272
• /
• 2015

In particular, for a practical mobile robot team to perform such a task as that of carrying out a search and rescue mission in a disaster area, the network connectivity and localization have to be guaranteed even in an environment where the network infrastructure is destroyed or a Global Positioning System is unavailable. This paper proposes the new collective intelligence network management architecture of multiple mobile robots supporting seamless network connectivity and cooperative localization. The proposed architecture includes a resource manager that makes the robots move around and not disconnect from the network link by considering the strength of the network signal and link quality. The location manager in the architecture supports localizing robots seamlessly by finding the relative locations of the robots as they move from a global outdoor environment to a local indoor position. The proposed schemes assuring network connectivity and localization were validated through numerical simulations and applied to a search and rescue robot team.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.8
• /
• pp.971-980
• /
• 2010

In this paper, we present a navigation control algorithm for mobile robots that move in environments having static and moving obstacles. The algorithm includes a global and a local path-planning algorithm that uses $D^*$ search algorithm, a fuzzy logic for determining the immediate level of danger due to collision, and a fuzzy logic for evaluating the required wheel velocities of the mobile robot. To apply the $D^*$ search algorithm, the two-dimensional space that the robot moves in is decomposed into small rectangular cells. The algorithm is verified by performing simulations using the Python programming language as well as by using the dynamic equations for a two-wheeled mobile robot. The simulation results show that the algorithm can be used to move the robot successfully to reach the goal position, while avoiding moving and unknown static obstacles.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.9
• /
• pp.803-812
• /
• 2000

In this paper we introduce a model based centralized hierarchical controller for cooperative team of soccerplaying multiple mobile robots. The hierarchical controller is composed of high-level and low-level controllers. Using the coordinates information of objects from the vision are simple models of multiple mobile tobots on the playground. Subsequently, the high level controller selects and action model corresponding to the perceived state transition model and generates subgoal and goal-velocity, from which the low level controller generates trajectory of each wheel velocity of the robot. This two layered simplicity. The feasubility of the control strategy has been demonstrated in an implementation for real soccer games at a MiroSot league.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.5
• /
• pp.377-388
• /
• 2020

In this paper, the autonomous mobile robot whit only LRF sensors proposes an algorithm for avoiding moving obstacles in an environment where a global map containing fixed obstacles. First of all, in oder to avoid moving obstacles, moving obstacles are extracted using LRF distance sensor data and a global map. An ellipse-shaped safety radius is created using the sum of relative vector components between the extracted moving obstacles and of the autonomuos mobile robot. Considering the created safety radius, the autonomous mobile robot can avoid moving obstacles and reach the destination. To verify the proposed algorithm, use quantitative analysis methods to compare and analyze with existing algorithms. The analysis method compares the length and run time of the proposed algorithm with the length of the path of the existing algorithm based on the absence of a moving obstacle. The proposed algorithm can be avoided by taking into account the relative speed and direction of the moving obstacle, so both the route and the driving time show higher performance than the existing algorithm.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.4
• /
• pp.223-232
• /
• 2003

This paper presents a new method driving multiple robots to their goal position without collision. Each robot adjusts its motion based on the information on the goal location, velocity, and position of the robot and the velocity and position of the .other robots. To consider the movement of the robots in a work area, we adopt the concept of avoidability measure. The avoidability measure figures the degree of how easily a robot can avoid other robots considering the following factors: the distance from the robot to the other robots, velocity of the robot and the other robots. To implement the concept in moving robot avoidance, relative distance between the robots is derived. Our method combines the relative distance with an artificial potential field method. The proposed method is simulated for several cases. The results show that the proposed method steers robots to open space anticipating the approach of other robots. In contrast, the usual potential field method sometimes fails preventing collision or causes hasty motion, because it initiates avoidance motion later than the proposed method. The proposed method can be used to move robots in a robot soccer team to their appropriate position without collision as fast as possible.

• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.11
• /
• pp.103-106
• /
• 1996

In this paper, we proposed the design and algorithm of force reflection joystick which control mobile robot as a rehabilitation assistance system. The disabled persons are poor at joystick control because of hand vibration and clumsiness in operating it. These problems bring tasks which concerned with operator's safety So there is required technique which prevent collision with wall or obstacles. One of these solution is force reflection joystick which disturb that robot is closed to the wall. To confirm this way, we experimented and simulated with force reflection joystick which attached torque controller.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.209-218
• /
• 2022

Today, with the development of the Internet and mobile technology, consumers' purchasing patterns have shifted from offline to online. In addition, due to the recent COVID-19, online purchases have significantly increased, and accordingly, the courier industry for logistics delivery has also grown significantly. Various logistics robots are being operated in many industrial and can reduce the labor intensity and physical and mental fatigue of workers. However, if the logistics robot does not properly recognize the people or environment around it, it can lead to a serious accident. We conducted that how logistics robots can perform safe work in a working environment such as a logistics warehouse through the application of ISO/DIS 21448 (SOTIF) to autonomous logistics transport robots. This result is expected to contribute to the operation of unmanned logistics warehouses using AGV.

• Journal of Computing Science and Engineering
• /
• v.2 no.4
• /
• pp.321-338
• /
• 2008

This paper presents a Modified Multiple Depth First Search algorithm for the exploration of the indoor environments occupied with obstacles in random distribution. The proposed algorithm was designed and implemented to employ one or a team of Khepera II mini robots for the exploration process. In case of multi-robots, the BlueCore2 External Bluetooth module was used to establish wireless networks with one master robot and one up to three slaves. Messages are sent and received via the module's Universal Asynchronous Receiver/Transmitter (UART) interface. Real exploration experiments were performed using locally developed teleworkbench with various autonomy features. In addition, computer simulation tool was also developed to simulate the exploration experiments with one master robot and one up to ten slaves. Computer simulations were in good agreement with the real experiments for the considered cases of one to one up to three networks. Results of the MMDFS for single robot exhibited 46% reduction in the needed number of steps for exploring environments with obstacles in comparison with other algorithms, namely the Ants algorithm and the original MDFS algorithm. This reduction reaches 71% whenever exploring open areas. Finally, results performed using multi-robots exhibited more reduction in the needed number of exploration steps.