• 제목/요약/키워드: Simple Path

Search Result 660, Processing Time 0.024 seconds

A local path planning algorithm for free-ranging mobil robot (자율 주행로봇을 위한 국부 경로계획 알고리즘)

  • Cha, Y.Y.;Gweon, D.G.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.11 no.4
    • /
    • pp.88-98
    • /
    • 1994
  • A new local path planning algorithm for free-ranging robots is proposed. Considering that a laser range finder has the excellent resolution with respect to angular and distance measurements, a simple local path planning algorithm is achieved by a directional weighting method for obtaining a heading direction of nobile robot. The directional weighting method decides the heading direction of the mobile robot by estimating the attractive resultant force which is obtained by directional weighting function times range data, and testing whether the collision-free path and the copen parthway conditions are satisfied. Also, the effectiveness of the established local path planning algorithm is estimated by computer simulation in complex environment.

  • PDF

Path Determination Algorithm of Guidance Robot for the Visually Impaired (시각장애인 유도로봇의 경로 결정 알고리즘)

  • Jang, Tae-Jin;Shen, Dongfan;Lee, Eung-Hyuk;Hong, Seung-Hong
    • Proceedings of the KIEE Conference
    • /
    • 2003.11b
    • /
    • pp.259-262
    • /
    • 2003
  • In this paper, we studied the path determination algorithm of the guidance robot for the visually impaired. Using the guidance robot for the visually impaired, the visually impaired can go to the destination where they want without other's heir. The navigation path of the guidance robot for the visually impaired must be the optimal path not only the shortest but also the most safe, which is different from a shortest path for common people. GPS and electronic map are used for the location information of the visually impaired. We corrected the error by converting the coordinates of location information from GPS, which includes maximum several tens of meters error, to the coordinates of electronic map. Information such as simple path and direction to the destination is not enough because it may be different between a going path from the start to the destination and a coming path from the destination to the start as around environment. So, we added information which can be dangerous for the visually impaired such as driveway, sidewalk without braille blocks, crosswalk, stairs and overpass, each has weight value as dangerous degree, when matching the GPS information to the electronic map, enough large as 1:5,000 scale.

  • PDF

Navigational Path Detection Using Fuzzy Binarization and Hough Transform (퍼지 이진화와 허프 변환을 이용한 주행 경로 검출)

  • Woo, Young Woon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.2
    • /
    • pp.31-37
    • /
    • 2014
  • In conventional methods for car navigational path detection using Hough transform, navigational path deviation of a car is decided in car navigational images with simple background. But in case of car navigational images having complex background with obstacles on the road, shadows, other cars, and so on, it is very difficult to detect navigational path because these obstacles obstruct correct detection of car navigational path. In this paper, I proposed an effective navigational path detection method having better performance than conventional navigational path detection methods using Hough transform only, and fuzzy binarization method and Canny mask are applied in the proposed method for the better performance. In order to evaluate the performance of the proposed method, I experimented with 20 car navigational images and verified the proposed method is more effective for detection of navigational path.

Local Path Planning for Mobile Robot Using Artificial Neural Network - Potential Field Algorithm (뉴럴 포텐셜 필드 알고리즘을 이용한 이동 로봇의 지역 경로계획)

  • Park, Jong-Hun;Huh, Uk-Youl
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.10
    • /
    • pp.1479-1485
    • /
    • 2015
  • Robot's technology was very simple and repetitive in the past. Nowadays, robots are required to perform intelligent operation. So, path planning has been studied extensively to create a path from start position to the goal position. In this paper, potential field algorithm was used for path planning in dynamic environments. It is used for a path plan of mobile robot because it is elegant mathematical analysis and simplicity. However, there are some problems. The problems are collision risk, avoidance path, time attrition. In order to resolve path problems, we amalgamated potential field algorithm with the artificial neural network system. The input of the neural network system is set using relative velocity and location between the robot and the obstacle. The output of the neural network system is used for the weighting factor of the repulsive potential function. The potential field algorithm problem of mobile robot's path planning can be improved by using artificial neural network system. The suggested algorithm was verified by simulations in various dynamic environments.

Routing Protocol of Shipping Container Network suitable for Port/Yard Stacking Environment: SAPDS(Simple Alternative Path Destined for Sink node) (항만/야적장 적치 환경에 적합한 컨테이너 네트워크 라우팅 프로토콜: SAPDS(Simple Alternative Path Destined for Sink node))

  • Kwark, Gwang-Hoon;Lee, Jae-Kee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6B
    • /
    • pp.728-737
    • /
    • 2011
  • For the real time monitoring and tracking of shipping container which is one of the core objects for global logistics, Wireless Ad-Hoc Network technology might be needed in stacking environments such as ports, yards and ships. In this paper, we propose a container network routing protocol suitable for port or yard stacking environments which include some constraints such as shadow area problem from metal material, frequent movement of container, etc. With this protocol in which a mesh network algorithm is applied, every container data packet can be delivered to the sink node reliably even with frequent join/leave of container nodes. As soon as a node on path gets malfunction, alternative backup path is supported with notice to neighbor node, which makes constant total optimal path. We also verified that the performance of proposed protocol is better than AODV, one of previous major MANet(Mobile Ad-Hoc Network) protocol with a function for alternative path, which says the proposed protocol is better for frequent join/leave and variable link quality.

