• Title/Summary/Keyword: Network Planning

Search Result 1,403, Processing Time 0.024 seconds

Optimal Feeder Routing for Distribution System Planning Using a Heuristic Strategy (휴리스틱 탐색전략을 이용한 배전계통 계획의 급전선 최적 경로 선정)

  • Choi, Nam-Jin;Kim, Byung-Seop;Shin, Joong-Rin
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.49 no.11
    • /
    • pp.566-574
    • /
    • 2000
  • This paper propose a heuristic algorithm based on the Branch-Exchange (BE) method to solve Optimal feeder Routing(OFR) problem for the distribution system planning. The cost function of the OFR problem is consisted of the investment cost representing the feeder installation and the system operation cost representing the system power loss. We propose a properly designed heuristic strategy, which can handle the horizon-year expansion planning problem of power distribution network. We also used the loop selection method which can define the maximum loss reduction in the network to reduce calculation time, and proposed a new index of power loss which is designed to estimate the power loss reduction in the BE. The proposed index, can be considered with both sides, the low voltage side and voltage side branch connected with tie one. The performances of the proposed algorithms and loss index were shown with 32, 69 example bus system.

  • PDF

Path Planning of Unmanned Aerial Vehicle based Reinforcement Learning using Deep Q Network under Simulated Environment (시뮬레이션 환경에서의 DQN을 이용한 강화 학습 기반의 무인항공기 경로 계획)

  • Lee, Keun Hyoung;Kim, Shin Dug
    • Journal of the Semiconductor & Display Technology
    • /
    • v.16 no.3
    • /
    • pp.127-130
    • /
    • 2017
  • In this research, we present a path planning method for an autonomous flight of unmanned aerial vehicles (UAVs) through reinforcement learning under simulated environment. We design the simulator for reinforcement learning of uav. Also we implement interface for compatibility of Deep Q-Network(DQN) and simulator. In this paper, we perform reinforcement learning through the simulator and DQN, and use Q-learning algorithm, which is a kind of reinforcement learning algorithms. Through experimentation, we verify performance of DQN-simulator. Finally, we evaluated the learning results and suggest path planning strategy using reinforcement learning.

  • PDF

Deep Q-Learning Network Model for Container Ship Master Stowage Plan (컨테이너 선박 마스터 적하계획을 위한 심층강화학습 모형)

  • Shin, Jae-Young;Ryu, Hyun-Seung
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.24 no.1
    • /
    • pp.19-29
    • /
    • 2021
  • In the Port Logistics system, Container Stowage planning is an important issue for cost-effective efficiency improvements. At present, Planners are mainly carrying out Stowage planning by manual or semi-automatically. However, as the trend of super-large container ships continues, it is difficult to calculate an efficient Stowage plan with manpower. With the recent rapid development of artificial intelligence-related technologies, many studies have been conducted to apply enhanced learning to optimization problems. Accordingly, in this paper, we intend to develop and present a Deep Q-Learning Network model for the Master Stowage planning of Container ships.

Task Planning Algorithm with Graph-based State Representation (그래프 기반 상태 표현을 활용한 작업 계획 알고리즘 개발)

  • Seongwan Byeon;Yoonseon Oh
    • The Journal of Korea Robotics Society
    • /
    • v.19 no.2
    • /
    • pp.196-202
    • /
    • 2024
  • The ability to understand given environments and plan a sequence of actions leading to goal state is crucial for personal service robots. With recent advancements in deep learning, numerous studies have proposed methods for state representation in planning. However, previous works lack explicit information about relationships between objects when the state observation is converted to a single visual embedding containing all state information. In this paper, we introduce graph-based state representation that incorporates both object and relationship features. To leverage these advantages in addressing the task planning problem, we propose a Graph Neural Network (GNN)-based subgoal prediction model. This model can extract rich information about object and their interconnected relationships from given state graph. Moreover, a search-based algorithm is integrated with pre-trained subgoal prediction model and state transition module to explore diverse states and find proper sequence of subgoals. The proposed method is trained with synthetic task dataset collected in simulation environment, demonstrating a higher success rate with fewer additional searches compared to baseline methods.

A Technology Planning Approach Based on Network and Growth Curve Analyses : the Case of Augmented Reality Patents (네트워크분석과 기술성장모형을 이용한 기술기획 : 증강현실 기술의 특허를 활용하여)

  • Kim, Jungwook;Jeong, Byeongki;Yoon, Janghyeok
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.42 no.5
    • /
    • pp.337-351
    • /
    • 2016
  • As technologies' life-cycle shortens and their development directions are uncertain, firms' technology planning capability becomes increasingly important. Prior patent-based studies using technology growth curves identify developmental stages of technologies, thereby formulating technology development directions from an overall perspective. However, a technology generally consists of multiple sub-technologies and accordingly their development stages are likely various. In this regard, the prior studies failed to identify core sub-technologies and their specific development directions. Therefore, we suggest an approach consisting of 1) identifying core sub-technologies of a given technology using patent co-classifications and social network analysis, and 2) identifying each sub-technology's development stage and thereby determining its further development direction. We apply our approach to patents related to augmented reality to examine its applicability. It is expected that our approach will help identify evolving development stages for the core sub-technologies of a given technology, thereby effectively assisting technology experts in technology planning processes.

