• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.2
• /
• pp.268-275
• /
• 2011

This paper proposes two optimal path planning methods of a mobile robot using uDEAS (univariate Dynamic Encoding Algorithm for Searches). Before start of autonomous traveling, a self-controlled mobile robot must generate an optimal global path as soon as possible. To this end, numerical optimization method is applied to real time path generation of a mobile robot with an obstacle avoidance scheme and the basic path generation method based on the concept of knot and node points between start and goal points. The first improvement in the present work is to generate diagonal paths using three node points in the basic path. The second innovation is to make a smooth path plotted with the blending polynomial using uDEAS. Effectiveness of the proposed schemes are validated for several environments through simulation.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.36 no.3
• /
• pp.551-564
• /
• 2016

Earthworks are the fundamental steps in a construction job, and are mainly comprised of smaller tasks performed by construction machinery. The productivity of the construction job can be improved by optimizing excavation, filling, and other such operations. Earthworks involve a lot of mechanical work performed by the collaboration between various kinds of construction equipment, which in turn leads to higher fuel consumption. Actual earthworks depend mostly on the intuition and experience of the driver of the machines, thus leading to inefficiency and environmental problems caused by unnecessary emission of carbon, Recently automated and information-oriented technologies are consistently being researched towards the improvement of efficiency of earthworks in the construction industry. The present research involves the introduction and understanding of the decision-making elements of heuristics which can be applied to the earthwork planning. A method is also suggested for creating an effective work path for construction machine to perform task packages (TP) for cutting and filling processes. A simulation test is performed to verify the effectiveness of suggested methods in terms of space interference and total moving distance of construction equipment.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.4D
• /
• pp.433-442
• /
• 2010

Recent decrease in the availability of experienced skilled labor and a corresponding lack of new entrants has required the need for automating many of the construction equipment used in the construction industry. In particular, excavators are widely used throughout earthwork operations and automating its tasks enables work to be performed with higher productivity and safety. This paper introduces an optimal path generation method which is one of the core technologies required to make "Intelligent" excavators a reality. The method divides a given earthwork area into unit cells, identifies networks created by linking these cells, and identifies the optimal path an excavator should follow to minimize its total transportation costs. In addition, the method also accounts for drainage direction and path continuity to ensure that the generated path considers site specific conditions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.412-414
• /
• 2019

경로 계획은 에이전트가 로봇이 특정 목적지에 도착할 수 있도록 에이전트가 수집한 정보를 바탕으로 경로를 설정하는 작업을 뜻한다. 부분 관측만 가능한 맵인 경우 에이전트 이동마다 새로 수집되는 정보들을 바탕으로 마르코프 의사결정 과정을 사용한 가치 반복 알고리즘이 널리 사용되지만, 제안된 가치 반복 알고리즘 사용 시 매 행동마다 모든 공간의 최적 경로를 계산하기 때문에 시간이 오래 걸리는 문제점이 있다. 이에 본 논문에서는 에이전트가 한 번에 탐색하는 범위가 제한되어 있다는 점에 착안하여 탐색 반경 내에 속하는 공간의 가치 함수 값을 미리 추정하여 효율적으로 최적의 경로를 추정하는 가치 반복 알고리즘을 제안한다.

• Management & Information Systems Review
• /
• v.29 no.4
• /
• pp.109-121
• /
• 2010

In this study, we propose a solution procedure to solve travelling salesman problem(TSP) with special cost function, route dependent travelling salesman problem(RDTSP). First, we develop an integer programming model to describe the problem. In the model, a variable means a possible route. And, the number of variables in this model are extremely large. So, we develop a LP relaxation problem of the IP model and solve the relaxation problem by a column generation technique. The relaxation problem does not guarantee the optimal solution. If we get an integer solution in the ralaxation problem, then the solution is an optimal one. But, if not, we cannot get an optimal solution. So, we approach a branch and price technique. The overall solution procedure can be applied a printed circuit board(PCB) assembly process.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2016.05a
• /
• pp.35-37
• /
• 2016

