• 제목/요약/키워드: Optimal sensor location

검색결과 114건 처리시간 0.027초

공작기계 열오차 모델의 최적 센서위치 선정 (Selection of Optimal Sensor Locations for Thermal Error Model of Machine tools)

  • 안중용
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 1999년도 추계학술대회 논문집 - 한국공작기계학회
    • /
    • pp.345-350
    • /
    • 1999
  • The effectiveness of software error compensation for thermally induced machine tool errors relies on the prediction accuracy of the pre-established thermal error models. The selection of optimal sensor locations is the most important in establishing these empirical models. In this paper, a methodology for the selection of optimal sensor locations is proposed to establish a robust linear model which is not subjected to collinearity. Correlation coefficient and time delay are used as thermal parameters for optimal sensor location. Firstly, thermal deformation and temperatures are measured with machine tools being excited by sinusoidal heat input. And then, after correlation coefficient and time delays are calculated from the measured data, the optimal sensor location is selected through hard c-means clustering and sequential selection method. The validity of the proposed methodology is verified through the estimation of thermal expansion along Z-axis by spindle rotation.

  • PDF

OPTMAL LICATION OF ACOUSTIC SENSORS AND OPTIMAL OBSERVATION POLICY FOR DETECTING ANIMALIUS PLANE OBJECY IN SHIELD CINSTRUCTION METHOD

  • Yamane, Kenji;Tanaka, Shogo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
    • /
    • pp.240-243
    • /
    • 1995
  • In excavating tunnels, shield tunneling machines having many cutters on their cutter planes are used. Not many observation data being available in the detection system, optimal observation policy is very important. From this viewpoint, we previously considered the optimal location of acoustic sensors on the cutter plane and also the optimal observation policy for the case where three receiving transducers were used, and showed that the optimal sensor location was given as arbitrary equally-spaced points on the cutter plane circle, and that the optimal rotating angles were also found to be arbitrary. In application, however, it is often difficult to locate sensors at arbitrary positions or to use three sensors from the viewpoints of machine structure and cost. This paper considers the optimal observation policy for detecting anomlous plane objects for the case where two receiving transducers are used and the case where three receiving transducers are located only on a diameter of the cutter plane.

  • PDF

모니터링 정확도와 운용 강건성을 고려한 개인전투체계용 착용형 생체센서 어레이의 최적 위치 분석 (Analysis of the Optimal Location of Wearable Biosensor Arrays for Individual Combat System Considering Both Monitoring Accuracy and Operational Robustness)

  • 하슬기;박상헌;임현철;백승호;김도경;윤상희
    • 한국군사과학기술학회지
    • /
    • 제22권2호
    • /
    • pp.287-297
    • /
    • 2019
  • Monitoring for the physiological state of a solider is essential to the realization of individual combat system. Despite all efforts over the last decades, there is no report to point out the optimal location of the wearable biosensors considering both monitoring accuracy and operational robustness. In response, we quantitatively measure body temperature and heartrate from 34 body parts using 2 kinds of biosensor arrays, each of which consists of a thermocouple(TC) sensor and either a photoplethysmography(PPG) sensor or an electrocardiography(ECG) sensor. The optimal location is determined by scoring each body part in terms of signal intensity, convenience in use, placement durability, and activity impedance. The measurement leads to finding the optimal location of wearable biosensor arrays. Thumb and chest are identified as best body parts for TC/PPG sensors and TC/ECG sensors, respectively. The findings will contribute to the successful development of individual combat system.

