• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.1886-1887
• /
• 2011

본 논문은 군집 로봇 포메이션 이동 제어를 위한 방법을 제안한다. Potential field method 알고리즘을 이용하여 Leader-Bot의 장애물 회피와 이동 경로를 계획한다. Leader-bot을 기준으로 하는 Follewer-bot의 포메이션 형성을 위해 Formation generated function을 사용한다. Leader-bot과 Follower-bot들 간에 충돌회피와 Follower-bot들의 장애물 회피를 위해 Potential function을 적용한다. 제안한 방법은 시뮬레이션을 통하여 실제 운용 가능성을 검증한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.3
• /
• pp.15-20
• /
• 2024

Path planning for unmanned aerial vehicles (UAV) is crucial in avoiding collisions with obstacles in complex environments that include both static and dynamic obstacles. Path planning algorithms like RRT and A^* are effectively handle static obstacle avoidance but have limitations with increasing computational complexity in high-dimensional environments. Reinforcement learning-based algorithms can accommodate complex environments, but like traditional path planning algorithms, they struggle with training complexity and convergence in higher-dimensional environment. In this paper, we proposed a reinforcement learning model utilizing a cell decomposition algorithm. The proposed model reduces the complexity of the environment by decomposing the learning environment in detail, and improves the obstacle avoidance performance by establishing the valid action of the agent. This solves the exploration problem of reinforcement learning and improves the convergence of learning. Simulation results show that the proposed model improves learning speed and efficient path planning compared to reinforcement learning models in general environments.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.148-156
• /
• 2011

This paper presents an implementation of autonomous navigation of a mobile robot indoors. It explains methods for map building, localization, obstacle avoidance and path planning. Geometric map is used for localization and path planning. The localization method calculates sensor data based on the map for comparison with the real sensor data. Monte Carlo Localization(MCL) method is adopted for estimation of the robot position. For obstacle avoidance, an artificial potential field generates repulsive and attractive force to the robot. Dijkstra algorithm plans the shortest distance path from a start position to a goal point. The methods integrate into autonomous navigation method and implemented for indoor navigation. The experiments show that the proposed method works well for safe autonomous navigation.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.913-917
• /
• 1994

A collision-free geometric path for industrial articulated robot is searched among polyhedral obstacles considering kinematic charcteristics. Then minimum-time control of the geometric path is studied considering dynamic characteristics. The algorithm is simulated on PC for maximum speed, moving time and so forth.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.4
• /
• pp.27-35
• /
• 1998

Navigation is a method to direct a mobile robot without collision when traversing the environment. This is to reach a destination without getting lost. In this paper, global and local path planning in fixed obstacle and moving obstacle using genetic algorithm are presented. First, mobile robot searches optimal global path using genetic algorithm without falling into local minima. Then if it finds a unknown obstacle, it searches new path without crashing obstacle. Also if there is a moving obstacle, mobile robot searches new optimal path without colliding with the obstacles. Various simulation results show the proposed algorithm can search a shortest path effectively.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.10
• /
• pp.44-52
• /
• 1990

A collision-free trajectory planning for two robots with designated paths is considered. The proposed method is based on the concept of decomposing the planning problem into two steps: one is determining coordination of two robots, and the other is velocity planning with determined coordination. Dynamics and maximum allowable joint velocities are also taken into consideration in the whole planning process. The proposed algorithm is converted into numerical calculation version based on neural optimization network. To show the usefulness of proposed method, an example of trajectory planning for 2 SCARA type robot in common workspace is illustrated.

• 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.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.11
• /
• pp.1193-1199
• /
• 2014

To achieve safe and high-speed navigation of a mobile service robot, velocity of dynamic obstacles should be considered while planning the trajectory of a mobile robot. Trajectory planning schemes without considering the velocity of the dynamic obstacles may collide due to the relative velocities or dynamic constraints. However, the general planning schemes that considers the dynamic obstacle velocities requires long computational times. This paper proposes a velocity control scheme by scaling the time step of trajectory to deal with dynamic obstacle avoidance problem using the RNLVO (Robot Nonlinear Velocity Obstacles). The RNLVO computes the collision conditions on the basis of the NLVO (Nonlinear Velocity Obstacles). The simulation results show that the proposed scheme can deal with collision state in a short period time. Furthermore, the RNLVO computes the collisions using the trajectory of the robot. As a result, accurate prediction of the moving obstacles trajectory does not required.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.1892-1893
• /
• 2011

본 논문에서는 Centroidal Voronoi Tessellation을 이용하여 군집로봇의 협조탐색을 위한 공간분할기법을 제안한다. 탐색공간은 Centroidal Voronoi Tessellation을 이용하여 분할한다. 전역 경로 계획 및 군집 로봇 간의 충돌 회피는 포텐셜 필드를 이용한다. 탐색공간에 밀도 함수를 사용하여 공간분할의 유동성을 부여한다. 마지막으로, 군집로봇의 협조탐색의 가능성을 시뮬레이션을 통하여 확인한다.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.2
• /
• pp.63-70
• /
• 2012

The collision-free flight planning method based on the extended collision map is proposed for cooperation of multiple unmanned aerial vehicles (UAVs) in a common 3-dimensional workspace. First, a UAV is modeled as a sphere, taking its 3-D motions such as rolling into consideration. We assume that after entering the common workspace, the UAVs move along their straight paths until they depart from the workspace, and that the priorities of the UAVs are determined in advance. According to the assumptions, the collision detection problem between two spheres in $R^3$ can be reduced into the collision detection problem between a circle and a line in $R^2$. For convenience' sake and safety, the collision regions are approximated by collision boxes. Using the collision boxes, the entrance times of the UAVs are scheduled for collision avoidance among the UAVs. By this way, all UAVs can move in the common workspace without collisions with one another. For verifying the effectiveness of the proposed flight planning method, the simulation with 12 UAVs is carried out.