• Title/Summary/Keyword: optimal planning

Search Result 1,267, Processing Time 0.024 seconds

A Study on path planning of Mobile Robot by using Genetic Algorithm (유전알고리즘을 이용한 이동로봇의 경로계획에 관한 연구)

  • Kim, Jin-Su;Lee, Young-Jin;Bae, Geun-Shin;Lee, Kwon-Soon
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.1216-1218
    • /
    • 1996
  • Genetic algorithm(GA) is useful to find optimal solution without any special mathematical modeling. This study presents to search optimal path of Autonomous Mobile Robot(AMR) by using GA without encoding and decoding procedure. Therefore, this paper shows that the proposed algorithm using GA can reduce the computation time to search the optimal path.

  • PDF

Economic Power Dispatch with Discontinuous Fuel Cost Functions using Improved Parallel PSO

  • Mahdad, Belkacem;Bouktir, T.;Srairi, K.;Benbouzid, M.EL.
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.1
    • /
    • pp.45-53
    • /
    • 2010
  • This paper presents an improved parallel particle swarm optimization approach (IPPSO) based decomposed network for economic power dispatch with discontinuous fuel cost functions. The range of partial power demand corresponding to the partial output powers near the global optimal solution is determined by a flexible decomposed network strategy and then the final optimal solution is obtained by parallel Particle Swarm Optimization. The proposed approach tested on 6 generating units with smooth cost function, and to 26-bus (6 generating units) with consideration of prohibited zone effect, the simulation results compared with recent global optimization methods (Bee-OPF, GA, MTS, SA, PSO). From the different case studies, it is observed that the proposed approach provides qualitative solution with less computational time compared to various methods available in the literature survey.

Optimal Placement of CRNs in Manned/Unmanned Aerial Vehicle Cooperative Engagement System

  • Zhong, Yun;Yao, Peiyang;Wan, Lujun;Xiong, Yeming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.52-68
    • /
    • 2019
  • Aiming at the optimal placement of communication relay nodes (OPCRN) problem in manned/unmanned aerial vehicle cooperative engagement system, this paper designed a kind of fully connected broadband backbone communication topology. Firstly, problem description of OPCRN was given. Secondly, based on problem analysis, the element attributes and decision variables were defined, and a bi-level programming model including physical layer and logical layer was established. Thirdly, a hierarchical artificial bee colony (HABC) algorithm was adopted to solve the model. Finally, multiple sets of simulation experiments were carried out to prove the effectiveness and superiority of the algorithm.

Development of Optimal-Path Finding System(X-PATH) Using Search Space Reduction Technique Based on Expert System (전문가시스템을 이용한 최적경로 탐색시스템(X-PATH)의 개발)

  • 남궁성;노정현
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.1
    • /
    • pp.51-67
    • /
    • 1996
  • The optimal path-finding problem becomes complicated when multiple variables are simultaneously considered such as physical route length, degree of congestion, traffic capacity of intersections, number of intersections and lanes, and existence of free ways. Therefore, many researchers in various fields (management science, computer science, applied mathematics, production planning, satellite launching) attempted to solve the problem by ignoring many variables for problem simplification, by developing intelligent algorithms, or by developing high-speed hardware. In this research, an integration of expert system technique and case-based reasoning in high level with a conventional algorithms in lower level was attempted to develop an optimal path-finding system. Early application of experienced driver's knowledge and case data accumulated in case base drastically reduces number of possible combinations of optimal paths by generating promising alternatives and by eliminating non-profitable alternatives. Then, employment of a conventional optimization algorithm provides faster search mechanisms than other methods such as bidirectional algorithm and $A^*$ algorithm. The conclusion obtained from repeated laboratory experiments with real traffic data in Seoul metropolitan area shows that the integrated approach to finding optimal paths with consideration of various real world constraints provides reasonable solution in a faster way than others.

  • PDF

