• Title/Summary/Keyword: Moving node

Search Result 274, Processing Time 0.026 seconds

Visual Servoing of Robot Manipulators using Pruned Recurrent Neural Networks (저차원화된 리커런트 뉴럴 네트워크를 이용한 비주얼 서보잉)

  • 김대준;이동욱;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.11a
    • /
    • pp.259-262
    • /
    • 1997
  • This paper presents a visual servoing of RV-M2 robot manipulators to track and grasp moving object, using pruned dynamic recurrent neural networks(DRNN). The object is stationary in the robot work space and the robot is tracking and grasping the object by using CCD camera mounted on the end-effector. In order to optimize the structure of DRNN, we decide the node whether delete or add, by mutation probability, first in case of delete node, the node which have minimum sum of input weight is actually deleted, and then in case of add node, the weight is connected according to the number of case which added node can reach the other nodes. Using evolutionary programming(EP) that search the struture and weight of the DRNN, and evolution strategies(ES) which train the weight of neuron, we pruned the net structure of DRNN. We applied the DRNN to the Visual Servoing of a robot manipulators to control position and orientation of end-effector, and the validity and effectiveness of the pro osed control scheme will be verified by computer simulations.

  • PDF

A Study on the Detent force Minimization Using Notch in Slotted Pemanent Magnet Linear Synchronous Motor (PMLSM의 디텐트력 최소화를 위한 Notch의 적용에 관한 연구)

  • Lee, Donf-Yeue;Kim, Gyu-Tak
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.54 no.10
    • /
    • pp.477-482
    • /
    • 2005
  • In this paper, detent force is minimized using notch and slot-aputure width adjustment in a slotted PMLSM. This time, the moving model node technique has used to reduce the time and the effort for calculation according to changing design parameters. As the result, the detent force of proposed model is decreased from 9.44[N] to 0.97[N] compare with it of basic model greatly. The thrust Is decreased 1.3[$\%$] from 342.07[N] to 337.48[N] a little. The notch is applied to PMLSM simply, the detent force is reduced greatly.

Detent Force Minimization Techniques in Permanent Magnet Linear Synchronous Motor (영구자석 선형동기전동기의 디텐트력 저감법)

  • Lim, Ki-Chae;Woo, Joon-Keun;Hong, Jung-Pyo;Kim, Gyu-Tak
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.49 no.11
    • /
    • pp.749-756
    • /
    • 2000
  • Detent force develops generally undesirable effect that contributes to the output ripple of machine, vibration and noise. This paper proposes detent force minimization techniques for a Permanent Magnet Linear Synchronous Motor (PMLSM). In addition, thrust according to each minimization technique is estimated to observe the change of machine performance. A two-dimensional Finite Element Method is used to predict detent force and thrust due to structural factors and non-linearity. And moving node technique for geometric models is proposed to reduce modeling time and efforts.

  • PDF

Node Activation Technique for Finite Element Model : Ⅰ. Theory (유한요소 모델의 절점 활성화 기법 : Ⅰ. 이론)

  • Jo, Jin Yeon;Kim, Do Nyeon;Kim, Seung Jo
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.31 no.4
    • /
    • pp.26-34
    • /
    • 2003
  • In this paper, a novel technique is proposed to arbitrarily activate the nodal points in finite element model through the meshless approximation methods such as MLS(moving least squares method), and theoretical investigations are carried out including the consistency and boundeness of numerical solution to prove the validity of the proposed method. By using the proposed node activation technique, one can activate and handle only the concerned nodes as unknown variables among the large number of nodal points in the finite element model. Therefore, the proposed technique has a great potential in design and reanalysis procedure.

An Approach for Applying Network-based Moving Target Defense into Internet of Things Networks

  • Park, Tae-Keun;Park, Kyung-Min;Moon, Dae-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.9
    • /
    • pp.35-42
    • /
    • 2019
  • In this paper, we propose an approach to apply network-based moving target defense into Internet of Things (IoT) networks. The IoT is a technology that provides the high interconnectivity of things like electronic devices. However, cyber security risks are expected to increase as the interconnectivity of such devices increases. One recent study demonstrated a man-in-the-middle attack in the statically configured IoT network. In recent years, a new approach to cyber security, called the moving target defense, has emerged as a potential solution to the challenge of static systems. The approach continuously changes system's attack surface to prevent attacks. After analyzing IPv4 / IPv6-based moving target defense schemes and IoT network-related technologies, we present our approach in terms of addressing systems, address mutation techniques, communication models, network configuration, and node mobility. In addition, we summarize the direction of future research in relation to the proposed approach.

