• 제목/요약/키워드: The Minimum Distance Problem

검색결과 127건 처리시간 0.029초

모바일 센서 네트워크에서 최단거리 멀티홉 전송을 위한 강한연결 클러스터 기법 (Strong Connection Clustering Scheme for Shortest Distance Multi-hop Transmission in Mobile Sensor Networks)

  • 우매리
    • 한국멀티미디어학회논문지
    • /
    • 제21권6호
    • /
    • pp.667-677
    • /
    • 2018
  • Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

듀얼카메라를 활용한 ACC 안전성 평가 방법에 관한 연구 (A Study on the ACC Safety Evaluation Method Using Dual Cameras)

  • 김봉주;이선봉
    • 자동차안전학회지
    • /
    • 제14권2호
    • /
    • pp.57-69
    • /
    • 2022
  • Recently, as interest in self-driving cars has increased worldwide, research and development on the Advanced Driver Assist System is actively underway. Among them, the purpose of Adaptive Cruise Control (ACC) is to minimize the driver's driving fatigue through the control of the vehicle's longitudinal speed and relative distance. In this study, for the research of the ACC test in the real environment, the real-road test was conducted based on domestic-road test scenario proposed in preceding study, considering ISO 15622 test method. In this case, the distance measurement method using the dual camera was verified by comparing and analyzing the result of using the dual camera and the result of using the measurement equipment. As a result of the comparison, two results could be derived. First, the relative distance after stabilizing the ACC was compared. As a result of the comparison, it was found that the minimum error rate was 0.251% in the first test of scenario 8 and the maximum error rate was 4.202% in the third test of scenario 9. Second, the result of the same time was compared. As a result of the comparison, it was found that the minimum error rate was 0.000% in the second test of scenario 10 and the maximum error rate was 9.945% in the second test of scenario 1. However, the average error rate for all scenarios was within 3%. It was determined that the representative cause of the maximum error occurred in the dual camera installed in the test vehicle. There were problems such as shaking caused by road surface vibration and air resistance during driving, changes in ambient brightness, and the process of focusing the video. Accordingly, it was determined that the result of calculating the distance to the preceding vehicle in the image where the problem occurred was incorrect. In the development stage of ADAS such as ACC, it is judged that only dual cameras can reduce the cost burden according to the above derivation of test results.

시뮬레이션과 최적화 모형을 혼합 적용한 구급차 위치선정 모형의 해법연구 (A Study of Ambulance Location Problem Applying the Iterative Procedure of Simulation and Optimization)

  • 임영선;김선훈;이영훈
    • 한국경영과학회지
    • /
    • 제37권4호
    • /
    • pp.197-209
    • /
    • 2012
  • This paper studies an emergency service vehicle location problem, where minimum reliability level pre-specified at each demand point is assured. Several models are suggested depending on the busy fraction, which is the time proportion of unavailability for the ambulances. In this paper a new model on computing the busy fraction is suggested, where it varies depending on the distance between the demand point and ambulances, hence it may respond the more realistic situation. The busy fraction for the ambulance location determined by the optimization model is computed by the simulation, and updated through the iterative procedure. It has been shown that the performances of the solutions obtained by the algorithm suggested for the instances appeared in the literature.

K-최단경로문제를 위한 MPS 방법의 효율적인 구현 (An Efficient Implementation of the MPS algorithm for the K-Shortest Path Problem)

  • 도승용
    • 한국국방경영분석학회지
    • /
    • 제25권1호
    • /
    • pp.29-36
    • /
    • 1999
  • In this paper, we are concerned with the K-shortest loopless path problem. The MPS algorithm, recently proposed by Martins et al., finds paths efficiently because it solves the shortest path problem only one time unlike other algorithms. But its computational complexity has not been known yet. We propose a few techniques by which the MPS algorithm can be implemented efficiently. First, we use min-heap data structure for the storage of candidate paths in order to reduce searching time for finding minimum distance path. Second, we prevent the eliminated paths from reentering in the list of candidate paths by lower bounding technique. Finally, we choose the source mode as a deviation node, by which selection time for the deviation node is reduced and the performance is improved in spite of the increase of the total number of candidate paths.

  • PDF

Development of Potential Function Based Path Planning Algorithm for Mobile Robot

  • Lee, Sang-Il;Kim, Myun-Hee;Oh, Kwang-Seuk;Lee, Sang-Ryong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.2325-2330
    • /
    • 2005
  • A potential field method for solving the problem of path planning based on global and local information for a mobile robot moving among a set of stationary obstacles is described. The concept of various method used path planning is used design a planning strategy. A real human living area is constructed by many moving and imminence obstacles. Home service mobile robot must avoid many obstacles instantly. A path that safe and attraction towards the goal is chosen. The potential function depends on distance from the goal and heuristic function relies on surrounding environments. Three additional combined methods are proposed to apply to human living area, calibration robots position by measured surrounding environment and adapted home service robots. In this work, we proposed the application of various path planning theory to real area, human living. First, we consider potential field method. Potential field method is attractive method, but that method has great problem called local minimum. So we proposed intermediate point in real area. Intermediate point was set in doorframe and between walls there is connect other room or other area. Intermediate point is very efficiency in computing path. That point is able to smaller area, area divided by intermediate point line. The important idea is intermediate point is permanent point until destruction house or apartment house. Second step is move robot with sensing on front of mobile robot. With sensing, mobile robot recognize obstacle and judge moving obstacle. If mobile robot is reach the intermediate point, robot sensing the surround of point. Mobile robot has data about intermediate point, so mobile robot is able to calibration robots position and direction. Third, we gave uncertainty to robot and obstacles. Because, mobile robot was motion and sensing ability is not enough to control. Robot and obstacle have uncertainty. So, mobile robot planed safe path planning to collision free. Finally, escape local minimum, that has possibility occur robot do not work. Local minimum problem solved by virtual obstacle method. Next is some supposition in real living area.

  • PDF

