• Title/Summary/Keyword: Network Planning

Search Result 1,403, Processing Time 0.025 seconds

An Artificial Neural Network for the Optimal Path Planning (최적경로탐색문제를 위한 인공신경회로망)

  • Kim, Wook;Park, Young-Moon
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.333-336
    • /
    • 1991
  • In this paper, Hopfield & Tank model-like artificial neural network structure is proposed, which can be used for the optimal path planning problems such as the unit commitment problems or the maintenance scheduling problems which have been solved by the dynamic programming method or the branch and bound method. To construct the structure of the neural network, an energy function is defined, of which the global minimum means the optimal path of the problem. To avoid falling into one of the local minima during the optimization process, the simulated annealing method is applied via making the slope of the sigmoid transfer functions steeper gradually while the process progresses. As a result, computer(IBM 386-AT 34MHz) simulations can finish the optimal unit commitment problem with 10 power units and 24 hour periods (1 hour factor) in 5 minites. Furthermore, if the full parallel neural network hardware is contructed, the optimization time will be reduced remarkably.

  • PDF

Ubiquitous Home Security Robot System based on Sensor Network (센서 네트워크 기반의 홈 보안로봇 시스템 구현)

  • Kim, Yoon-Gu;Lee, Ki-Dong
    • The Journal of Korea Robotics Society
    • /
    • v.2 no.1
    • /
    • pp.71-79
    • /
    • 2007
  • We propose and develop Home Security robot system based on Sensor Network (HSSN) configured by sensor nodes including radio frequency (RF), ultrasonic, temperature, light and sound sensors. Our system can acknowledge security alarm events that are acquired by sensor nodes and relayed in the hop-by-hop transmission way. There are sensor network, Home Security Mobile Robot (HSMR) and Home Server(HS) in this system. In the experimental results of this system, we presented that our system has more enhanced performance of response to emergency context and more speedy and accurate path planning to target position for arriving an alarm zone with obstacle avoidance and acquiring the context-aware information.

  • PDF

The Efficient Computation Method of Two-commodity Network Flow Problem Using TSP (판매원 문제를 이용한 2-상품 네트워크 흐름 문제의 효율적인 계산방법)

  • Hwang, In-Keuk;Park, Dong-Jin;Yoon, Kwang-Sik
    • Journal of Korean Society of Rural Planning
    • /
    • v.5 no.1 s.9
    • /
    • pp.20-25
    • /
    • 1999
  • Our interest in this paper is in the efficient computation of a good low bound for the traveling salesman problem and is in the application of a network problem in agriculture. We base our approach on a relatively new formulation of the TSP as a two-commodity network flow problem. By assigning Lagrangian multipliers to certain constraints and relaxing them, the problem separates into two single-commodity network flow problems and an assignment problem, for which efficient algorithms are available.

  • PDF

An Optimization Model for a Single Cruise Ship Itinerary Planning (크루즈 선박의 운항일정계획을 위한 최적화 모형)

  • 조성철;권해규
    • Journal of the Korean Institute of Navigation
    • /
    • v.25 no.4
    • /
    • pp.323-333
    • /
    • 2001
  • This paper presents a decision making model for the cruise ship management. A network based optimization model has been developed for a single cruise ship operation. It gives optimal itinerary patterns over the planning period for the cruise ship managers wanting to maximize profit from the cruise ship operation. A network solution method to find the optimal solution is also developed. This network model can be equivalently transformed into a linear programming model, which makes the implementation of the model quite practical however complicated the given set of possible itineraries may be. The ship scheduling network developed in this study can also be used as a general framework to describe all possible cruise ship itineraries the cruise ship manager can figure out.

  • PDF

Analytic Determination of 3D Grasping points Using Neural Network (신경망을 이용한 3차원 잡는 점들의 해석적 결정)

  • 이현기;한창우;이상룡
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.4
    • /
    • pp.112-117
    • /
    • 2003
  • This paper deals with the problem of synthesis of the 3-dimensional Grasp Planning. In previous studies the genetic algorithm has been used to find optimal grasping points, but it had a limitation such as the determination time of grasping points was so long. To overcome this limitation we proposed a new algorithm which employs the Neural Network. In the Neural network we chose input parameters based on the shape of the object and output parameters resulted from optimization with the GA method. In this study the GRNN method is employed, it has been trained by the result value of optimization method and it has been tested by known object. The algorithm is verified by computer simulation.

