• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1995년도 추계학술대회 논문집
• /
• pp.1133-1137
• /
• 1995

This paper presents a numerical method of the global search for an optimal geometric path for a manipulator arm amid obstacles. Finite term quintic B-splines are used to describe an arbitrary point-to-point manipulator motion with fixed moving time. The coefficients of the splines span a linear vector space, a point in which uniquely represents the manipulator motion. All feasible geometric paths are searched by adjusting the seed points of the obstacle models in the penetration growth distances. In the numerical implementation using nonlinear programming, the globally optimal geometric path is obtained for a spatial 3-link(3-revolute joints) manipulator amid several hexahedral obstacles without simplifying any dynamic or geometric models.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1128-1131
• /
• 1996

The collision-free path planning presented here uses linear parametric curve with one intermediate connection point between start and target points. The algorithm, in which connection point is organized in elliptic chord.(.theta., .delta.), maps objects in Euclidean Space into images in CPS through intersection check between path and obstacles a process defined as GM. Elliptic locus has special property that the total distance between focus points through a point on ellipse is the same regardless of .theta.. Hence by locating the start and target points to focus points of ellipse, and organizing connection point in elliptic coordinate, the .delta.-axis of CPS represents length of path. The GM of EWS requires calculation of interference in circumferential direction only. The procedures for GM is developed which include categorization of obstacles to reduce calculation amount. Simulations of GM of EWS, on a PC with Pentium/90MHz, is carried out to measure performance of algorithm and the results are reported on a table. The simulations are done for number of cases with different number of obstacles and location of start/target points.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.475-475
• /
• 2000

This paper describes the construction of an autonomous mobile robot with functions of collision avoidance and speech recognition that is used for teaching path of the robot. The human voice as a teaching method provides more convenient user-interface to mobile robot. For safe navigation, the autonomous mobile robot needs abilities to recognize surrounding environment and avoid collision. We use u1trasonic sensors to obtain the distance from the mobile robot to the various obstacles. By navigation algorithm, the robot forecasts the possibility of collision with obstacles and modifies a path if it detects dangerous obstacles. For these functions, the robot system is composed of four separated control modules, which are a speech recognition module, a servo motor control module, an ultrasonic sensor module, and a main control module. These modules are integrated by CAN(controller area network) in order to provide real-time communication.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2004년도 SMICS 2004 International Symposium on Maritime and Communication Sciences
• /
• pp.123-127
• /
• 2004

In this paper, we propose that the chaotic behavior analysis in the several Arnold chaos mobile robot of embedding some chaotic such as Arnold equation with obstacle. In order to analysis of chaotic behavior in the mobile robot, we apply not only qualitative analysis such as time-series, embedding phase plane, but also quantitative analysis such as Lyapunov exponent in the mobile robot with obstacle. We consider that there are two type of obstacle, one is fixed obstacle and the other is hidden obstacle which have an unstable limit cycle. In the hidden obstacles case, we only assume that all obstacles in the chaos trajectory surface in which robot workspace has an unstable limit cycle with Van der Pol equation.

• Journal of Information Processing Systems
• /
• 제16권6호
• /
• pp.1309-1323
• /
• 2020

Crowd evacuation simulation is an important research issue for designing reasonable building layouts and planning more effective evacuation routes. The social force model (SFM) is an important pedestrian movement model, and is widely used in crowd evacuation simulations. The model can effectively simulate crowd evacuation behaviors in a simple scene, but for a multi-obstacle scene, the model could result in some undesirable problems, such as pedestrian evacuation trajectory oscillation, pedestrian stagnation and poor evacuation routing. This paper analyzes the causes of these problems and proposes an improved SFM for complex multi-obstacle scenes. The new model adds navigation points and walking shortest route principles to the SFM. Based on the proposed model, a crowd evacuation simulation system is developed, and the crowd evacuation simulation was carried out in various scenes, including some with simple obstacles, as well as those with multi-obstacles. Experiments show that the pedestrians in the proposed model can effectively bypass obstacles and plan reasonable evacuation routes.

• 로봇학회논문지
• /
• 제3권4호
• /
• pp.338-344
• /
• 2008

Most omni-directional mobile robots have to change their trajectory for avoiding obstacles regardless of the size of the obstacles. However, an omni-directional mobile robot having kinematic redundancy can maintain the trajectory while the robot avoids small obstacles. This works deals with the kinematic modeling and motion planning of an omni-directional mobile robot with kinematic redundancy. This robot consists of three wheel mechanisms. Each wheel mechanism is modeled as having four joints, while only three joints are necessary for creating the omni-directional motion. Thus, each chain has one kinematic redundancy. Two types of wheel mechanisms are compared and its kinematic modeling is introduced. Finally, several motion planning algorithms using the kinematic redundancy are investigated. The usefulness of this robot is shown through experiment.

• International Journal of Control, Automation, and Systems
• /
• 제4권4호
• /
• pp.466-479
• /
• 2006

This paper addresses a formation navigation issue for a group of mobile robots passing through an environment with either static or moving obstacles meanwhile keeping a fixed formation shape. Based on Lyapunov function and graph theory, a NN formation control is proposed, which guarantees to maintain a formation if the formation pattern is $C^k,\;k\geq1$. In the process of navigation, the leader can generate a proper trajectory to lead formation and avoid moving obstacles according to the obtained information. An evolutionary computational technique using particle swarm optimization (PSO) is proposed for motion planning so that the formation is kept as $C^1$ function. The simulation results demonstrate that this algorithm is effective and the experimental studies validate the formation ability of the multiple mobile robots system.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권2호
• /
• pp.206-214
• /
• 2003

In this paper, we propose a method to avoid obstacles that have unstable limit cycles in a chaos trajectory surface. We assume all obstacles in the chaos trajectory surface have a Van der Pol equation with an unstable limit cycle. When a chaos robot meets an obstacle in an Arnold equation or Chua's equation trajectory, the obstacle reflects the robot. We also show computer simulation results of Arnold equation and Chua's equation and random walk chaos trajectories with one or more Van der Pol obstacles and compare the coverage rates of each trajectory. We show that the Chua's equation is slightly more efficient in coverage rates when two robots are used, and the optimal number of robots in either the Arnold equation or the Chua's equation is also examined.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.415-415
• /
• 2000

The functions of a mobile robot such as obstacle knowledge and collision avoidance for in-door cleaning are necessary features, as has been much studied in the field of industrial automatic guided vehicle or general mobile robot. A mobile robot, in order to avoid collision with obstacles, has to gather data with environment knowledge sensors and recognize environment and the shape of obstacles from the data. In the study, a wall-following algorithm was suggested as a autonomous moving algorithm in which a mobile robot can recognize obstacles in indoor like environment and do cleaning work in effect. The system suggested in the study is for cleaning of nuclear material dusts generated in the process of nuclear fuel manufacturing and decontamination of devices in disorder which is performed in M6 radioactive ray shield hot-cell in IMEF(Irradiated Material Examination Facility) in the Korea Atomic Energy Research Institute.

• 한국국방경영분석학회지
• /
• 제18권2호
• /
• pp.140-150
• /
• 1992

In this paper, we consider the shortest path problem of a Robot car moving in a workspace which consists of some obstacles. The motion of the Robot car is considered to have initial and final directions with some restrictions in the curvature of the path. At first we consider the problem in the case of having no obstacles and we give an analytical solution. Then wre present an algorithm to find a feasible path in the case of having obstacles and a method to improve this feasible path into a minimal path. Some computational results using Graph theory and Linear programming have been included.