Lazy Bulk Insertion Method of Moving Objects Using Index Structure Estimation (색인 구조 예측을 통한 이동체의 지연 다량 삽입 기법)

  • Kim, Jeong-Hyun;Park, Sun-Young;Jang, Hyong-Il;Kim, Ho-Suk;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.7 no.3 s.15
    • /
    • pp.55-65
    • /
    • 2005
  • This paper presents a bulk insertion technique for efficiently inserting data items. Traditional moving object database focused on efficient query processing that happens mainly after index building. Traditional index structures rarely considered disk I/O overhead for index rebuilding by inserting data items. This paper, to solve this problem, describes a new bulk insertion technique which efficiently induces the current positions of moving objects and reduces update cost greatly. This technique uses buffering technique for bulk insertion in spatial index structures such as R-tree. To analyze split or merge node, we add a secondary index for information management on leaf node of primary index. And operations are classified to reduce unnecessary insertion and deletion. This technique decides processing order of moving objects, which minimize split and merge cost as a result of update operations. Experimental results show that this technique reduces insertion cost as compared with existing insertion techniques.

  • PDF

A Study for Improvement Performance on Using Exponentially Weighted Moving Average at IPv6 networks (IPv6 네트웍 환경에서 지수가중적 이동평균 기법을 이용한 성능향상에 관한 연구)

  • Oh, Ji-Hyun;Jeong, Choong-Kyo
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2007.08a
    • /
    • pp.323-326
    • /
    • 2007
  • Mobility Anchor Points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro handoff. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we proposed a cost effective MAP selection scheme. When leaving the current MAP domain. the mobile node calculates the optimum MAP domain size to minimize the local mobility cost at the new MAP domain considering mobile node's velocity and packet transmission rate. The mobile node then selects a MAP domain of size close to the optimum domain size calculated among the candidate MAP domains. In this way, it is possible for the mobile node to select an optimal MAP adaptively taking the network and node states into account, thus reducing the communication cost.

  • PDF

A Scalable Real Time Location measuring System for High Speed Moving Objects (고속 이동체를 위한 확장성 있는 실시간 위치 측정 시스템)

  • Ahn, Si-Young;Park, Jun-Seok;Oh, Ha-Ryoung;Seong, Yeong-Rak
    • The KIPS Transactions:PartA
    • /
    • v.19A no.2
    • /
    • pp.85-92
    • /
    • 2012
  • In this paper, a highly scalable real-time locating system which can measure location of fast moving targets is proposed. Within the system, the location service area is partitioned into grids with squares which is referred to as a macro-cell. Also, a macro-cell is further partitioned into $N{\times}N$ micro-cells. In a micro-cell, location reference nodes are placed on every vertex and an arbitration node is placed on the center. When a mobile node tries to measure its location, it should first communicate with the arbitration nodes for granting location measurement operation. Therefore, within a micro-cell, only one granted mobile node can calculate its location by a series of communication with location reference nodes. To evaluate performance of the proposed system, the system is modeled and simulated. The simulation result shows that the proposed system requires small communication time for location measurement operation and produces small location calculation error for fast moving targets.

Performance of VoIP based on Speed of Mobile Node over MANETs (MANET에서 모바일 노드 이동 속도에 따른 VoIP 성능)

  • Yoon, Tong-Il;Kim, Young-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.750-752
    • /
    • 2010
  • MANET has some interest as a wireless mobile network supporting node mobility and having no additional infrastructure. Speed of mobile node on MANET is various from just slow speed of human's walk to vehicle's moving speed. In this study, VoIP performance of MANET is evaluated in the view of speed of mobile node. VoIP performance is studied on walking speed, vehicle speed and higher speed on MANET. PDR(Packet Delivery Ratio), MOS(Mean Opinion Score) are used as performance parameters.

  • PDF

Self-Organization Routing Protocol supporting Node moving in Wireless Sensor Network (무선 센서 네트워크에서의 노드 이동을 지원하는 자가 구성 라우팅 프로토콜)

  • Kim, Yong;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.1035-1037
    • /
    • 2009
  • Common to use fixed-node sensor network and wireless sensor networks, unlike the recent move of the node happens frequently. These wireless sensor networks by taking into account the mobility of sensor nodes dynamically self-configurable routing protocol is required. In this paper, a fixed-node configuration and energy efficiency in the self-LEACH protocol is based on the useful movement of the nodes of the cluster is dynamically self-configuring routing protocols offer M-LEACH.

  • PDF