A Study on the Optimal Operation of Fuel Cell in Power Systems (전력계통에 있어서 신에너지전원(연료전지)의 최적 운용방안에 관한 연구)

  • 노대석;홍승만;이은미
    • Proceedings of the KAIS Fall Conference
    • /
    • 2002.11a
    • /
    • pp.141-144
    • /
    • 2002
  • Recently, the operation of power distribution systems has become more difficult because the peak demand load is increasing continuously and the daily load factor is getting worse and worse. Also, the consideration of deregulation and global environment in electric power industry is required. In order to overcome these problems, a study on the planning and operation in distribution systems of dispersed generating sources such as fuel cell systems, photovoltaic systems and wind power systems has been performed energetically. This study presents a method for determining an optimal operation strategy of dispersed co-generating sources, especially fuel cell systems, in the case of both only electric power supply and thermal supply as well as electric power supply. In other words, the optimal operation of these sources can be determined easily by the principle of equal incremental fuel cost and the thermal merits is evaluated quantitatively through Kuhn-Tucker's optimal conditions. In order to select the optimal locations of those sources, an priority method using the comparison of total cost at the peak load time interval is also presented. The validity of the proposed algorithms is demonstrated using a model system.

Bicycle Optimal Path Finding Considering Moving Loads (운행부하를 고려한 자전거 최적 경로탐색 기법)

  • Yang, Jung Lan;Kim, Hye Young;Jun, Chul Min
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.20 no.4
    • /
    • pp.89-95
    • /
    • 2012
  • Recent planning for bicycle use is relatively low compared to other studies. Although studies for the bicycle roads accessibility are actively underway, those considering topographical elements and characteristics of the user behaviors are very limited. Choosing paths of cyclists is typically influenced by slopes and intersections as well as optimal distance. This study presents a method to find optimal paths considering topographical elements in case of choosing paths for school commuting using bicycles. Conversion formulae suggested here are tested on a Songpa area using round-trip directions and compared with traditional optimal path computation.

Breast Radiotherapy with Mixed Energy Photons; a Model for Optimal Beam Weighting

  • Birgani, Mohammadjavad Tahmasebi;Fatahiasl, Jafar;Hosseini, Seyed Mohammad;Bagheri, Ali;Behrooz, Mohammad Ali;Zabiehzadeh, Mansour;meskani, Reza;Gomari, Maryam Talaei
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.17
    • /
    • pp.7785-7788
    • /
    • 2015
  • Utilization of high energy photons (>10MV) with an optimal weight using a mixed energy technique is a practical way to generate a homogenous dose distribution while maintaining adequate target coverage in intact breast radiotherapy. This study represents a model for estimation of this optimal weight for day to day clinical usage. For this purpose, treatment planning computed tomography scans of thirty-three consecutive early stage breast cancer patients following breast conservation surgery were analyzed. After delineation of the breast clinical target volume (CTV) and placing opposed wedge paired isocenteric tangential portals, dosimeteric calculations were conducted and dose volume histograms (DVHs) were generated, first with pure 6MV photons and then these calculations were repeated ten times with incorporating 18MV photons (ten percent increase in weight per step) in each individual patient. For each calculation two indexes including maximum dose in the breast CTV ($D_{max}$) and the volume of CTV which covered with 95% Isodose line ($V_{CTV,95%IDL}$) were measured according to the DVH data and then normalized values were plotted in a graph. The optimal weight of 18MV photons was defined as the intersection point of $D_{max}$ and $V_{CTV,95%IDL}$ graphs. For creating a model to predict this optimal weight multiple linear regression analysis was used based on some of the breast and tangential field parameters. The best fitting model for prediction of 18MV photons optimal weight in breast radiotherapy using mixed energy technique, incorporated chest wall separation plus central lung distance (Adjusted R2=0.776). In conclusion, this study represents a model for the estimation of optimal beam weighting in breast radiotherapy using mixed photon energy technique for routine day to day clinical usage.