Science High-School Students Understanding of Velocity & Acceleration and of the Motion of Bob When Tension is Removed in a Simple Pendulum

  • Kim, Young-Min;Jeong, Seong-Oh
    • Journal of The Korean Association For Science Education
    • /
    • v.26 no.5
    • /
    • pp.611-619
    • /
    • 2006
  • The aims of this study are to investigate science high school students' understanding of velocity and acceleration of a simple pendulum bob, and to investigate their understanding of inertia and gravitational force in the motion of a pendulum bob when the tension is removed. For the study, 46 students that had already studied the physical, concepts in simple pendulum were sampled from a science high school in a large city in Korea. For a comparison with general high school students' conceptions, 49 students were sampled from a general high school in the same city. The test tool for the investigation consisted of four drawing and simple-answering type questions developed by the authors. The outcomes of the study revealed that a substantial number of science high school students have misconceptions concerning acceleration in pendulum motion, and that many of them do not understand the relationship between force and acceleration. In addition, the results of the study showed that more than 30% of the students drew the path of a bob going along the tangential direction at the highest point of the motion, and approximately 20% of them drew the path of a bob falling straight down at the lowest point of the motion.

A Path Planning of Mobile Robot using Distribution Density (분포 밀도를 이용한 이동 로봇의 최적 경로)

  • Kwak, Jae-Hyuk;Lim, Joon-Hong
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.520-522
    • /
    • 2004
  • In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. Sonar ranger is useful to get obstacle information and RAS may be a good solution for path planning.

  • PDF

A New Technique to Escape Local Minimum in Artificial Potential Field Based Path Planning

  • Park, Min-Gyu;Lee, Min-Cheol
    • Journal of Mechanical Science and Technology
    • /
    • v.17 no.12
    • /
    • pp.1876-1885
    • /
    • 2003
  • The artificial potential field (APF) methods provide simple and efficient motion planners for practical purposes. However, these methods have a local minimum problem, which can trap an object before reaching its goal. The local minimum problem is sometimes inevitable when an object moves in unknown environments, because the object cannot predict local minima before it detects obstacles forming the local minima. The avoidance of local minima has been an active research topic in the potential field based path planing. In this study, we propose a new concept using a virtual obstacle to escape local minima that occur in local path planning. A virtual obstacle is located around local minima to repel an object from local minima. We also propose the discrete modeling method for the modeling of arbitrary shaped objects used in this approach. This modeling method is adaptable for real-time path planning because it is reliable and provides lower complexity.

The Real-time Path Planning Using Artificial Potential Field and Simulated Annealing for Mobile Robot (Artificial Potential Field 와 Simulated Annealing을 이용한 이동로봇의 실시간 경로계획)

  • 전재현;박민규;이민철
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.256-256
    • /
    • 2000
  • In this parer, we present a real-time path planning algorithm which is integrated the artificial potential field(APF) and simulated annealing(SA) methods for mobile robot. The APF method in path planning has gained popularity since 1990's. It doesn't need the modeling of the complex configuration space of robot, and is easy to apply the path planning with simple computation. However, there is a major problem with APF method. It is the formation of local minima that can trap the robot before reaching its goal. So, to provide local minima recovery, we apply the SA method. The effectiveness of the proposed algorithm is verified through simulation.

  • PDF

Effects of the Tool Path on the Geometric Characteristics of Milled Surface (가공경로가 밀링가공면의 기하학적 특성에 미치는 영향)

  • Park, Moon-Jin;Kim, Kang
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.6
    • /
    • pp.58-63
    • /
    • 1998
  • There are lots of factors that are related to the geometric characteristics of machined surface. Among them, the tool path and milling mode (up cut milling or down cut milling) are the easiest controllable machining conditions. Thus, the first objective of this research is to study the effects of them on the milled surface that is generated by an end milling tool. To get precision parts, not only the machining process but also the measurement of geometric tolerance is important. But, this measurement requires a lot of time, because the infinite surface points must be measured in the ideal case. So, the second objective is to propose a simple flatness measurement method that can be available instead of the 3-D geometric tolerance measurement method, using a scale factor and characterized points. Finally, it is also shown that the possibility of flatness improvement by shifting the consecutive fine cutting tool path as compared with the last rough cutting tool path.

  • PDF