An Optimal Algorithm for the Sensor Location Problem to Cover Sensor Networks

  • 김희선;박성수
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
    • /
    • pp.17-24
    • /
    • 2006
  • We consider the sensor location problem (SLP) on a given sensor field. We present the sensor field as grid of points. There are several types of sensors which have different detection ranges and costs. If a sensor is placed in some point, the points inside of its detection range can be covered. The coverage ratio decreases with distance. The problem we consider in this thesis is called multiple-type differential coverage sensor location problem (MDSLP). MDSLP is more realistic than SLP. The coverage quantities of points are different with their distance form sensor location in MDSLP. The objective of MDSLP is to minimize total sensor costs while covering every sensor field. This problem is known as NP-hard. We propose a new integer programming formulation of the problem. In comparison with the previous models, the new model has a smaller number of constraints and variables. This problem has symmetric structure in its solutions. This group is used for pruning in the branch-and-bound tree. We solved this problem by branch-and-cut(B&C) approach. We tested our algorithm on about 60 instances with varying sizes.

  • PDF

Optimal sensor placement for mode shapes using improved simulated annealing

  • Tong, K.H.;Bakhary, Norhisham;Kueh, A.B.H.;Yassin, A.Y. Mohd
    • Smart Structures and Systems
    • /
    • 제13권3호
    • /
    • pp.389-406
    • /
    • 2014
  • Optimal sensor placement techniques play a significant role in enhancing the quality of modal data during the vibration based health monitoring of civil structures, where many degrees of freedom are available despite a limited number of sensors. The literature has shown a shift in the trends for solving such problems, from expansion or elimination approach to the employment of heuristic algorithms. Although these heuristic algorithms are capable of providing a global optimal solution, their greatest drawback is the requirement of high computational effort. Because a highly efficient optimisation method is crucial for better accuracy and wider use, this paper presents an improved simulated annealing (SA) algorithm to solve the sensor placement problem. The algorithm is developed based on the sensor locations' coordinate system to allow for the searching in additional dimensions and to increase SA's random search performance while minimising the computation efforts. The proposed method is tested on a numerical slab model that consists of two hundred sensor location candidates using three types of objective functions; the determinant of the Fisher information matrix (FIM), modal assurance criterion (MAC), and mean square error (MSE) of mode shapes. Detailed study on the effects of the sensor numbers and cooling factors on the performance of the algorithm are also investigated. The results indicate that the proposed method outperforms conventional SA and Genetic Algorithm (GA) in the search for optimal sensor placement.

무선 센서 네트워크에서 향상된 교차 계층 방식의 위치기반 데이터 전달 기법 (An Enhanced Cross-layer Geographic Forwarding Scheme for Wireless Sensor Networks)

  • 김재현;김석규;이재용
    • 한국통신학회논문지
    • /
    • 제37권8B호
    • /
    • pp.712-721
    • /
    • 2012
  • 본 논문에서는 무선 센서 네트워크에서 프로토콜 성능 극대화를 위해서 비동기식 MAC과 라우팅 교차 계층 방식의 향상된 위치 기반 데이터 전송 (Enhanced Geographic Forwarding; EGF) 기법을 제안한다. EGF 기법은 기존의 일반적인 위치 기반 전송 알고리즘과 달리 주기적인 이웃 노드들의 위치 정보 등을 이용하지 않고, 오직 소스와 목적지 노드의 위치 정보와 에너지 비용 정보만을 이용한 최적의 back-off 매핑 메커니즘을 사용하여 데이터를 전송한다. 또한 효율적인 MAC과 라우팅의 교차 계층 방식으로 오버헤드를 최소화하고 데이터 전달 성능을 최적화 하였다. 성능 분석 결과 패킷 전송 성공률, 저전력성 및 데이터 전송 지연에 대해서 향상된 성능을 확인하였다.

