• Title/Summary/Keyword: 로드맵 기반 경로 계획

Search Result 2, Processing Time 0.019 seconds

Simulating Group Movement on a Roadmap-based Path (로드맵 기반 경로에서의 그룹 이동 시뮬레이션)

  • Yu, Kyeon-Ah;Cho, Su-Jin;Kim, Kyung-Hye
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.4
    • /
    • pp.105-114
    • /
    • 2011
  • The roadmap-based planning is a path planning method which is used widely for a goal-directed movement in Robotics and has been applied to the world of computer animation such as computer games. However it is unnatural for computer characters to follow the path planned by the roadmap method as it is performed in Robotics. Flocking which is used for realistic and natural movements in computer animation enables character's movement by using a few simple rules without planning unlike the roadmap method. However it is impossible to achieve a goal-directed movement with flocking only because it does not keep states. In this paper we propose a simulation method which combines planning based on the road map with reactive actions for natural movements along the path planned. We define and implement steering behaviors for a leader which are needed to follow the trajectory naturally by analysing characteristics of roadmap-based paths and for the rest of members which follow the leader in various manners by detecting obstacles. The simulations are performed and demonstrated by using the implemented steering behaviors on every possible combination of roadmap-based path planning methods and models of configuration spaces. We also show that the detection of obstacle-collisions can be done effectively because paths are planned in the configuration space in which a moving object is reduced to a point.

Sensor-Based Path Planning for Planar Two-identical-Link Robots by Generalized Voronoi Graph (일반화된 보로노이 그래프를 이용한 동일 두 링크 로봇의 센서 기반 경로계획)

  • Shao, Ming-Lei;Shin, Kyoo-Sik
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.12
    • /
    • pp.6986-6992
    • /
    • 2014
  • The generalized Voronoi graph (GVG) is a topological map of a constrained environment. This is defined in terms of workspace distance measurements using only sensor-provided information, with a robot having a maximum distance from obstacles, and is the optimum for exploration and obstacle avoidance. This is the safest path for the robot, and is very significant when studying the GVG edges of highly articulated robots. In previous work, the point-GVG edge and Rod-GVG were built with point robot and rod robot using sensor-based control. An attempt was made to use a higher degree of freedom robot to build GVG edges. This paper presents GVG-based a new local roadmap for the two-link robot in the constrained two-dimensional environment. This new local roadmap is called the two-identical-link generalized Voronoi graph (L2-GVG). This is used to explore an unknown planar workspace and build a local roadmap in an unknown configuration space $R^2{\times}T^2$ for a planar two-identical-link robot. The two-identical-link GVG also can be constructed using only sensor-provided information. These results show the more complex properties of two-link-GVG, which are very different from point-GVG and rod-GVG. Furthermore, this approach draws on the experience of other highly articulated robots.