최근 IMO에서는 e-Navigation IT서비스를 사용자 입장에서 평가하도록 인간중심설계(HCD, Human Centered Design) 활동에 기반을 둔 유용성 평가에 대하여 표준화 작업을 진행하고 있다. 만약 IT서비스를 유용성 평가 기법으로 수행한다면 문제점, 오류, 개선사항, 사용자 요구사항 등을 도출할 수 있다. 그러나 IT서비스에 대한 유용성 평가의 관련 연구는 거의 진행되지 않고 있다. 이유는 최근 국제표준 제정을 준비하고 있고 평가를 위한 도구 및 평가 척도, 방법에 대한 기준이 명확하지 않기 때문이다. 따라서 본 연구에서는 경로 계획 공유(Route Plan Exchange) e-Navigation IT서비스에 대하여 유용성 평가 과정을 수행하였다. 유용성 평가를 위해 평가도구, 평가 시나리오, 평가 척도, 평가 방법을 개발하고 항해사 대상으로 유효성(Effectiveness), 효율성(Efficiency), 만족성(Satisfaction)을 평가하였다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.2
• /
• pp.231-240
• /
• 2023

It remains a challenge for robots to learn avoiding obstacles automatically in path planning using deep reinforcement learning (DRL). More and more researchers use DRL to train a robot in a simulated environment and verify the possibility of DRL to achieve automatic obstacle avoidance. Due to the influence factors of different environments robots and sensors, it is rare to realize automatic obstacle avoidance of robots in real scenarios. In order to learn automatic path planning by avoiding obstacles in the actual scene we designed a simple Testbed with the wall and the obstacle and had a camera on the robot. The robot's goal is to get from the start point to the end point without hitting the wall as soon as possible. For the robot to learn to avoid the wall and obstacle we propose to use the double deep Q networks (DDQN) to verify the possibility of DRL in automatic obstacle avoidance. In the experiment the robot used is Jetbot, and it can be applied to some robot task scenarios that require obstacle avoidance in automated path planning.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.2
• /
• pp.195-201
• /
• 2010

Recently, the necessity of the autonomous mobile robot is emphasized in order to enlarge the scope of activity and actively cope with the change of work environment. This paper proposes the algorithm which enables the mobile robot to avoid obstacles and lead it to the destination by the shortest path. And we verify the usability by a simulation. We made the algorithm with micro-GA and $\lambda$-geometry MRA. The area of simulation is limited to 320(width)$\times$200(length) pixels and one pixel is one centimeter. When we planned the path with only $\lambda$-geometry MRA, we could find the direction for path planning but could not find the shortest path. But when we planned the path with $\lambda$-geometry MRA and micro-GA, we could find the shortest path. So the algorithm enables us to find the direction for path planning and the shortest path.

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

A collision-free trajectory planning algorithm using an iterative learning concept is proposed for dual robot arms in a 3-D common workspace to accurately follow their specified paths with constant velocities. Specifically, a collision-free trajectory minimizing the trajectory error is obtained first by employing the linear programming technique. Then the total operating time is iteratively adjusted based on the maximum trajectory error of the previous iteration so that the collision-free trajectory has no deviation from the specified path and also that the operating time is near-minimal. To show the validity of the proposed algorithm, a numerical example is presented based on two planar robots.

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

Recent advances in automation and robotic technologies in the manufacturing industry suggest that the greater level of automation may be extremely beneficial for the construction industry. However, only some of the high-technology advances may be applied to the construction industry due to the fast-changing construction environment in which work locations are constantly changing and material, equipment, and workers are always moving. The earthwork operation for site development is a good candidate for applying automation technology, because it is a very repetitive and tedious task and needs lots of construction equipment. This paper presents the model of a construction environment and a moving plan for an automated earthwork system, which can produce an effective moving path of an excavator platform with an Octree model. To generate the moving path, the know-how of skilled operators and construction managers is added in the proposed model.