무선 센서 네트워크에서 쥐치 정보의 시간차를 이용한 에너지 효율적인 라우팅 프로토콜 (Geographical Time Back-off Routing Protocol for Wireless Sensor Networks)

  • 김재현;심인보;김홍;이재용
    • 한국통신학회논문지
    • /
    • 제32권5B호
    • /
    • pp.247-256
    • /
    • 2007
  • 본 논문에서는 무선 센서 네트워크를 위한 위치 정보의 시간차를 이용한 라우팅 프로토콜(Geo-Back)을 제안한다. Geo-Back은 기존의 위치 기반 라우팅 알고리즘과 달리 주기적인 이웃 노드들의 위치 정보 혹은 하나의 홉 내에 있는 이웃 노드들 수의 정보를 이용하지 않고, 오직 소스와 목적지 노드의 위치 정보만을 이용하며, 최적의 back-off 시간 메커니즘을 사용하여 패킷 전송을 결정한다. 빈번한 토폴로지 변화 환경 하에서, 제안하는 Geo-Back 프로토콜은 업데이트를 위한 브로드캐스트 알고리즘을 사용하지 알고 빠르게 목적지까지 전송하기 위한 최적의 다음 홉을 찾을 수 있으며, 분석 결과 밀집 환경의 무선 센서 네트워크에서 확장성과 향상된 성능을 확인 하였다.

데이터 수집의 이산적 특성을 고려한 네트워크 센서 위치 모형 (A Network Sensor Location Model Considering Discrete Characteristics of Data Collection)

  • 양재환;고승영;김동규
    • 한국ITS학회 논문지
    • /
    • 제16권5호
    • /
    • pp.38-48
    • /
    • 2017
  • 속도, 점유율, 교통량 등의 링크 속성은 교통계획 및 운영에 필수적인 요소이다. 따라서 링크 속성 정보를 수집하기 위한 센서들의 최적 위치를 결정하는 것은 지능형교통시스템(ITS)의 중요한 의사결정 중 하나이다. 본 연구는 전체 네트워크 교통정보의 변동성을 최소화하기 위한 네트워크 센서의 최적 입지를 결정하는 모형을 개발하는 것을 목적으로 한다. 이를 위해 데이터 수집의 이산적 특성을 반영한 네트워크 센서 위치 모형(NSLM)이 개발된다. 교통 정보의 변동성 지표는 분산-공분산 행렬의 대각요소의 합을 통해 계산된다. 개발된 모형의 적용가능성을 평가하기 위해, 대구광역시 도로에서 단거리 전용 통신(DSRC)으로 수집되는 속도 자료가 이용된다. 본 연구는 지능형교통시스템(ITS)의 투자 효율성을 제고하고 정보 정확도를 개선하는 데에 기여할 것으로 기대된다.

An approach for optimal sensor placement based on principal component analysis and sensitivity analysis under uncertainty conditions

  • Beygzadeh, Sahar;Torkzadeh, Peyman;Salajegheh, Eysa
    • Structural Monitoring and Maintenance
    • /
    • 제9권1호
    • /
    • pp.59-80
    • /
    • 2022
  • In the present study, the objective is to detect the structural damages using the responses obtained from the sensors at the optimal location under uncertainty conditions. Reducing the error rate in damage detection process due to responses' noise is an important goal in this study. In the proposed algorithm for optimal sensor placement, the noise of responses recorded from the sensors is initially reduced using the principal component analysis. Afterward, the optimal sensor placement is obtained by the damage detection equation based sensitivity analysis. The sensors are placed on degrees of freedom corresponding to the minimum error rate in structural damage detection through this procedure. The efficiency of the proposed method is studied on a truss bridge, a space dome, a double-layer grid as well as a three-story experimental frame structure and the results are compared. Moreover, the performance of the suggested method is compared with three other algorithms of Average Driving Point Residue (ADPR), Effective Independence (EI) method, and a mass weighting version of EI. In the examples, young's modulus, density, and cross-sectional areas of the elements are considered as uncertainty parameters. Ultimately, the results have demonstrated that the presented algorithm under uncertainty conditions represents a high accuracy to obtain the optimal sensor placement in the structures.

Adaptive Reversal Tree Protocol with Optimal Path for Dynamic Sensor Networks

  • 황광일
    • 한국통신학회논문지
    • /
    • 제32권10A호
    • /
    • pp.1004-1014
    • /
    • 2007
  • In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.