• Title/Summary/Keyword: Evolutionary path planning

Search Result 9, Processing Time 0.021 seconds

Modeling and Simulation of Evolutionary Dynamic Path Planning for Unmanned Aerial Vehicles Using Repast (Repast기반 진화 알고리즘을 통한 무인 비행체의 동적 경로계획 모델링 및 시뮬레이션)

  • Kim, Yong-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.2
    • /
    • pp.101-114
    • /
    • 2018
  • Several different approaches and mechanisms are introduced to solve the UAV path planning problem. In this paper, we designed and implemented an agent-based simulation software using the Repast platform and Java Genetic Algorithm Package to examine an evolutionary path planning method by implementing and testing within the Repast environment. The paper demonstrates the life-cycle of an agent-based simulation software engineering project while providing a documentation strategy that allows specifying autonomous, adaptive, and interactive software entities in a Multi-Agent System. The study demonstrates how evolutionary path planning can be introduced to improve cognitive agent capabilities within an agent-based simulation environment.

Co-Evolution of Fuzzy Rules and Membership Functions

  • Jun, Hyo-Byung;Joung, Chi-Sun;Sim, Kwee-Bo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.601-606
    • /
    • 1998
  • In this paper, we propose a new design method of an optimal fuzzy logic controller using co-evolutionary concept. In general, it is very difficult to find optimal fuzzy rules by experience when the input and/or output variables are going to increase. Futhermore proper fuzzy partitioning is not deterministic ad there is no unique solution. So we propose a co-evolutionary method finding optimal fuzzy rules and proper fuzzy membership functions at the same time. Predator-Prey co-evolution and symbiotic co-evolution algorithms, typical approaching methods to co-evolution, are reviewed, and dynamic fitness landscape associated with co-evolution is explained. Our algorithm is that after constructing two population groups made up of rule base and membership function, by co-evolving these two populations, we find optimal fuzzy logic controller. By applying the propose method to a path planning problem of autonomous mobile robots when moving objects applying the proposed method to a pa h planning problem of autonomous mobile robots when moving objects exist, we show the validity of the proposed method.

  • PDF

Humanoid Robot Footstep Planner with Fuzzy-Based Multi-Criteria Decision Making (퍼지 기반 다기준 의사 결정을 이용한 휴머노이드 로봇 걸음새 계획기)

  • Lee, Ki-Baek
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.24 no.4
    • /
    • pp.441-447
    • /
    • 2015
  • This paper proposes a novel fuzzy-based multi-criteria decision making method and implements a footstep planner for humanoid robots with it. Humanoid robots require additional footstep planning process in addition to path planning for the autonomous navigation. Moreover, it is necessary to consider safety and energy consumption as well as path efficiency and multi-criteria decision making is indispensable. The proposed method can provide not only well- distributed and non-dominated, but also more preferable solutions for users. The planned footsteps by the proposed method were verified through simulation. The results indicate that the user's preference is properly reflected in optimized solutions maintaining solution quality.

A Workable Framework or a Fuzzy Concept? The Regional Resilience Approach to the Evolution and Adaptability of Regional Economies

  • Cho, Cheol-Joo
    • World Technopolis Review
    • /
    • v.3 no.2
    • /
    • pp.66-77
    • /
    • 2014
  • This paper aims at exploring a conceptual framework of analyzing the evolutionary processes of regional economies by reconciling the notion of regional resilience and the concepts prevailing in the disciplines of evolutionary economics and geography. The resilience framework appears to offer a promising outlet with which combination of the seemingly contradictory conceptions is made possible. It can address why some regions manage to adapt to external shocks, renew themselves, or lock out themselves, while others are more locked in decline. In addition, it can also explain how the spatial organization of economic production, distribution, and consumption is transformed over time. Then, regional economic resilience, together with its accompanying vehicle of panarchy, emerges as a workable framework of explaining regional differentiation in regional economic performance and trajectories. Despite the risk of being a fuzzy concept, the resilience conception can be properly operationalized to provide policy principles of regional economic innovation adjusted to region-specific contexts.

