• 한국전자통신학회논문지
• /
• 제6권1호
• /
• pp.148-156
• /
• 2011

본 논문은 실내 이동로봇의 자율주행 방법을 적용한 결과를 기술한다. 구체적으로 지도생성, 위치추정, 장애물 회피, 경로계획에 대해서 설명한다. 기하학적 지도는 위치추정과 경로계획에 이용된다. 위치 추정을 위해서 지도 정보를 이용하여 센서 데이터를 계산하고 이를 실제 센서 데이터와 비교한다. 위치 추정에는 몬테 카를로 위치 추정 방법을 사용한다. 인공 전위계를 사용하여 장애물로부터의 척력과 목표 위치로의 인력을 구하여 장물을 피한다. 경로계획을 위해 다익스트라 알고리즘을 이용하여 로봇의 출발 위치에서 목표 위치까지의 최단거리 경로를 구한다. 이러한 방법들이 통합하여 자율 주행 방법을 실제로 구현하여 실험하였다. 실제 실험을 통하여 제안한 방법이 로봇을 안전하게 자율주행하게 함을 확인하였다.

• 제어로봇시스템학회논문지
• /
• 제18권2호
• /
• pp.94-102
• /
• 2012

There have been many homing navigation algorithms for robotic system. In this paper, we suggest a bio-inspired navigation model. It builds path integration based on optical flow. We consider two factors on robot movements, translational movement and rotational movement. For each movement, we found distinguishable optical flows. Based on optical flow, we estimate ego-centric robot movement and integrate the path optimally. We can determine the homing direction and distance. We test this algorithm and evaluate the performance of homing navigation for robotic system.

• 한국정밀공학회지
• /
• 제20권10호
• /
• pp.141-147
• /
• 2003

This paper represents an absolute positioning system using a light navigation path for mobile robot. The absolute positioning system is composed of the projector unit which generates a laser beam using laser diode and mobile robot with the optical detector which has some optical sensors. The projector unit is fixed over the navigating plane of mobile robot to generate the light navigation path, and the optical detector located upper part of mobile robot detects the generated laser beam from the projector. The navigation of mobile robot is controlled by the micro-processor which compares the detected present position from the detector with the previously programmed navigation path. And experimental results show that our sensor system can be used for the absolute positioning system of the mobile robot.

• 제어로봇시스템학회논문지
• /
• 제17권5호
• /
• pp.471-478
• /
• 2011

This UGV (Unmanned Ground Vehicle) is not only widely used in various practical applications but is also currently being researched in many disciplines. In particular, obstacle avoidance is considered one of the most important technologies in the navigation of an unmanned vehicle. In this paper, we introduce a simple algorithm for path planning in order to reach a destination while avoiding a polygonal-shaped static obstacle. To effectively avoid such an obstacle, a path planned near the obstacle is much shorter than a path planned far from the obstacle, on the condition that both paths guarantee that the robot will not collide with the obstacle. So, to generate a path near the obstacle, we have developed an algorithm that combines an edge detection method and a limit-cycle navigation method. The edge detection method, based on Hough Transform and IR sensors, finds an obstacle's edge, and the limit-cycle navigation method generates a path that is smooth enough to reach a detected obstacle's edge. And we proposed novel algorithm to solve local minima using the virtual wall in the local vision. Finally, we verify performances of the proposed algorithm through simulations and experiments.

• 센서학회지
• /
• 제33권4호
• /
• pp.196-202
• /
• 2024

Path-planning, a critical component of mobile robot navigation, comprises both local and global planning. Previous studies primarily focused on enhancing the individual performance of these planners, avoiding obstacles, and computing an optimal global path from a starting position to a target position. In this study, we introduce a practical path-planning framework that employs a target planner to bridge the local and global planners; this enables mobile robots to navigate seamlessly and efficiently toward a global target position. The proposed target planner assesses the visibility of waypoints along the global path, and it selects a reachable navigation target, which can then be used to generate efficient control commands for the local planners. A visibility-based target planner can handle situations, wherein the current, target waypoint is occupied by unknown obstacles. Real-world experiments demonstrated that the proposed pathplanning framework with the visibility-based target planner allowed the robot to navigate to the final target position along a more efficient path than the framework without a target planner.

