• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.7
• /
• pp.651-658
• /
• 2011

An efficient modified $D^*$ lite algorithm is suggested, which can perform online path planning for mobile robots in dynamic indoor environment. Online path planning should plan and execute alternately in a short time, and hence it enables the robot avoid unknown dynamic obstacles which suddenly appear on robot's path. Based on $D^*$ Lite algorithm, we improved representation of edge cost, heuristic function, and priority queue management, to build a modified $D^*$ Lite algorithm. Performance of the proposed algorithm is revealed via extensive simulation study.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.6
• /
• pp.626-633
• /
• 2009

A motion planning algorithm is presented in this paper for a commercialized quadruped walking of robot pet. Stable walking is the basic requirement for a commercial-purpose legged robot. In order to secure the walking stability, modified body sway to the centroid of support polygon is addressed. By representation of walking motion with respect to the world coordinate system rather than body coordinate, it is possible to design the several gaits in unified fashion. The initial gait posture is introduced to maximize the stride and to achieve fast walking. The proposed walking motion planning is verified through computer simulation and experiments.

• The Journal of Korea Robotics Society
• /
• v.5 no.4
• /
• pp.302-308
• /
• 2010

A gradient method can provide a global optimal path in indoor environments. However, the optimal path can be often generated in narrow areas despite a sufficient wide area which lead to safe navigation. This paper presents a novel approach to path planning for safe navigation of a mobile robot. The proposed algorithm extracts empty regions using a ray-casting method and then generates temporary waypoints in wider regions in order to reach the goal fast and safely. The experimental results show that the proposed method can generate paths in the wide regions in most cases and the robot can reach the goal safely at high speeds.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2774-2776
• /
• 2005

본 논문에서는 이동로봇에 삼차원 레이저 스캐너를 장착하여 삼차원 데이터의 수집, 수집된 데이터의 정합, 데이터 수집을 위한 이동로봇의 경로계획 및 장애물 회피주행 등 모든 작업들을 유기적으로 결합시켜 실내 환경에 다한 삼차원 모델을 자율제작하는 시스템을 제안한다. 이를 위해 스캔순서최적화를 통한 빠른 동적 물체 정보의 제거, 계층적 육면체 맵과 기하학적맵을 이용한 최적 경로 예측에 의한 다음 스캐닝 위치의 결정, 오도미터 정보와 명암 정보를 이용해 수정된 ICP 알고리즘을 통한 데이터의 정합을 통하여 이동물체와 관계없는 실내환경에 대한 삼차원 모델의 자율복원 한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.900-903
• /
• 1996

The objective of this paper is to make the weighted graph map for path planning using the ultrasonic sensor measurements that are acquired when an A.M.R (autonomous mobile robot) explores the unknown circumstance. First, The A.M.R navigates on unknown space with wall-following and gathers the sensor data from the environments. After this, we constructs the occupancy grid map by interpreting the gathered sensor data to occupancy probability. For the path planning of roadmap method, the weighted graph map is extracted from the occupancy grid map using morphological image processing and thinning algorithm. This methods is implemented on an A.M.R having a ultrasonic sensor.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.904-907
• /
• 1996

In this paper, we propose an efficient collision-free path planning method of two cooperating robot manipulators grasping a common object rigidly. For given two robots and an object, the procedure is described which constructs the reduced dimensional configuration space by the kinematic analysis of two cooperating robot manipulators. A path planning algorithm without explicit representation of configuration obstacles is also described. The primary steps of the algorithm is as follows. First, we compute a graph which represents the skeleton of the free configuration space. Second, a connection between an initial and a goal configuration to the graph is searched to find a collision-free path.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1136-1139
• /
• 1996

For on-line trajectory planning such as teleoperation it is desirable to keep good manipulability of the robot manipulators since the motion command is not given in advance. To keep good manipulability means the capability of moving any arbitrary directions of task space. An optimization process with different manipulability measures are performed and compared for a redundant robot system moving in 2-dimensional task space, and gives results that the conventional manipulability ellipsoid based on the Jacobian matrix is not good choice as far as the optimal direction of motion is concerned.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.8
• /
• pp.948-954
• /
• 1999

In this paper, we propose a cooperative motion planning algorithm for two tightly-coupled mobile robots. Specifically, the considered cooperative work is that two mobile robots should transfer a long rigid object along a predefined path. To resolve the problem, we introduce a master-slave concept for two obile robots having the same structure. According to the velocity of the master robot and the positions of two robots on the path, the velocity of the slave robot is determined. The slave normally tracks the master's motion, but in case that the velocity of the slave exceeds the velocity limit, the roles of the robots should be interchanged. The effectiveness of the proposed algorithm is proved by computer simulations.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.10
• /
• pp.1047-1055
• /
• 2009

Since nuclear and chemical materials could damage people and disturb battlefield missions in a wide region, nuclear/chemical reconnaissance systems utilizing multiple mobile robots are highly desirable for rapid and safe reconnaissance. In this paper, we design a nuclear/chemical reconnaissance system including mobile robots. Also we propose time-efficient trajectory planning algorithms using grid coverage and contour finding methods for reconnaissance operation. For grid coverage, we performed in analysis on time consumption for various trajectory patterns generated by straight lines and arcs. We proposed BCF (Bounded Contour Finding) and BCFEP (Bounded Contour Finding with Ellipse Prediction) algorithms for contour finding. With these grid coverage and contour finding algorithms, we suggest trajectory planning algorithms for single, two or four mobile robots. Various simulations reveal that the proposed algorithms improve time-efficiency in nuclear/chemical reconnaissance missions in the given area. Also we conduct basic experiments using a commercial mobile robot and verify the time efficiency of the proposed contour finding algorithms.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.7
• /
• pp.656-662
• /
• 2008

A cost-function based on manipulability and compatibility is designed to determine assembly motions of two cooperating manipulators. Assembly motions are planned along the direction maximizing performance indices to improve control performance of the two manipulators. This paper proposes bimanual task compatibility by defining cost functions. The proposed cost functions are applied and compared to the bimanual assembly task. The problem is formulated as a constrained optimization considering assembly constraints, position of the workpieces, and kinematics and redundancy of the bimanual robot. The proposed approach is evaluated with simulation of a peg-in-hole assembly with an L-shaped peg and two 3-dof manipulators.