Co-evolutionary Genetic Algorithm for Designing and Optimaizing Fuzzy Controller

  • Byung, Jun-Hyo;Bo, Sim-Kwee
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.10a
    • /
    • pp.354-360
    • /
    • 1998
  • In general, it is very difficult to find optimal fuzzy rules by experience when a system is dynamical and/or complex. Futhermore proper fuzzy partitioning is not deterministic and there is no unique solution. Therefore we propose a new design method of an optimal fuzzy logic controller, that is a co-evolutionary genetic algorithm finding optimal fuzzy rule and proper membership functions at the same time. We formalize the relation between fuzzy rules and membership functions in terms of fitness. We review the typical approaching methods to co-evolutionary genetic algorithms , and then classify them by fitness relation matrix. Applications of the proposed method to a path planning problem of autonomous mobile robots when moving objects exist are presented to demonstrate the performance and effectiveness of the method.

  • PDF

Behavior Control of Autonomous Mobile Robot using Schema Co-evolution (스키마 공진화 기법을 이용한 자율이동로봇의 행동제어)

  • Sun, Joung-Chi;Byung, Jun-Hyo;Bo, Sim-Kwee
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.03a
    • /
    • pp.123-126
    • /
    • 1998
  • The theoretical foundations of GA are the Schema Theorem and the Building Block Hypothesis. In the Meaning of these foundational concepts, simple genetic algorithm(SGA) allocate more trials to the schemata whose average fitness remains above average. Although SGA does well in many applications as an optimization method, still it does not guarantee the convergence of a global optimum. Therefore as an alternative scheme, there is a growing interest in a co-evolutionary system, where two populations constantly interact and co-evolve in contrast with traditional single population evolutionary algorithms. In this paper, we propose a new design method of an optimal fuzzy logic controller using co-evolutionary concept. In general, it is very difficult to find optimal fuzzy rules by experience when the input and/or output variables are going to increase. So we propose a co-evolutionary method finding optimal fuzzy rules. Our algorithm is that after constructing two population groups m de up of rule vase and its schema, by co-evolving these two populations, we find optimal fuzzy logic controller. By applying the proposed method to a path planning problem of autonomous mobile robots when moving objects exist, we show the validity of the proposed method.

  • PDF

Active Learning of Mobile Robot Path Planning Using Evolutionary Algorithms (진화 알고리즘을 이용한 이동로봇 경로 계획의 능동적 학습)

  • 김성훈;장병탁
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.11a
    • /
    • pp.263-266
    • /
    • 1997
  • 로봇 축구 경기를 위해서는 경기장의 임의의 시작점에서 목표점으로 장애물을 피해 갈 수 있는 능력이 필요하다. 이러한 경로 계획을 학습하기 위해서 다양한 상황을 모두 고려할 경우 학습량이 급격히 증가한다. 그러나 많은 실제적인 학습 문제에 있어서는 가능한 모든 학습 데이터를 사용하지 않고도 원하는 학습 효과를 가져올 수 있음이 알려져 있으며, 이러한 경우 데이터를 스스로 선별하여 학습하는 능동적 학습 방법이 효과적이다. 본 논문에서는 진화 알고리즘을 사용하여 실시간에 경로 계획을 하기 위한 새로운 능동적 학습 방법을 제시한다. 제안되는 방법은 두 개의 진화 알고리즘으로 구성되는데 하나는 주어진 시작점-목표점간의 최적 경로를 찾는데 사용되고 또 다른 하나의 진화 알고리즘은 유용한 시작점-목표점들의 쌍을 탐색하는데 사용된다. 이 방법은 계산 시간의 여유가 있을 때 다양한 문제를 스스로 제시하고 해결하는 법을 학습해 놓고 후에 실제 문제가 주어질 때 기존의 문제와 가장 유사한 문제를 찾아 실시간에 해결함으로써 기존의 진화 알고리즘에 의한 경로 계획법들이 갖는 실시간성에서의 단점을 개선할 수 있다. 실험을 통하\ulcorner 제안된 두 가지 진화 알고리즘의 성능을 실험적으로 검토한다.

  • PDF

