• Title/Summary/Keyword: Soft Robotics

Search Result 136, Processing Time 0.021 seconds

A Flexible Precise 2D-Image Reconstruction in X-Ray Computed Tomography for Soft Tissues Based On Non-Uniform Sampling Theorem

  • Kim, io-Sasaki;Hirokazu Okaniwa
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.80.4-80
    • /
    • 2002
  • Performance of the previously proposed 2D-image reconstruction method for soft tissues in x-ray computed tomography is evaluated thoroughly through numerical experiments with 4 assumed absorption rates of different symmetries under practical conditions, and the following special features are made clear: It is quite precise, especially at points where the object taking larger values; about two orders less magnitude errors than the conventional most precise method when no noise existing, without any 1D- or 2D-interpolation. In spite of its high sensitivity to the noises, it is even more precise by about 8dB than the latter, to relative pojection data noise power of 5%.

  • PDF

Biosign Recognition based on the Soft Computing Techniques with application to a Rehab -type Robot

  • Lee, Ju-Jang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.29.2-29
    • /
    • 2001
  • For the design of human-centered systems in which a human and machine such as a robot form a human-in system, human-friendly interaction/interface is essential. Human-friendly interaction is possible when the system is capable of recognizing human biosigns such as5 EMG Signal, hand gesture and facial expressions so the some humanintention and/or emotion can be inferred and is used as a proper feedback signal. In the talk, we report our experiences of applying the Soft computing techniques including Fuzzy, ANN, GA and rho rough set theory for efficiently recognizing various biosigns and for effective inference. More specifically, we first observe characteristics of various forms of biosigns and propose a new way of extracting feature set for such signals. Then we show a standardized procedure of getting an inferred intention or emotion from the signals. Finally, we present examples of application for our model of rehabilitation robot named.

  • PDF

Optimization-based humanoid robot navigation using monocular camera within indoor environment

  • Han, Young-Joong;Kim, In-Seok;Hong, Young-Dae
    • ETRI Journal
    • /
    • v.40 no.4
    • /
    • pp.446-457
    • /
    • 2018
  • Robot navigation allows robot mobility. Therefore, mobility is an area of robotics that has been actively investigated since robots were first developed. In recent years, interest in personal service robots for homes and public facilities has increased. As a result, robot navigation within the home environment, which is an indoor environment, is being actively investigated. However, the problem with conventional navigation algorithms is that they require a large computation time for their building mapping and path planning processes. This problem makes it difficult to cope with an environment that changes in real-time. Therefore, we propose a humanoid robot navigation algorithm consisting of an image processing and optimization algorithm. This algorithm realizes navigation with less computation time than conventional navigation algorithms using map building and path planning processes, and can cope with an environment that changes in real-time.

Dynamic Manipulability for Cooperating Multiple Robot Systems (공동 작업하는 다중 로봇 시스템의 동적 조작도)

  • 심형원
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.10
    • /
    • pp.930-939
    • /
    • 2004
  • In this paper, both dynamic constraints and kinematic constraints are considered for the analysis of manipulability of robotic systems comprised of multiple cooperating arms. Given bounds on the torques of each Joint actuator for every robot, the purpose of this study is to drive the bounds of task-space acceleration of object carried by the system. Bounds on each joint torque, described as a polytope, is transformed to the task-space acceleration through matrices related with robot dynamics, robot kinematics, object dynamics, grasp conditions, and contact conditions. A series of mathematical manipulations including the procedure calculating minimum infinite-norm solution of linear equation is applied to get the reachable acceleration bounds from given actuator dynamic constrains. Several examples including two robot systems as well as three robot system are shown with the assumptions of complete-constraint contact model(or' very soft contact') and insufficient or proper degree of freedom robot.

Architecture of Web-Based Real-Time Monitoring Systems (웹 기반 실시간 모니터링 시스템의 구조)

  • Park, Hong-Seong;Jeong, Myeong-Sun;Kim, Bong-Sun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.7
    • /
    • pp.632-639
    • /
    • 2001
  • This paper proposes an improved architecture of web-based monitoring systems for monitor of processes in plants from the soft real-time point of view. The suggested model is designed to be able to guarantee the temporal and spatial consistency and transmit the monitoring data periodically via the intranet and the Internet. The model generates one thread for monitoring management, one DB thread, one common memory, and corresponding monitoring threads to clients. The monitoring thread is executed during the smaller time than the execution time of the process used in the conventional methods such as CGI and servlet method. The Java API for the server API, VRML, EAI(External Authoring Interface) and Java Applets for efficient dimensional WEB monitoring are used. The proposed model is implemented and tested for a FMS plant, Some examples show that the proposed model is useful one.

  • PDF