Location Selection and Evaluation of Education and Research Facilities in Large City (대도시 교육연구시설의 입지선정 및 평가에 관한 연구)

  • Park, Cheon-Bo;Choi, Joon-Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.11
    • /
    • pp.676-682
    • /
    • 2017
  • The purpose of this study is to suggest the elements that need to be taken into consideration in urban planning to determine the optimal location of education and research facilities based on the knowledge-based industry in a large Korean city. In this study, we conducted an analysis and evaluation of the locational conditions and elements of education and research facilities as the important functions for regional economic revitalization and urban balance development. For this purpose, the relevant concepts and patterns of education and research facilities were reviewed as a theoretical research endeavor, and their locational conditions and elements were surveyed based on the existing research. The planning directions and some lessons for determining the location of the facilities are suggested through the analysis of the evaluation method according to the selection of the location. The results of this study are expected to act as guidelines for the optimal location selection of education and research facilities in large Korean cities in the era of the fourth industrial revolution.

Capacity Expansion Modeling of Water-distribution Network using GIS, VE, and LCC (GIS와 VE, LCC 개념에 의한 동적 상수도관망 대안 결정)

  • Kim, Hyeng-Bok
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 1999.12a
    • /
    • pp.21-25
    • /
    • 1999
  • Planning support systems(PSS) add more advanced spatial analysis functions than Geographic information systems(GIS) and intertemporal functions to the functions of spatial decision support systems(SDSS). This paper reports the continuing development of a PSS providing a framework that facilitates urban planners and civil engineers in conducting coherent deliberations about planning, design and operation & maintenance(O&M) of water-distribution networks for urban growth management. The PSS using dynamic optimization model, modeling-to-generate-alternatives, value engineering(VE) and life-cycle cost(LCC) can generate network alternatives in consideration of initial cost and O&H cost. Users can define alternatives by the direct manipulation of networks or by the manipulation of parameters in the models. The water-distribution network analysis model evaluates the performance of the user-defined alternatives. The PSS can be extended to include the functions of generating sewer network alternatives, combining water-distribution and sewer networks, eventually the function of planning, design and O&H of housing sites. Capacity expansion by the dynamic water-distribution network optimization model using MINLP includes three advantages over capacity expansion using optimal control theory(Kim and Hopkins 1996): 1) finds expansion alternatives including future capacity expansion times, sizes, locations, and pipe types of a water-distribution network provided, 2) has the capabilities to do the capacity expansion of each link spatially and intertemporally, and 3) requires less interaction between models. The modeling using MINLP is limited in addressing the relationship between cost, price, and demand, which the optimal control approach can consider. Strictly speaking, the construction and O&M costs of water-distribution networks influence the price charged for the served water, which in turn influence the. This limitation can be justified in rather small area because price per unit water in the area must be same as that of neighboring area, i.e., the price is determined administratively. Planners and engineers can put emphasis on capacity expansion without consideration of the relationship between cost, price, and demand.

  • PDF

Real-time path replanning in dynamic environments (동적 환경에서의 실시간 경로 설정 방법)

  • Kwak, Jae-Hyuk;Lim, Joon-Hong
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.43 no.6 s.312
    • /
    • pp.1-8
    • /
    • 2006
  • Many researches on path planning and obstacle avoidance for the fundamentals of mobile robot have been done recently. Informations from various sensors can be used to find obstacles and plan feasible path. In spite of many solutions of finding optimal path, each can be applied in only a constrained condition. This means that it is difficult to find university good algorithm. An optimal path with a complicated computation generates a time delay which cannot avoid moving obstacles. In this paper, we propose an algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers and cumulative numbers. It has an advantage of fast planning time and completeness of path if one exists. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in dynamic environments. Using the information of the start and destination position, the RAS can be performed for collision-free navigation by reforming feasible paths repeatedly in dynamic environments.