• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.32 no.3D
• /
• pp.259-267
• /
• 2012

The development of construction automation systems is proposed as a potent solution to the difficulties encountered by the construction industry and the preparation for the rapidly changing construction environment. A research concerning an intelligent excavation system has taken place since 2006. The intelligent excavation system has several functions for environment sensing, 3D site modeling, work planning, work path generation, unmaned control, and information management. This paper presents a space information model and a work path simulator for work planning and work path generation which is one of key technologies required to apply the earthwork system to the real world. A data structure for an earthwork site is suggested. It overcomes the limitations of previous data structures such as Quadtree and Octree. The work path simulator can generate an effective work path with considering information on work environment, equipment and operator's heuristic. The work path generated by the simulator is compared with that suggested by human operators.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.366-368
• /
• 2009

본 논문에서는 모바일 로봇이 작업하는 공간상에서 빠르고 안전한 최적 경로계획을 수행할 수 있게 하는 가변적 리드 맵을 이용한 장애물 밀집 정보 기반 경로계획을 제안한다. 모바일 로봇이 작업 공간에 대해서 빠르고 안전한 경로계획을 해 클러스터링 기법을 이용하여 정적 및 동적 장애물의 분포에 대한 맵 정보를 재구성하여 정보화 시킨다. 최적의 경로계획을 위해서는 재구성된 장애물 밀집 클러스터 데이터를 이용하여 전통적 기법의 GA 방법을 변형한 최적 경로계획을 수행한다. 제안한 기술의 효율성을 검증하기 위해 그리드 기반 경로계획 중의 하나인 A*알고리즘과 다양한 맵을 이용하여 성능 비교를 수행하였다. 실험결과 제안한 경로계획 기술은 기존 알고리즘 보다 빠른 처리 성능과 동적 장애물이 밀집한 지역을 회피하는 최적 경로계획을 수행함을 확인하였다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.8
• /
• pp.907-914
• /
• 2014

A heuristic search algorithm is proposed to plan a collision free path for robots in an indoor environment. The proposed algorithm is to find a collision free path in the gridded configuration space by proposed heuristic graph search algorithm. The proposed algorithm largely consists of two parts : tunnel searching and path searching in the tunnel. The tunnel searching algorithm finds a thicker path from start grid to goal grid in grid configuration space. The tunnel is constructed with large grid defined as a connected several minimum size grids in grid-based configuration space. The path searching algorithm then searches a path in the tunnel with minimum grids. The computational time of the proposed algorithm is less than the other graph search algorithm and we analysis the time complexity. To show the validity of the proposed algorithm, some numerical examples are illustrated for robot.

• Journal of Radiation Protection and Research
• /
• v.30 no.1
• /
• pp.17-25
• /
• 2005

Since the safety of nuclear power plant has been becoming a big social issue the exposure dose of radiation for workers has been one of the important factors concerning the safety problem. The existing calculation methods of radiation dose used in the planning of radiation work assume that dose rate does not depend on the location within a work space thus the variation of exposure dose by different work path is not considered. In this study, a modified numerical method was presented to estimate the exposure dose during radiation work in radwaste storage considering the effects of the distance between a worker and sources. And a new numerical algorithm was suggested to search the optimal work path minimizing the exposure dose in pre-defined work space with given radiation sources. Finally, a virtual work simulation program was developed to visualize the exposure dose of radiation doting radiation works in radwaste storage and provide the capability of simulation for work planning. As a numerical example, a test radiation work was simulated under given space and two radiation sources, and the suggested optimal work path was compared with three predefined work paths. The optimal work path obtained in the study could reduce the exposure dose for the given test work. Based on the results, tile developed numerical method and simulation program could be useful tools in the planning of radiation work.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2007.11a
• /
• pp.929-933
• /
• 2007

Concrete Pavement Cutting Operation have Labor-intensive features. And Cutting Operation quality and productivity is influenced by operator's experience. Moreover Workers have risk of safety concerns. Therefore we need Concrete Pavement Cutting Operation automation system and system support software development on the economics. First of all we have to develop driving Path Planning for Concrete Pavement Cutting automation system. If result of Path Planning connect with automation system, Weak points is a complement to the existing Path Planning and we can obtain effective automation system. Consequently this paper suggest method of Autonomous Driving Path Planning for Concrete Pavement Cutting Operation And the Path Planning system application.

