• Title/Summary/Keyword: Optimized Path

Search Result 269, Processing Time 0.029 seconds

Recognition of Gap between base Plates for Automated Welding of Thick Plates (후판 자동용접을 위한 용접물의 갭 측정)

  • Yi, Hwa-Cho
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.4 s.97
    • /
    • pp.37-45
    • /
    • 1999
  • Many automated welding equipment are used in the industry. However, there are some problems to get quality welds because of the geometric error, thermal distortion, and incorrect joint fit-up. These factors can make the gap between base plates in case of a thick plate welding. The welding product with the quality welds can not be obtained without consideration of the gap. In this paper, the robot path and welding conditions are modified to get the quality weld by detecting the position and size of the gap. In this work, a low-priced laser range sensor is used. The 3-dimensional information is obtained using the motion of a robot, which holds a laser range sensor. The position and size of the gap is calculated using signal processing of the measured 3-dimensional information of joint profile geometry. The data measured by a laser range sensor is segmented by an iterative end point method. The segmented data is optimized by the least square method. The existence of gap is detected by comparing the data with the segmented shape of template. The effects of robot measuring speed and gap size are also tested. The recognizability fo the gap is verified as good by comparing the real joint profile and the calculated joint profile using the signal processing.

  • PDF

Analysis of Optimized Aggregation Timing in Wireless Sensor Networks

  • Lee, Dong-Wook;Kim, Jai-Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.2
    • /
    • pp.209-218
    • /
    • 2009
  • In a wireless sensor network(WSN) each sensor node deals with numerous sensing data elements. For the sake of energy efficiency and network lifetime, sensing data must be handled effectively. A technique used for this is data aggregation. Sending/receiving data involves numerous steps such as MAC layer control packet handshakes and route path setup, and these steps consume energy. Because these steps are involved in all data communication, the total cost increases are related to the counts of data sent/received. Therefore, many studies have proposed sending combined data, which is known as data aggregation. Very effective methods to aggregate sensing data have been suggested, but there is no means of deciding how long the sensor node should wait for aggregation. This is a very important issue, because the wait time affects the total communication cost and data reliability. There are two types of data aggregation; the data counting method and the time waiting method. However, each has weaknesses in terms of the delay. A hybrid method can be adopted to alleviate these problems. But, it cannot provide an optimal point of aggregation. In this paper, we suggest a stochastic-based data aggregation scheme, which provides the cost(in terms of communication and delay) optimal aggregation point. We present numerical analysis and results.

Measure of Effectiveness Analysis for Tracking in SONAR System (소나시스템에서의 추적효과도 분석)

  • Cho, Jung-Hong;Kim, Hyoung Rok;Kim, Seongil;Kim, Jea Soo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.1
    • /
    • pp.5-26
    • /
    • 2013
  • Since the optimized use of sonar systems for target tracking is a practical problem for naval operations, the measure of mission achievability is needed for preparing efficient sonar-maneuver tactic. In order to quantify the mission achievability or Measure Of Effectiveness(MOE) for given sonar-maneuver tactics, we developed and tested a simulation algorithm. The proposed algorithm for tracking is based on Measure Of Performance(MOP) for localization and tracking system of sonar against target. Probability of Detection(PD) using steering beam patterns referenced to the aspect angle of sonar is presented to consider the tracking-performance of sonar. Also, the integrated software package, named as Optimal Acoustic Search Path Planning(OASPP) is used for generating sonar-maneuver patterns and vulnerability analysis for a given scenario. Through simulation of a simple case for which the intuitive solution is known, the proposed algorithm is verified.