Current Issues and Rural Policies of Less-favored Areas in Japan

  • Nakashima, Yasuhiro
    • Journal of Korean Society of Rural Planning
    • /
    • v.15 no.3
    • /
    • pp.107-112
    • /
    • 2009
  • In Japan, the direct payment scheme for mountainous areas was introduced in order to enhance multifunctionality of less-favored areas in 2000. A comprehensive ex post assessment showed that the scheme effectively contributed to prevention of abandoned cultivated lands, maintenance and enhancement of multifunctionality of agriculture, continuous assistance for agricultural production, and revitalization of community. In 2005 a second round of the scheme started and urged encouraging core farmers, improving productivity, and reinforcing inter-village coalition as to promote autonomous and sustainable rural economies. A new different scheme such as 'measures to conserve and improve land, water and environment' was launched for strengthening conservation and management of rural resources over all areas in 2007. It covers one third of paddy fields with regards to maintenance of water facilities and practice of group eco-farming beyond less-favored area. A lot of public programs have been developed for rural revitalization recently. Additionally some have a complementary role to enlarging cultural multifunctionality in rural societies. We could interpret the institutional progress as an evolutionary path of rural development and environmental schemes for the past decade. Much experience of community works through the direct payment scheme for mountainous areas may have resulted in accumulation of social competence for elaboration of rural management..

Development of Intelligent ATP System Using Genetic Algorithm (유전 알고리듬을 적용한 지능형 ATP 시스템 개발)

  • Kim, Tai-Young
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.131-145
    • /
    • 2010
  • The framework for making a coordinated decision for large-scale facilities has become an important issue in supply chain(SC) management research. The competitive business environment requires companies to continuously search for the ways to achieve high efficiency and lower operational costs. In the areas of production/distribution planning, many researchers and practitioners have developedand evaluated the deterministic models to coordinate important and interrelated logistic decisions such as capacity management, inventory allocation, and vehicle routing. They initially have investigated the various process of SC separately and later become more interested in such problems encompassing the whole SC system. The accurate quotation of ATP(Available-To-Promise) plays a very important role in enhancing customer satisfaction and fill rate maximization. The complexity for intelligent manufacturing system, which includes all the linkages among procurement, production, and distribution, makes the accurate quotation of ATP be a quite difficult job. In addition to, many researchers assumed ATP model with integer time. However, in industry practices, integer times are very rare and the model developed using integer times is therefore approximating the real system. Various alternative models for an ATP system with time lags have been developed and evaluated. In most cases, these models have assumed that the time lags are integer multiples of a unit time grid. However, integer time lags are very rare in practices, and therefore models developed using integer time lags only approximate real systems. The differences occurring by this approximation frequently result in significant accuracy degradations. To introduce the ATP model with time lags, we first introduce the dynamic production function. Hackman and Leachman's dynamic production function in initiated research directly related to the topic of this paper. They propose a modeling framework for a system with non-integer time lags and show how to apply the framework to a variety of systems including continues time series, manufacturing resource planning and critical path method. Their formulation requires no additional variables or constraints and is capable of representing real world systems more accurately. Previously, to cope with non-integer time lags, they usually model a concerned system either by rounding lags to the nearest integers or by subdividing the time grid to make the lags become integer multiples of the grid. But each approach has a critical weakness: the first approach underestimates, potentially leading to infeasibilities or overestimates lead times, potentially resulting in excessive work-inprocesses. The second approach drastically inflates the problem size. We consider an optimized ATP system with non-integer time lag in supply chain management. We focus on a worldwide headquarter, distribution centers, and manufacturing facilities are globally networked. We develop a mixed integer programming(MIP) model for ATP process, which has the definition of required data flow. The illustrative ATP module shows the proposed system is largely affected inSCM. The system we are concerned is composed of a multiple production facility with multiple products, multiple distribution centers and multiple customers. For the system, we consider an ATP scheduling and capacity allocationproblem. In this study, we proposed the model for the ATP system in SCM using the dynamic production function considering the non-integer time lags. The model is developed under the framework suitable for the non-integer lags and, therefore, is more accurate than the models we usually encounter. We developed intelligent ATP System for this model using genetic algorithm. We focus on a capacitated production planning and capacity allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using an evolutionary system to solve it efficiently. This method makes it possible for the population to reach the approximate solution easily. Moreover, we designed and utilized a representation scheme that allows the proposed models to represent real variables. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solutions converge to the optimum quickly.