• 제어로봇시스템학회논문지
• /
• 제6권3호
• /
• pp.317-328
• /
• 2000

This paper presents an effective approach to collision-free motion planning of a robot in the work-space including time-varying obstacles. The free arc is defined as a set composed of the configuration points of the robot satisfying collision-free motion constraint at each sampling time. We represent this free arc with respect to the new coordinate frame centered at the goal configuration and there for the collision-free path satisfying motion constraint is obtained by connecting the configuration points of the free arc at each sampling mined from the sequence of free arcs the optimality is determined by the performance index. Therefore the complicated collision-free motion planning problem of a robot is transformed to a simplified SUB_Optimal Collision Avoidance Problem(SOCAP). We analyze the completeness of the proposed approach and show that it is partly guaranteed using the backward motion. Computational complexity of our approach is analyzed theoretically and practical computation time is compared with that of the other method. Simulation results for two cally and practical computation time is compared with that of the other method. Simulation results for two SCARA robot manipulators are presented to verify the efficacy of the proposed method.

• 제어로봇시스템학회논문지
• /
• 제21권3호
• /
• pp.257-264
• /
• 2015

This paper proposes an adaptive RRT (Rapidly-exploring Random Tree) for path planning of high DOF multibody robotic system. For an efficient path planning in high-dimensional configuration space, the proposed algorithm adaptively selects the robot bodies depending on the complexity of path planning. Then, the RRT grows only using the DOFs corresponding with the selected bodies. Since the RRT is extended in the configuration space with adaptive dimensionality, the RRT can grow in the lower dimensional configuration space. Thus the adaptive RRT method executes a faster path planning and smaller DOF for a robot. We implement our algorithm for path planning of 19 DOF robot, AMIRO. The results from our simulations show that the adaptive RRT-based path planner is more efficient than the basic RRT-based path planner.

• 제어로봇시스템학회논문지
• /
• 제17권6호
• /
• pp.513-520
• /
• 2011

This paper presents the motion planning of robotic vehicles for the path tracking and the obstacle avoidance. To follow the given path, the vehicle moves through the turning radius obtained through the pure pursuit method, which is a geometric path tracking method. In this paper, we assume that the vehicle is equipped with a 2D laser scanner, allowing it to avoid obstacles within its sensing range. The turning radius for avoiding the obstacle, which is inversely proportional to the virtual force, is then calculated. Therefore, these two kinds of the turning radius are used to generate the steering angle for the front wheel of the vehicle. And the vehicle reduces the velocity when it meets the obstacle or the large steering angle using the potentials of obstacle points and the steering angle. Thus the motion planning of the vehicle is done by planning the steering angle for the front wheels and the velocity. Finally, the performance of the proposed method is tested through simulation.

• 로봇학회논문지
• /
• 제3권1호
• /
• pp.23-32
• /
• 2008

This paper presents a task planning system for a steward robot, which has been developed as an interactive intermediate agent between an end-user and a complex smart home environment called the ISH (Intelligent Sweet Home) at KAIST (Korea Advanced Institute of Science and Technology). The ISH is a large-scale robotic environment with various assistive robots and home appliances for independent living of the elderly and the people with disabilities. In particular, as an approach for achieving human-friendly human-robot interaction, we aim at 'simplification of task commands' by the user. In this sense, a task planning system has been proposed to generate a sequence of actions effectively for coordinating subtasks of the target subsystems from the given high-level task command. Basically, the task planning is performed under the framework of STRIPS (Stanford Research Institute Problem Solver) representation and the split planning method. In addition, we applied a state-partitioning technique to the backward split planning method to reduce computational time. By analyzing the obtained graph, the planning system decomposes an original planning problem into several independent sub-problems, and then, the planning system generates a proper sequence of actions. To show the effectiveness of the proposed system, we deal with a scenario of a planning problem in the ISH.

• 로봇학회논문지
• /
• 제1권2호
• /
• pp.188-196
• /
• 2006

During the communication and interaction with a human using motions or gestures, a humanoid robot needs not only to look like a human but also to behave like a human to make sure the meanings of the motions or gestures. Among various human-like behaviors, arm motions of the humanoid robot are essential for the communication with people through motions. In this work, a mathematical representation for characterizing human arm motions is first proposed. The human arm motions are characterized by the elbow elevation angle which is determined using the position and orientation of human hands. That representation is mathematically obtained using an approximation tool, Response Surface Method (RSM). Then a method to generate human-like arm motions in real time using the proposed representation is presented. The proposed method was evaluated to generate human-like arm motions when the humanoid robot was asked to move its arms from a point to another point including the rotation of its hand. The example motion was performed using the KIST humanoid robot, MAHRU.