Novel Method of ACO and Its Application to Rotor Position Estimation in a SRM under Normal and Faulty Conditions

  • Torkaman, Hossein;Afjei, Ebrahim;Babaee, Hossein;Yadegari, Peyman
    • Journal of Power Electronics
    • /
    • v.11 no.6
    • /
    • pp.856-863
    • /
    • 2011
  • In this paper a novel method of the Ant Colony Optimization algorithm for rotor position estimation in Switched Reluctance Motors is presented. The data provided by the initial assumptions is one of the important aspects used to solve the problems relative to an Ant Colony algorithm. Considering the nature of a real ant colony, it was found that the ants have no primary data for deducing which is the shortest path in their initial iteration. They also do not have the ability to see the food sources at a distance. According to this point of view, a novel method is presented in which the rotor pole position relative to the corresponding stator pole in a switched reluctance motor is estimated with high accuracy using the active and inactive phase parameters. This new method gives acceptable results such as a desirable convergence together with an optimized and stable response. To the best knowledge of the authors, such an analysis has not been carried out previously.

Design of Z-directional gradient coil to improve gradient linearity for the nuclear magnetic resonace imaging(NMRI) (경사자장의 선형성 향상을 위한 핵자기공명 영상용 Z-방향 경사자기장 코일 설계)

  • Ko, Rock-Kil;Lee, Dong-Hoon;Baek, Seung-Tae;Kim, Song-Hui;Kwon, Young-Kil;Ryu, Kang-Sik
    • Proceedings of the KIEE Conference
    • /
    • 1998.07a
    • /
    • pp.235-237
    • /
    • 1998
  • Gradient coil offers the spatial informations of sample or patient in Nuclear Magnetic Resonance Imaging(NMRI) and its gradient field linearity over the field of view(FOV) has many influence on the MR imaging. Accurate and good quality MR imaging can be acquired by the high gradient field linearity over the FOV. So it is an important part to design of gradient coil with good linearity in the wide imaging range. Usually, Z-directional gradient field is generated by using the Helmholtz type coil which is consisted of one-pair loop with anti-current path. It gets less about 40% linearity of the diameter spherical volume(DSV). In this study, we calculated optimized geometrical parameters of two-pair loop system to cancel odd terms up to $B_7$ included effectively. we also analyzed and compared the gradient field distribution and linearity of the common Helmholtz coil with them of the two-pair loop system.

  • PDF

Improved TOA-Based Localization Method with BS Selection Scheme for Wireless Sensor Networks

  • Go, Seungryeol;Chong, Jong-Wha
    • ETRI Journal
    • /
    • v.37 no.4
    • /
    • pp.707-716
    • /
    • 2015
  • The purpose of a localization system is to estimate the coordinates of the geographic location of a mobile device. The accuracy of wireless localization is influenced by nonline-of-sight (NLOS) errors in wireless sensor networks. In this paper, we present an improved time of arrival (TOA)-based localization method for wireless sensor networks. TOA-based localization estimates the geographic location of a mobile device using the distances between a mobile station (MS) and three or more base stations (BSs). However, each of the NLOS errors along a distance measured from an MS (device) to a BS (device) is different because of dissimilar obstacles in the direct signal path between the two devices. To accurately estimate the geographic location of a mobile device in TOA-based localization, we propose an optimized localization method with a BS selection scheme that selects three measured distances that contain a relatively small number of NLOS errors, in this paper. Performance evaluations are presented, and the experimental results are validated through comparisons of various localization methods with the proposed method.

Location Tracking based on MS-Based/Assisted Location Trigger Model with Context-Awareness

  • Park, Sung-Suk;Lee, Yon-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.6
    • /
    • pp.63-69
    • /
    • 2016
  • In this paper, we proposed the location tracking system based on MS-Based/Assisted(Mobile Station-Based and Assisted) location trigger service model with context-awareness for the intelligent location tracking of moving objects. It provides the proper resulting value that matches the context of users through the analysis about the situation of the user, physical environment, computing resource and the existing information on user input. In order to provide real-time data, we proposed the location tracking system which realizes the intelligent information such as the expecting arrival time and passing the specific area of the moving object by adopting the location trigger. So, it derives to minimize the costs of communication for the mobile object tracking applications. The proposed location tracking system based on context-awareness can be used for realtime monitoring, intelligent alarm/action, setting up of the optimized moving path, dynamic adjustment of strategies and policies. So it has the advantage to develop the application system which is aimed at optimization of the object tracking and movement.