• Korean Journal of Construction Engineering and Management
• /
• v.11 no.4
• /
• pp.68-79
• /
• 2010

During the last two decades, several tele-operated and machine-vision-assisted systems have been developed in construction and maintenance area such as pavement crack sealing, sewer pipe rehabilitation, and excavation. In developing such tele-operated and machine-vision-assisted systems, trajectory plans are very important tasks for optimal motions of robots whether their environments are structured or unstructured. This paper presents an optimal trajectory planning algorithm used for a machine-vision-assisted automatic pavement crack sealing system. In this paper, the performance of the proposed optimal trajectory planning algorithm is compared with the greedy trajectory plans which are used in previously developed pavement crack sealing systems. The comparison is based on computational cost versus overall gains in crack sealing efficiency. Finally, it is concluded that the proposed algorithm plays an important role in productivity improvement of the automatic pavement crack sealing system developed.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.2
• /
• pp.135-144
• /
• 1995

조립작업에 있어서의 경로계획(path planning)에 대하여 지금까지 많은 연구가 진행되어 왔으며, 그것의 주종을 이루는 것들은 cell decomposition 방식과 potential field 방식이다. 이러한 방식들은 free space를 세분하거나 potential field를 계산하는데 많은 시간을 필요로 하며, 조립부품 이동영역이 configuration space로 먼저 치환이 되어야 하는 문제점들이 발생하게 된다. 그러므로, 만약에 조립부품에 대한 이동환경이 복잡하지 않고 알려져 있으면 위의 방식들은 비용적인 면에서 많은 낭비를 가져온다. 본 논문에서는 간단하면서도 알려진 작업환경에서 효과적인 조립부품의 경로계획 알고리즘을 개발하였다. 먼저, channel, junction 및 간격 유지계수(clearance gap)의 개념을 도입하고, 이 개념들을 이용하여 룰 방식의 알고리즘을 개발하였다. 그리고, 이 알고리즘을 이동용 로봇의 경로계획에도 적용될 수 있음을 보였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1483-1490
• /
• 2009

This parer is presented multiple path-planning of unmanned autonomous forklift using modified genetic algorithm and fuzzy inference system. There are a task-level feedback method and a method that path is dynamically replaned in realtime while the autonomous vehicles are moving by means of an optimal algorithm for existing multiple path-planning. However, such methods cause malfunctions and inefficiency in the sense of time and energy, and path-planning should be dynamically replanned in realtime. To solve these problems, we propose multiple path-planning using modified genetic algorithm and fuzzy inference system and show the performance with autonomous vehicles. For experiment, we designed and built two autonomous mobile vehicles that equipped with the same driving control part used in actual autonomous forklift, and test the proposed multiple path-planning algorithm. Experimental result that actual autonomous mobile vehicle, we verified that fast optimized path-planning and efficient collision avoidance are possible.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.86-90
• /
• 2007

본 논문에서는 Particle Swarm Optimization(PSO) 기법을 이용한 이족보행로봇의 보행 계획방법을 제안한다. 이족보행로봇의 보행 프리미티브를 기반으로 PSO의 학습 및 군집 특성을 이용하여 장애물이 있는 작업공간에서 보행 계획을 수행하였다. 먼저 PSO의 탐색알고리즘을 사용하여 장애물을 회피하는 실행 가능한 보행 프리미티브들의 순서를 찾아내고 탐색된 순서를 바탕으로 경로 최적화 알고리즘을 수행하는 보행 계획방법을 제안하였다. 제안된 PSO 기반 이족보행로봇의 보행 계획방법은 모의실험을 통하여 발걸음 탐색 시간이 줄고 최적화된 보행 경로를 생성하는 것을 검증하였다.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.1
• /
• pp.98-106
• /
• 1991

Future generation of robots will be considerably more autonomous than present robotic systems. The main objective of research on theoretical problems in robotics is to endow robotics system with basic capabilities they will need to operate in an intelligent and autonomous manner. This paper discusses the problem of collision free movement of robot manipulator. It is formulated in path planning with obstacle avoidance expressed in the term of the distance between convex shapes in the three dimensional space. The examples are given to illustrate the main feature of the method.