Signal Control and Dynamic Route Guidance in ITS (지능형 교통체계에서의 신호제어와 동적 경로안내)

  • 박윤선
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.22 no.50
    • /
    • pp.333-340
    • /
    • 1999
  • An ideal traffic control system should consider simultaneously both route guidance of vehicles and signal policies at intersection of a traffic network. It is known that an iterative procedure gives an optimal route to each vehicle in the network. This paper presents an iterative procedure to find an optimal signal plan for the network. We define the optimal solution as a signal equilibrium. From the definition of signal equilibrium, we prove that the fixed point solution of the iterative procedure is a signal equilibrium, when optimal signal algorithms are implemented at each intersection of the network. A combined model of route guidance and signal planning is also suggested by relating the route guidance procedure and the signal planning procedure into a single loop iterative procedure.

  • PDF

Complete Coverage Path Planning of Cleaning Robot

  • Liu, Jiang;Kim, Kab-Il;Son, Young-I.
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.429-432
    • /
    • 2003
  • In this paper, a novel neural network approach is proposed for cleaning robot to complete coverage path planning with obstacle avoidance in stationary and dynamic environments. The dynamics of each neuron in the topologically organized neural network is characterized by a shunting equation derived from Hodgkin and Huxley's membrane equation. There are only local lateral connections among neurons. The robot path is autonomously generated from the dynamic activity landscape of the neural network and the previous robot location without any prior knowledge of the dynamic environment.

  • PDF

Analysis of effects on cell planning of IS-95A CDMA network by soft/softer handoff (Upbanded IS-95A CDMA 망에서 Soft/Softer handoff가 망설게에 미치는 영향분석)

  • 최홍석;노종선;박판종
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.9A
    • /
    • pp.2221-2229
    • /
    • 1998
  • Handoff is an important parameter for system performance and capacity analysis in CDMA cell planning. In this paper, simulation tool for analyzing the effects of soft handoff on cell planning of CDMA network is developed by studying propagation model in 1.9GHz frequency specrum, soft hadnoff algorithm given by IS-95, and several parameters for CDMA cell planning. By using the tool, soft handoff gain and effects of soft handoff on cDMA system performance and capacity are analyzed. Research results and simulation tool developed in this paper can be used for optimal CDMA cell planning for PCS and IMT-2000 in 1.9GHz frequency spectrum such as locating base station and parameter optimization.

  • PDF

A Study on Transmission System Expansion Planning using Fuzzy Branch and Bound Method

  • Park, Jaeseok;Sungrok Kang;Kim, Hongsik;Seungpil Moon;Lee, Soonyoung;Roy Billinton
    • KIEE International Transactions on Power Engineering
    • /
    • v.2A no.3
    • /
    • pp.121-128
    • /
    • 2002
  • This study proposes a new method for transmission system expansion planning using fuzzy integer programming. It presents stepwise cost characteristics analysis which is a practical condition of an actual system. A branch and bound method which includes the network flow method and the maximum flow - minimum cut set theorem has been used in order to carry out the stepwise cost characteristics analysis. Uncertainties of the permissibility of the construction cost and the lenient reserve rate and load forecasting of expansion planning have been included and also processed using the fuzzy set theory in this study. In order to carry out the latter analysis, the solving procedure is illustrated in detail by the branch and bound method which includes the network flow method and maximum flow-minimum cut set theorem. Finally, case studies on the 21- bus test system show that the algorithm proposed is efficiently applicable to the practical expansion planning of transmission systems in the future.

A Study on Establishment of Mitigation Technique of Deterioration for Environmental-friendly Dam Construction in Rural Area - A focus of the Plant Ecosystem - (농촌지역내 친환경적인 댐 조성을 위한 훼손저감기법 적용 연구 - 식물생태계를 중심으로 -)

  • Lee, Soo-Dong;Kang, Hyun-Kyung
    • Journal of Korean Society of Rural Planning
    • /
    • v.16 no.2
    • /
    • pp.31-45
    • /
    • 2010
  • Building a dam that is not considering the environmental impact and human social impact can cause the loss of entire ecospheres such as fragmentary green network, disturbance of plants ecosystem, the destruction of social and cultural indigenous resources, therefore, it can occur the environment change and distortion of ecosystem. The purpose of this study is that presenting the methods of ecosystem maintenance and ecosystem damage compensation about for environmentally direct impact i.e. the ecosystem change in the intended place for building a dam. According to the planning progress, the study was proceeded to planning site examine, assessment, conception plan. As the results of examine and assessment, it must be necessary to offered the maintenance and damage compensation if the site where include the 1st degree of biotope area, the 2nd degree of biotope and the 8th degree of green naturality area were damaged by being submerged and constructing road. In addition, according to the conception plan, we suggest the mitigation proposals such as plant communities transplant, planning of connecting green network against for influencing direct impact ecosystem that is destroying plant communities, damaging inhabitants, noise pollution, water pollution, etc.