• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.687-693
• /
• 2012

In this paper, we propose a optimal deployment method for cooperative exploration of swarm robots. The proposed method consists of two parts such as optimal deployment and path planning. The optimal area deployment is proposed by the K-mean Algorithm and Voronoi tessellation. The path planning is proposed by the potential field method and A* Algorithm. Finally, the numerical experiments demonstrate the effectiveness and feasibility of the proposed method.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2368-2371
• /
• 2003

알려지지 않은 환경에서 이동로봇이 목표점까지 이동하기 위해서는 외계센서를 이용하여 장애물을 인식하여 충돌 없이 주행할 수 있는 능력이 있어야하고 또한 인식된 장애물을 지도정보로 저장하여야 한다. 이렇게 생성된 지도정보를 이용하여 최적의 경로를 실시간으로 계획하면서 목표점까지 도달하여야 한다. 본 논문에서는 초음파 센서로 알려지지 않은 환경을 인식하여 선분지도를 생성하면서 생성된 선분지도를 이용하여 동적으로 최적의 경로계획을 위한 경로생성에 대하여 방법을 제시한다. 또한 실내 환경에서 모의실험을 통하여 실시간으로 경로계획이 가능함을 확인하였다.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• 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.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.5
• /
• pp.579-585
• /
• 2008

Recently, many researches on autonomous mobile system have been proposed, which are possible to recognize its surrounding environment and navigate to destination without supervisor's intervention. Various sensors are mounted on the autonomous systems in order for the systems to move to destination safely without any accident. In this paper, we design an ontology-based autonomous system mounted laser distance sensors and cameras, and propose a method to conceptualize sensing information. We show the validity of the proposed method through the experiments of the system's navigation.

• TTA Journal
• /
• s.173
• /
• pp.6-11
• /
• 2017

자율주행차는 센서와 인공지능으로 차량의 위치와 주변 상황을 인지하고 주행 경로를 계획하여, 자동차 스스로 교통법규에 따라 주행하는 차량이다. 이는 4차 산업혁명의 주역으로 2020년 상용화 될 전망이다. 2020년 자율주행차 세계 시장규모는 189억 달러로 예측되고 이를 위해 각국의 자동차사, ICT 업체들이 시장 선점을 위해 치열하게 경쟁하고 있다. 자율주행 상용화를 위한 기술적 해결 이슈로는 센서, 인공지능, 빅데이터 분석, 기능안전, 정밀지도, 신뢰성 높은 차량통신, 차량 SW 플랫폼, 차량 사이버 보안 등이 있다. 이러한 기술적 이슈가 해결되어야 2020년 자율주행차 시대를 맞이하고 새로운 시장이 열리게 될 것이다. 자율주행차 상용화를 위해서 차량, ICT 기술, 도로 인프라 등 산업 융합 및 기업체 간 협업이 기술개발과 사업화를 성공시키는 중요한 열쇠가 될 수 있다는 것을 강조하며, 이번 특집호를 통해 자율주행 실현을 위한 핵심기술 및 표준화에 대한 전체적인 흐름과 방향을 파악하는데 도움이 될 것으로 기대한다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2011.06a
• /
• pp.381-382
• /
• 2011

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.4
• /
• pp.887-895
• /
• 1995

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 subgoal and sub-subgoal searching methods. The subgoal searching finds the passable ways between obstacles and selects the optimal pathway in order to reduce the moving distanced from start point to given to given goal. On the other hand, the sub-subgoal searching corrects the path given in subgoal searching in the case of which the mobile robot will collide with obstacles. Also, the effectiveness of the established local path planning and local minimum avoiding algorithm are estimated by computer simulation and experimentation in complex environment.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.6
• /
• pp.803-812
• /
• 2017

This paper proposes a local path planning method for stable autonomous driving in rough terrain. There are various path planning techniques such as candidate paths, star algorithm, and Rapidly-exploring Random Tree algorithms. However, such existing path planning has limitations to reflecting the stability of unmanned ground vehicles. This paper suggest a path planning algorithm that considering the stability of unmanned ground vehicles. The algorithm is based on the genetic algorithm and assumes to have probability based obstacle map and elevation map. The simulation result show that the proposed algorithm can be used for real-time local path planning in rough terrain.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.493-498
• /
• 2004

A novel approach for path planning of a polygonal robot is presented. Traditional path planners perform extensive geometric searching to find the optimal path or to prove that there is no solution. The computation required to prove that there is no solution is equivalent to exhaustive search of the motion space, which is typically very expensive. Humans seems to use a set of several different path planning strategies to analyse the situation of the obstacles in the environment, and quickly recognize whether the path-planning problem is easy to solve, hard to solve or has no solution. This human path-planning strategies have motivated the development of the presented algorithm that combines qualitative shape reasoning and exhaustive geometric searching to speed up the path planning process. It has three planning stages consisting of identification of no-solution cases based on an enclosure test, a qualitative reasoning stage, and finally a complete search algorithm in case the previous two stages cannot determine of the existence of a solution path.

• Journal of Auto-vehicle Safety Association
• /
• v.11 no.3
• /
• pp.30-36
• /
• 2019

This paper suggests a car-following algorithm for urban environment, with multiple target candidates. Until now, advanced driver assistant systems (ADASs) and self-driving technologies have been researched to cope with diverse possible scenarios. Among them, car-following driving has been formed the groundwork of autonomous vehicle for its integrity and flexibility to other modes such as smart cruise system (SCC) and platooning. Although the field has a rich history, most researches has been focused on the shape of target trajectory, such as the order of interpolated polynomial, in simple single-lane situation. However, to introduce the car-following mode in urban environment, realistic situation should be reflected: multi-lane road, target's unstable driving tendency, obstacles. Therefore, the suggested car-following system includes both in-lane preceding vehicle and other factors such as side-lane targets. The algorithm is comprised of three parts: path candidate generation and optimal trajectory selection. In the first part, initial guesses of desired paths are calculated as polynomial function connecting host vehicle's state and vicinal vehicle's predicted future states. In the second part, final target trajectory is selected using quadratic cost function reflecting safeness, control input efficiency, and initial objective such as velocity. Finally, adjusted path and control input are calculated using model predictive control (MPC). The suggested algorithm's performance is verified using off-line simulation using Matlab; the results shows reasonable car-following motion planning.