A Study on Improvement of the School Space through Socio-Spatial Network Analysis (사회-공간 네트워크 분석을 활용한 초등학교 공간계획방향에 관한 연구)

  • Jeon, Young-Hoon;Kim, Yoon-Young
    • Journal of the Architectural Institute of Korea Planning & Design
    • /
    • v.35 no.5
    • /
    • pp.21-30
    • /
    • 2019
  • The purpose of this study is to present the direction of the new space plan by reflecting the opinions of the user (student) in the existing standardized elementary school space planning. The purpose of this study is to investigate the activities of elementary school students by using socio - spatial network analysis method and to propose the direction of new elementary school space planning through the results. We analyzed the results of each centrality by using the analysis of closeness analysis, betweeness analysis, girvan-newman clustering, and concor analysis. The results of this study are as follows. First, it should be planned to use the classroom and the special room as one area by utilizing the corridor. Second, it should be planned that the outdoor space and the indoor space are closely related to each other by utilizing the hall, the lobby and the classroom. Third, the school should create a small space where physical activity is possible in an indoor space of the school. In order to improve the standardized elementary school space, this study proposes a method to reflect the opinions of the users in the school planning stage.

Implementation of Wireless Network Planning System for HSPA + and CCC (HSPA+와 CCC를 위한 무선망 설계 시스템의 구현)

  • Bae, Young-Ho;Kim, Byung-Woo;Lee, Seong-Choon
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.9 no.4
    • /
    • pp.158-163
    • /
    • 2010
  • KT will deploy HSPA+/CCC network in this year to handle data explosion. CCC is an evolutionary wireless network architecture which divides a node B into baseband and radio part. By collecting baseband units in a digital unit central station and installing only remote units on desired sites, the operator can reduce the total cost of ownership and $CO_2$ emission. In this paper, we describe some expected problems in deploying HSPA+/CCC network, and how to implement the wireless network planning system to solve them effectively.

  • PDF

A Study on an Algorithm using Multicommodity Network Flow Model for Railroad Evacuation Routing Plan (철도사고 대피경로 탐색을 위한 다수상품 유통문제와 최단경로 해법 연구)

  • Chang, Byung-Man;Kim, Si-Gon
    • Journal of the Korean Society for Railway
    • /
    • v.10 no.5
    • /
    • pp.569-575
    • /
    • 2007
  • This paper presents a study on a Dijkstra algorithm for shortest paths to destinations and a modified algorithm of Multicommodity Network Flow Problem Model with a network transformation for evacuation planning from railroad accident in a directed network.

Minimum-Time Trajectory Planning Ensuring Collision-Free Motion for Two Robots : Neural Optimization Network Approach (신경 최적화 회로망을 이용한 두 대의 로보트를 위한 최소시간 충돌회피 경로 계획)

  • Lee, Ji-Hong;Bien, Zeung-Nam
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.10
    • /
    • pp.44-52
    • /
    • 1990
  • A collision-free trajectory planning for two robots with designated paths is considered. The proposed method is based on the concept of decomposing the planning problem into two steps: one is determining coordination of two robots, and the other is velocity planning with determined coordination. Dynamics and maximum allowable joint velocities are also taken into consideration in the whole planning process. The proposed algorithm is converted into numerical calculation version based on neural optimization network. To show the usefulness of proposed method, an example of trajectory planning for 2 SCARA type robot in common workspace is illustrated.

  • PDF

The Dynamic Effects of Subway Network Expansion on Housing Rental Prices Using a Modified Repeat Sales Model (수도권 지하철 네트워크 확장이 아파트 월세 가격에 미치는 영향 분석 - 수정반복매매모형을 중심으로 -)

  • Kim, Hyojeong;Lee, Changmoo;Lee, Jisu;Kim, Minyoung;Ryu, Taeheyeon;Shin, Hyeyoung;Kim, Jiyeon
    • Journal of Cadastre & Land InformatiX
    • /
    • v.51 no.2
    • /
    • pp.125-139
    • /
    • 2021
  • Continuous subway line expansion over the years in Seoul metropolitan area has contributed to improved accessibility to public transport. Since public transport accessibility has a significant impact on housing decisions, quantitative analysis of correlation between housing prices and public transport accessibility is regarded as one of the most important factors for planning better housing policies. This study defines the reduction of traveling time resulted from the construction of new metro stations despite them not being the closest stations as 'Network Expansion Effect', and seeks to understand how the Network Expansion Effect impacts on housing prices. The study analyzes monthly rent data converted from upfront lump sum deposit, so called Jeonse in Korea, from 2012 to 2018, through 'A Modified Repeat Sales Model.' As a result, the effect of 'Network Expansion' on rental prices in Seoul has stronger during the period of 2017 to 2018 than the base period of 2012 to 2014, which suggests the 'Network Expansion' has a meaningful effect on rent. In addition, in comparison between the most and the least affected group of apartments by 'Network Expansion Effect', the most affected group has more price increase than the least affected group. These findings also indicate that different levels of 'Network Expansion Effect' have various influences on the value of residential real estate properties.