Implementation of Ray Tracing Processor for the Parallel Processing (병렬처리를 위한 고속 Ray Tracing 프로세서의 설계)

  • Choe, Gyu-Yeol;Jeong, Deok-Jin
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.5
    • /
    • pp.636-642
    • /
    • 1999
  • The synthesis of the 3D images is the most important part of the virtual reality. The ray tracing is the best method for reality in the 3D graphics. But the ray tracing requires long computation time for the synthesis of the 3D images. So, we implement the ray tracing with software and hardware. Specially we design the hit-test unit with FPGA tool for the ray tracing. Hit-test unit is a very important part of ray tracing to improve the speed. In this paper, we proposed a new hit-test algorithm and apply the parallel architecture for hit-test unit to improve the speed. We optimized the arithmetic unit because the critical path of hit-test unit is in the multiplication part. We used the booth algorithm and the baugh-wooley algorithm to reduce the partial product and adapted the CSA and CLA to improve the efficiency of the partial product addition. Our new Ray tracing processor can produce the image about 512ms/F and can be adapted to real-time application with only 10 parallel processors.

  • PDF

Efficient Query Retrieval from Social Data in Neo4j using LIndex

  • Mathew, Anita Brigit
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2211-2232
    • /
    • 2018
  • The unstructured and semi-structured big data in social network poses new challenges in query retrieval. This requirement needs to be met by introducing quality retrieval time measures like indexing. Due to the huge volume of data storage, there originate the need for efficient index algorithms to promote query processing. However, conventional algorithms fail to index the huge amount of frequently obtained information in real time and fall short of providing scalable indexing service. In this paper, a new LIndex algorithm, which is a heuristic on Lucene is built on Neo4jHA architecture that holds the social network Big data. LIndex is a flexible and simplified adaptive indexing scheme that ascendancy decomposed shortest paths around term neighbors as basic indexing unit. This newfangled index proves to be effectual in query space pruning of graph database Neo4j, scalable in index construction and deployment. A graph query is processed and optimized beyond the traditional Lucene in a time-based manner to a more efficient path method in LIndex. This advanced algorithm significantly reduces query fetch without compromising the quality of results in time. The experiments are conducted to confirm the efficiency of the proposed query retrieval in Neo4j graph NoSQL database.

Design Optimization of CRDM Motor Housing

  • Lee, Jae Seon;Lee, Gyu Mahn;Kim, Jong Wook
    • Journal of Magnetics
    • /
    • v.21 no.4
    • /
    • pp.586-592
    • /
    • 2016
  • The magnetic-jack type CRDM withdraws or inserts a control rod assembly from/to the reactor core to control the core reactivity. The CRDM housings form not only the path of the electromagnetic field but also the pressure boundary of a nuclear reactor, and a periodic in-service inspection should be carried out if there are welded or flange jointed parts on the pressure boundary. The in-service inspection is a time-consuming process during the reactor refueling, and moreover it is difficult to perform the inspection over the reactor head. A magnetic motor housing is applied for the current SMART CRDM and has several welding joints, however a nonmagnetic motor housing with fewer or no welding joints may improve the operational efficiency of the nuclear reactor by avoiding or simplifying the in-service inspection process. Prior to the development, the magnetic field transfer efficiency of the nonmagnetic housing was required to be assessed. It was verified and optimized by the electromagnetic analysis of the lifting force estimation. Magnetic flux rings were adopted to improve the efficiency. In this paper, the design and optimization process of a nonmagnetic motor housing with the magnetic flux rings for the SMART CRDM are introduced and the analyses results are discussed.