• 로봇학회논문지
• /
• 제2권3호
• /
• pp.275-281
• /
• 2007

This paper presents a motion planning strategy for legged robots using locomotion primitives in the complex 3D environments. First, we define configuration, motion primitives and locomotion primitives for legged robots. A hierarchical motion planning method based on a combination of 2.5 dimensional maps of the 3D workspace is proposed. A global navigation map is obtained using 2.5 dimensional maps such as an obstacle height map, a passage map, and a gradient map of obstacles to distinguish obstacles. A high-level path planner finds a global path from a 2D navigation map. A mid-level planner creates sub-goals that help the legged robot efficiently cope with various obstacles using only a small set of locomotion primitives that are useful for stable navigation of the robot. A local obstacle map that describes the edge or border of the obstacles is used to find the sub-goals along the global path. A low-level planner searches for a feasible sequence of locomotion primitives between sub-goals. We use heuristic algorithm in local motion planner. The proposed planning method is verified by both locomotion and soccer experiments on a small biped robot in a cluttered environment. Experiment results show an improvement in motion stability.

• 제어로봇시스템학회논문지
• /
• 제8권2호
• /
• pp.142-150
• /
• 2002

This paper presents a systematic method of the zigzag gait planning for quadruped walking robots. When a robot walks with a zigzag gait, its body is allowed to move from side to side, while the body movement is restricted along a moving direction in conventional continuous gaits. The zigzag movement of the body is effective to improve the gait stability margin. To plan a zigzag gait in a systematic way, the relationship between the center of gravity(COG) and the stability margin is firstly investigated. Then, new geometrical method is introduced to plan a sequence of the body movement which guarantees a maximum stability margin as well as monotonicity along a moving direction. Finally, an optimal swing-leg sequence is chosen for a given arbitrary configuration of the robot. To verify the proposed method, computer simulations have been performed for both cases of a periodic gait and a non-periodic gait.

• 제어로봇시스템학회논문지
• /
• 제10권8호
• /
• pp.703-710
• /
• 2004

This paper presents discontinuous zigzag gait analysis for a newly modeled quadruped walking robot with an articulated spine which connects the front and rear parts of the body. An articulated spine walking robot can move easily from side to side, which is an important feature to guarantee a larger gait stability margin than that of a conventional single rigid-body walking robot. First, we suggest a kinematic modeling of an articulated spine robot which has new parameters such as a waist-joint angle, a rotate angle of a front and rear body and describe characteristics of gait using an articulated spine. Next, we compared the difference of walking motion of newly modeled robot with that of a single rigid-body robot and analyzed the gait of an articulated spine robot using new parameters. On the basis of above result, we proposed a best walking motion with maximum stability margin. To show the effectiveness of proposed gait planning by simulation, firstly the fastest walking motion is identified based on the maximum stride, because the longer the stride, the faster the walking speed. Next, the gait stability margin variation of an articulated spine robot is compared according to the allowable waist-joint angle.

• 제어로봇시스템학회논문지
• /
• 제11권2호
• /
• pp.137-143
• /
• 2005

Autonomous mobile robot has an ability to navigate using both map in known environment and sensors for detecting obstacles in unknown environment. In general, autonomous mobile robot navigates by global path planning on the basis of already made map and local path planning on the basis of various kinds of sensors to avoid abrupt obstacles. This paper provides a global path planning method using self-organizing feature map which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

• 한국컴퓨터정보학회논문지
• /
• 제26권3호
• /
• pp.111-117
• /
• 2021

그래프에서의 배달문제는 m개의 정점으로 구성된 그래프에서 n개의 서로 다른 속도를 갖는 로봇 에이전트들을 이용하여 배달물을 그래프의 한 노드에서 다른 노드로 배달하는 최소 배달순서를 구하는 문제이다. 본 논문에서는 그래프에서의 배달문제에 대하여 최적해를 계산하는 O(㎥n)과 O(㎥)시간복잡도를 갖는 두 개의 알고리즘을 제안한다. 알고리즘은 그래프의 모든 쌍에 대한 최단경로를 구하는 전처리를 한 후, 최소배달시간이 작은 정점의 순으로 최단배달경로를 구하는 방법으로 개발하였다. 이 문제에서 그래프가 문제를 해결하고자 하는 지형을 반영하고 있다고 하면, 다양한 로봇 에이전트의 배치에 대하여 전처리를 1회만 실행되면 되므로 O(㎥) 알고리즘은 실제로 O(㎡n)의 시간복잡도를 갖는다고 할 수 있다.