On-line Magnetic Distortion Calibration Method for a Magnetometer (지자기 센서의 온라인 왜곡 보정기법)

  • Kim, Tae-Yeon;So, Chang-Ju;Lyou, Joon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.9
    • /
    • pp.819-822
    • /
    • 2012
  • This paper describes an on-line magnetic distortion calibration procedure for a magnetometer. The horizontal magnetic field is calculated through the earth magnetic field sensed by 3-axes magnetometer. The ellipse equation is derived from a set of horizontal magnetic field data using least square method and calibration parameters are determined. The calibration process is performed iteratively until parameters are not renewed, and experimental results show the effectiveness of the devised method.

Dynamic Thresholding Scheme for Fingerprint Identification (지문 식별을 위한 동적 임계치 설정방법)

  • Kim, Kyoung-Min;Lee, Buhm;Park, Joong-Jo;Jung, Soon-Won
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.9
    • /
    • pp.801-805
    • /
    • 2012
  • This paper proposes dynamic thresholding scheme for fingerprint identification. As a user authentication method by fingerprint recognition technology, verification method based on 1:1 matching was mainly used in the past, but identification method based on 1:N matching is generally used recently. The control of the value of FAR is very important in the application areas such as access control and time attendance systems. This paper proposes dynamic thresholding scheme which could properly control the value of FAR according to the field of applications and size of the fingerprints database.

Cross-national Analysis of Robot Research Using Non-Structured Text Analytics for R&D Policy

  • Kim, Jeong Hun;Seo, Han Sol;Lee, Jae Woong;Lee, Jung Won;Kwon, Oh Byung
    • Asia Pacific Journal of Business Review
    • /
    • v.1 no.2
    • /
    • pp.63-88
    • /
    • 2017
  • With the advent of new frontiers in robotics, the spectrum of robot research area has widened in many fields and applications. Other than conventional robot research, many technologies such as smart devices, drones, healthcare robots, and soft robots are emerging as promising applications. Due to the research complexity of this topic, this research requires international collaboration and should be fertilized by R&D policies. This paper aims to propose a method to perform a cross-national analysis of robot research with unstructured data such as papers in the proceedings of an international conference. Text analytics are applied to extract research issues and applications in an automatic manner.

Efficient 1:N Fingerprint Matching Algorithm using Matching Score Distribution (매칭 점수 분포를 이용한 효율적인 1:N 지문 매칭 알고리듬)

  • Kim, Kyoung-Min;Park, Joong-Jo;Lee, Buhm;Go, Young-Jin;Jung, Soon-Won
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.3
    • /
    • pp.208-217
    • /
    • 2012
  • This paper presents two adaptive fingerprint matching methods. First, we experiment an adaptive threshold selection of 1:N matching system in order to raise the reliability of the matching score. Second, we propose a adaptive threshold selection using fitting algorithm for high speed matching. The experiment was conducted on the NITZEN database, which has 5247 samples. Consequently, this paper shows that our suggested method can perform 1.88 times faster matching speed than the bidirectional matching speed. And, we prove that FRR of our suggested method decreases 1.43 % than that of the unidirectional matching.

Visual Object Manipulation Based on Exploration Guided by Demonstration (시연에 의해 유도된 탐험을 통한 시각 기반의 물체 조작)

  • Kim, Doo-Jun;Jo, HyunJun;Song, Jae-Bok
    • The Journal of Korea Robotics Society
    • /
    • v.17 no.1
    • /
    • pp.40-47
    • /
    • 2022
  • A reward function suitable for a task is required to manipulate objects through reinforcement learning. However, it is difficult to design the reward function if the ample information of the objects cannot be obtained. In this study, a demonstration-based object manipulation algorithm called stochastic exploration guided by demonstration (SEGD) is proposed to solve the design problem of the reward function. SEGD is a reinforcement learning algorithm in which a sparse reward explorer (SRE) and an interpolated policy using demonstration (IPD) are added to soft actor-critic (SAC). SRE ensures the training of the critic of SAC by collecting prior data and IPD limits the exploration space by making SEGD's action similar to the expert's action. Through these two algorithms, the SEGD can learn only with the sparse reward of the task without designing the reward function. In order to verify the SEGD, experiments were conducted for three tasks. SEGD showed its effectiveness by showing success rates of more than 96.5% in these experiments.