레이저거리계를 이용한 자율 주행로봇의 국부 경로계획 알고리즘 (A Local Path Planning Algorithm of Free Ranging Mobile Robot Using a Laser Range Finder)

  • 차영엽;권대갑
    • 대한기계학회논문집
    • /
    • 제19권4호
    • /
    • pp.887-895
    • /
    • 1995
  • Considering that the laser range finder has the excellent resolution with respect to angular and distance measurements, a sophisticated local path planning algorithm is achieved by subgoal and sub-subgoal searching methods. The subgoal searching finds the passable ways between obstacles and selects the optimal pathway in order to reduce the moving distanced from start point to given to given goal. On the other hand, the sub-subgoal searching corrects the path given in subgoal searching in the case of which the mobile robot will collide with obstacles. Also, the effectiveness of the established local path planning and local minimum avoiding algorithm are estimated by computer simulation and experimentation in complex environment.

다차원 MMCD를 이용한 음성/음악 판별 (Speech/Music Discrimination Using Multi-dimensional MMCD)

  • 최무열;송화전;박슬한;김형순
    • 대한음성학회:학술대회논문집
    • /
    • 대한음성학회 2006년도 추계학술대회 발표논문집
    • /
    • pp.142-145
    • /
    • 2006
  • Discrimination between speech and music is important in many multimedia applications. Previously we proposed a new parameter for speech/music discrimination, the mean of minimum cepstral distances (MMCD), and it outperformed the conventional parameters. One weakness of it is that its performance depends on range of candidate frames to compute the minimum cepstral distance, which requires the optimal selection of the range experimentally. In this paper, to alleviate the problem, we propose a multi-dimensional MMCD parameter which consists of multiple MMCDs with different ranges of candidate frames. Experimental results show that the multi-dimensional MMCD parameter yields an error rate reduction of 22.5% compared with the optimally chosen one-dimensional MMCD parameter.

  • PDF

다차원 MMCD를 이용한 음성/음악 판별 (Speech/Music Discrimination Using Multi-dimensional MMCD)

  • 최무열;송화전;박슬한;김형순
    • 대한음성학회지:말소리
    • /
    • 제60호
    • /
    • pp.191-201
    • /
    • 2006
  • Discrimination between speech and music is important in many multimedia applications. Previously we proposed a new parameter for speech/music discrimination, the mean of minimum cepstral distances (MMCD), and it outperformed the conventional parameters. One weakness of MMCD is that its performance depends on range of candidate frames to compute the minimum cepstral distance, which requires the optimal selection of the range experimentally. In this paper, to alleviate the problem, we propose a multi-dimensional MMCD parameter which consists of multiple MMCDS with combination of different candidate frame ranges. Experimental results show that the multi-dimensional MMCD parameter yields an error rate reduction of 22.5% compared with the optimally chosen one-dimensional MMCD parameter.

  • PDF

Minimum-weight design of stiffened shell under hydrostatic pressure by genetic algorithm

  • Ghasemi, A.R.;Hajmohammad, M.H.
    • Steel and Composite Structures
    • /
    • 제19권1호
    • /
    • pp.75-92
    • /
    • 2015
  • In this paper, optimization of cylindrical shells under external pressure to minimize its weight has been studied. Buckling equations are based on standard of ABS underwater vehicles. Dimension and type of circumferential stiffeners, and its distance from each other are assumed as variables of optimization problem. Considering the extent of these variables, genetic algorithms have been used for optimization. To study the effect of hydrostatic pressure on the shell and its fabrication according to the existing standards, geometrical and construction as well as stress and buckling constraints have been used in optimization algorithm and also penalty functions are applied to eliminate weak model. Finally, the best model which has the minimum weight considering the applied pressure has been presented.

불규칙 작용힘들간의 Correlation이 평판의 진동레벨에 미치는 영향 (Effects of Source Correlation on Plates Driven by Multi-point Random Forces)

  • Oh, S.G.;Park, J.D.;Kwak, C.S.
    • 한국정밀공학회지
    • /
    • 제11권1호
    • /
    • pp.166-176
    • /
    • 1994
  • The problem of reducing the vibration level of elastic plates driven by multiple random point forces is analyzed in this study. First, the analytical solution for the vibration level of finite thin plates with four simply supported edges under the action of multiple random point force is derived. By assuming the plates to be lightly damped, an approximate solution for the vibration level of the plate is obtained. A numerical study is carried out to determine an optimal spacing distance between the multiple point forces in order to produce a relative minimum in the plate's vibration level. The optimal spacing distance is shown to depend on the given excitation band. The effects of wave cancellation in the near field of the multiple point forces are discussed by using the equivalence of certain stationary random responses and deterministic pulse responese.

  • PDF