• 디자인학연구
• /
• 제19권2호
• /
• pp.81-90
• /
• 2006

보행자는 목적지로 이동하면서 도로의 경관이나 주변건물의 외관으로부터 다양한 인상을 받으며, 따라서 목적지가 동일한 경우에 있어서도 자신의 감성적 선호에 맞는 경로를 이동한 경우와 그렇지 않은 경우에 있어서의 네비게이션 만족도는 크게 달라진다. 본 논문에서는 이와 같이 보행자의 경로선택이 네비게이션 만족도에 미치는 영향에 주목하여 보행자가 자신의 감성에 맞는 경로를 탐색하는 방법을 검토하고, 이를 적용한 네비게이션 지원시스템의 구성요건을 PDA 단말기의 인터페이스 환경을 고려하여 제안하였다. 지원시스템은 보행자로부터 경로탐색요구가 주어졌을 때 목적지에 대한 정보와 보행자 자신의 경로에 대한 감성적선호도를 고려하여 경로후보를 탐색하고 보행자-지원시스템 사이의 인터랙션을 통하여 최적경로를 결정해가는 과정을 지원한다. 경로탐색은 경로의 감성평가에 사용된 감성표현용어 사이의 관계를 퍼지론적으로 정식화 한 키워드 결합행렬에 의하여 이루어진다. 본 논문에서 제시한 지원시스템의 시뮬레이션을 통해 보행자의 감성적 선호에 따라 서로 다른 경로의 탐색이 가능하게 됨으로써 네비게이션 지원을 위한 효율적인 정보제공 수단으로서의 활용 가능성을 확인하였다.

• 제어로봇시스템학회논문지
• /
• 제20권2호
• /
• pp.211-217
• /
• 2014

This paper addresses an algorithm of path planning for autonomous driving of a ground vehicle in waypoint navigation. The proposed algorithm is flexible in utilization under a large GPS positioning error and generates collision-free multiple paths while pursuing minimum traveling time. An optimal path reduces inefficient steering by minimizing lateral changes in generated waypoints along a path. Simulation results compare the proposed algorithm with the A* algorithm by manipulation of the steering wheel and traveling time, and show that the proposed algorithm realizes real-time obstacle avoidance by quick processing of path generation, and minimum time traveling by producing paths with small lateral changes while overcoming the very irregular positioning error from the GPS.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.551-553
• /
• 2006

An autonomous navigation technology for the mobile robot is investigated in this paper. The proposed robot path planning algorithm employs the dynamic programming to find the optimal path. The algorithm finds the global optimal path through the local computation on the environmental map. Since the robot computes the new path at every point, it can avoid the obstacle successfully during the navigation. The experimental results of the robot navigation are included in this paper.

• 제어로봇시스템학회논문지
• /
• 제11권4호
• /
• pp.363-368
• /
• 2005

This paper proposes an LOS(line-of-sight) guidance system of a ship for path following. From the viewpoint of a control configuration, guidance is a special type of compensation algorithm that is placed in front of the controller to accomplish navigational objects. A guidance system generates a reference trajectory for trajectory tracking or path control and decides the desired velocity, position and heading angle. A control system executes commands based on a reliable guidance law during navigation. An LOS vector from the vessel to a point on the path between two way-points in straight-line navigation or a point among turning circle in turning navigation is selected, and then a heading angle is calculated to converge the desired path based on the LOS vector. The LOS guidance law is defined for the straight-line and the turning circle, respectively. The effectiveness of the suggested LOS guidance system is assured through computer simulation.

• 한국정밀공학회지
• /
• 제12권1호
• /
• pp.58-67
• /
• 1995

A path planning algorithm using a laser range finder are presented for real-tiem navigation of an autonomous guided vehicle. Considering that the laser range finder has the excellent resolution with respect to angular and distance measurements, a sophisticated local path planning algorithm is achieved by using the human's heuristic method. In the case of which the man knows not rhe path, but the goal direction, the man forwards to the goal direction, avoids obstacle if it appears, and selects the best pathway when there are multi-passable ways between objects. These heuristic principles are applied to the path decision of autonomous guided vehicle such as forward open, side open and no way. Also, the effectiveness of the established path planning algorithm is estimated by computer simulation in complex environment.