• Title/Summary/Keyword: Path Planning Model

Search Result 219, Processing Time 0.036 seconds

Path planning of the J-lead inspection using hopfield model (홉필드 모델을 이용한 J-리드 검사 경로 생성)

  • 이중호;차영엽
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.1774-1777
    • /
    • 1997
  • As factory automation is required, using the vision system is also essential. Especially, the pateh planning of parts with J-lead on PCB plays a import role of whole automation. Path planning is required because J-lead is scatteed compaed to L-lead on PCB. Therefore, in this paper, we propose path planning of part inspection with J-lead to use Hopfield Model(TSP : Traveling Salesman Problem). Then optical system suited to J-lead inspection is designed and the algorithm of J-lead solder joint and part inspection is proposed.

  • PDF

3-Dimensional Path Planning and Guidance using the Dubins Curve for an 3-DOF Point-mass Aircraft Model (Dubins 곡선을 이용한 항공기 3자유도 질점 모델의 3차원 경로계획 및 유도)

  • O, Su-Hun;Ha, Chul-Su;Kang, Seung-Eun;Mok, Ji-hyun;Ko, Sangho;Lee, Yong-Won
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.24 no.1
    • /
    • pp.1-9
    • /
    • 2016
  • In this paper, we integrate three degree of freedom(3DOF) point-mass model for aircraft and three-dimensional path generation algorithms using dubins curve and nonlinear path tracking law. Through this integration, we apply the path generation algorithm to the path planning, and verify tracking performance and feasibility of using the aircraft 3DOF point-mass model for air traffic management. The accuracy of modeling 6DOF aircraft is more accurate than that of 3DOF model, but the complexity of the calculation would be raised, in turn the rate of computation is more likely to be slow due to the increase of degree of freedom. These obstacles make the 6DOF model difficult to be applied to simulation requiring real-time path planning. Therefore, the 3DOF point-mass model is also sufficient for simulation, and real-time path planning is possible because complexity can be reduced, compared to those of the 6DOF. Dubins curve used for generating the optimal path has advantage of being directly available to apply path planning. However, we use the algorithm which extends 2D path to 3D path since dubins curve handles the two dimensional path problems. Control law for the path tracking uses the nonlinear path tracking laws. Then we present these concomitant simulation results.

Building a network model for a mobile robot using sonar sensors (초음파센서를 이용한 이동로보트의 네트워크환경모델 구성)

  • Chung, Hak-Young;Park, Sol-lip;Lee, Jang-Gyu
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.5
    • /
    • pp.593-599
    • /
    • 1999
  • A mobile robot in FMS environment should be able to nevigate itself. Therefore, path planning is necessary for the mobile robot to perform its tasks without being lost. Path planning using a network model gives oprimal paths to every pair of nodes but building this model demands accurate information of environments. In this paper, a method to build a network model using sonar sensors is presented. The main idea is to build a quad tree model by using sonar sensors and convert the model to a network model for path planning. The new method has been implemented on a mobile robot. Experimental results show that the mobile robot constructs an accurate network model using inaccurate sonar data.

  • PDF

A Real Time Traffic Flow Model Based on Deep Learning

  • Zhang, Shuai;Pei, Cai Y.;Liu, Wen Y.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2473-2489
    • /
    • 2022
  • Urban development has brought about the increasing saturation of urban traffic demand, and traffic congestion has become the primary problem in transportation. Roads are in a state of waiting in line or even congestion, which seriously affects people's enthusiasm and efficiency of travel. This paper mainly studies the discrete domain path planning method based on the flow data. Taking the traffic flow data based on the highway network structure as the research object, this paper uses the deep learning theory technology to complete the path weight determination process, optimizes the path planning algorithm, realizes the vehicle path planning application for the expressway, and carries on the deployment operation in the highway company. The path topology is constructed to transform the actual road information into abstract space that the machine can understand. An appropriate data structure is used for storage, and a path topology based on the modeling background of expressway is constructed to realize the mutual mapping between the two. Experiments show that the proposed method can further reduce the interpolation error, and the interpolation error in the case of random missing is smaller than that in the other two missing modes. In order to improve the real-time performance of vehicle path planning, the association features are selected, the path weights are calculated comprehensively, and the traditional path planning algorithm structure is optimized. It is of great significance for the sustainable development of cities.

Trajectory Planning of Articulated Robots with Minimum-Time Criterion (최소시간을 고려한 다관절 로봇의 궤적계획)

  • Choi, J.S.;Yang, S.M.;Kang, H.Y.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.13 no.6
    • /
    • pp.122-127
    • /
    • 1996
  • The achievement of the optimal condition for the task of an industrial articulated robot used in many fields is an important problem to improve productivity. In this paper, a minimum-time trajectory for an articulated robot along the specified path is studied and simulated with a proper example. A general dynamic model of manipulator is represented as a function of path distance. Using this model, the velocity is produced as fast as possible at each point along the path. This minimum-time trajectory planning module together with the existing collision-free path planning modules is utilized to design the optimal path planning of robot in cases where obstacles present.

  • PDF

Development of Optimal Path Planning for Automated Excavator (자동화 굴삭기 최적경로 생성 알고리즘 개발)

  • Shin, Jin-Ok;Park, Hyong-Ju;Lee, Sang-Hak;Hong, Dae-Hee
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2007.04a
    • /
    • pp.78-83
    • /
    • 2007
  • The paper focuses on the establishment of optimized bucket path planning and trajectory control designated for force-reflecting backhoe reacting to excavation environment, such as potential obstacles and ground characteristics. The developed path planning method can be used for precise bucket control, and more importantly for obstacle avoidance which is directly related to safety issues. The platform of this research was based on conventional papers regarding the kinematic model of excavator. Jacobian matrix was constructed to find optimal joint angles and rotation angles of bucket from position and orientation data of excavator. By applying Newton-Raphson method optimal joint angles and bucket orientation were derived simultaneously in the way of minimizing positional errors of excavator. The model presented in this paper was intended to function as a cornerstone to build complete and advanced path planning of excavator by implementing soil mechanics and further study of excavator dynamics together.

  • PDF

Path Planning for Cleaning Robots: A Graph Model Approach

  • Yun, Sang-Hoon;Park, Se-Hun;Park, Byung-Jun;Lee, Yun-Jung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.120.3-120
    • /
    • 2001
  • We propose a new method of path planning for cleaning robots. Path planning problem for cleaning robots is different from conventional path planning problems in which finding a collision-free trajectory from a start point to a goal point is focused. In the case of cleaning robots, however, a planned path should cover all area to be cleaned. To resolve this problem in a systematic way, we propose a method based on a graph model as follows: at first, partition a given map into proper regions, then transform a divided region to a vertex and a connectivity between regions to an edge of a graph. Finally, a region is divided into sub-regions so that the graph has a unary tree which is the simplest Hamilton path. The effectiveness of the proposed method is shown by computer simulation results.

  • PDF

Path planning algorithm of mobile robot using neural network model (신경회로망 모델을 이용한 이동로봇의 경로생성 알고리즘)

  • 차영엽;유창목
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.1601-1604
    • /
    • 1997
  • The most important topic in research of mobile robot is path planning in order to avoid with obstacle. In this study the path planning algorithm using a neural network model is proposed. The inputs of neural network are range data which are acquired form laser range finderm and weights are based on difference with goal direction. The thresholds are made by consdiering the marginal distance between mobile robot and obstacle. Consequently the outputs are obtained by multiplying input and weight. The obtained heading directiion enables the mobile robot to approach the goal, without any collision with obstacles around. The effectiveness of the this method of real-time navigation of a mobile robot is estimated by computer simulation in complex environment.

  • PDF

Obstacles modeling method in cluttered environments using satellite images and its application to path planning for USV

  • Shi, Binghua;Su, Yixin;Zhang, Huajun;Liu, Jiawen;Wan, Lili
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.11 no.1
    • /
    • pp.202-210
    • /
    • 2019
  • The obstacles modeling is a fundamental and significant issue for path planning and automatic navigation of Unmanned Surface Vehicle (USV). In this study, we propose a novel obstacles modeling method based on high resolution satellite images. It involves two main steps: extraction of obstacle features and construction of convex hulls. To extract the obstacle features, a series of operations such as sea-land segmentation, obstacles details enhancement, and morphological transformations are applied. Furthermore, an efficient algorithm is proposed to mask the obstacles into convex hulls, which mainly includes the cluster analysis of obstacles area and the determination rules of edge points. Experimental results demonstrate that the models achieved by the proposed method and the manual have high similarity. As an application, the model is used to find the optimal path for USV. The study shows that the obstacles modeling method is feasible, and it can be applied to USV path planning.

A Local Path Planning Algorithm considering the Mobility of UGV based on the Binary Map (무인차량의 주행성능을 고려한 장애물 격자지도 기반의 지역경로계획)

  • Lee, Young-Il;Lee, Ho-Joo;Ko, Jung-Ho
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.2
    • /
    • pp.171-179
    • /
    • 2010
  • A fundamental technology of UGV(Unmanned Ground Vehicle) to perform a given mission with success in various environment is a path planning method which generates a safe and optimal path to the goal. In this paper, we suggest a local path-planning method of UGV based on the binary map using world model data which is gathered from terrain perception sensors. In specially, we present three core algorithms such as shortest path computation algorithm, path optimization algorithm and path smoothing algorithm those are used in the each composition module of LPP component. A simulation is conducted with M&S(Modeling & Simulation) system in order to verify the performance of each core algorithm and the performance of LPP component with scenarios.