• Title/Summary/Keyword: Agent Based Simulation

Search Result 361, Processing Time 0.021 seconds

Reinforcement Method to Enhance Adaptive Route Search for Efficient Real-Time Application Specific QoS Routing (Real-Time Application의 효과적인 QoS 라우팅을 위한 적응적 Route 선택 강화 방법)

  • Oh, Jae-Seuk;Bae, Sung-Il;Ahn, Jin-Ho;Sungh Kang
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.71-82
    • /
    • 2003
  • In this paper, we present a new method to calculate reinforcement value in QoS routing algorithm targeted for real-time applications based on Ant algorithm to efficiently and effectively reinforce ant-like mobile agents to find the best route toward destination in a network regarding necessary QoS metrics. Simulation results show that the proposed method realizes QoS routing more efficiently and more adaptively than those of the existing method thereby providing better solutions for the best route selection for real-time application that has high priority on delay jitter and bandwidth.

A Study on Realization of Machining Process and Condition in Virtual Space (가상공간의 가공 공정과 상태 구현에 관한 연구)

  • Lee oo-Hun;Kim Bong-Suk;Hong Min-Sung;Kim Jong-Min;Ni Jun;Park Sang-Ho;Song Jun-Yeob;Lee Chang-Woo;Ha Tae-Ho
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2005.05a
    • /
    • pp.462-467
    • /
    • 2005
  • This paper presents virtual machining system in order to realize turning process in virtual space. A reliable virtual turning process simulation was developed based on the surface shaping system which is capable of considering geometric model, thermal error model, and vibration model. Accuracy of surface shape resulting from proposed machining simulator was verified experimentally. This paper also developed the watchdog agent that continuously assessed, diagnosed, and predicted performance of products and machines in machining. The Watchdog agent extracted feature signal using time-frequency analysis among various signals from multi-sensor and evaluated machining condition using performance confidence value.

  • PDF

Co-evolutionary Design of Team Level Play in Soccer Server

  • Masatoshi Hiramoto;Hidenori Kawamura;Masahito Yamamoto;Keiji Suzuki;Azuma Ohuchi
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.727-730
    • /
    • 2000
  • Recently, RoboCup soccer simulation has been regarded as a good benchmark problem for multiagent researches. Soccer agents have to make decision based on visual and auditory information, which are sent from the soccer server. In order to develop a strong team, we have to design decision-making process of each player agent. However, it is very difficult for us to design the decision-making processes in detail, because we don't know what actions of each player are effective for the team. In this paper, we attempt to apply co-evolutionary method, which is one type of analogies of evolution, to improve the team play. Agents have hand coded basic skills, which include dribble, shoot, pass etc. Agents already can play autonomously and independently. Individual agent skills are characterized by some parameters. By coevolving teams with these parameters, we obtained relatively interesting teams, in which players behave cooperatively in order to win the soccer game. From some experiments, we discuss what teams are evolved.

  • PDF

A visiting scheme of mobile sink system in distributed sensor networks

  • Park, Sang-Joon;Lee, Jong-Chan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.11
    • /
    • pp.93-99
    • /
    • 2021
  • The sensor networks should be appropriately designed by applied network purpose, so that they can support proper application functions. Based on the design of suitable network model, the network lifetime can be maximized than using other general strategies which have not the consideration of specific network environments. In this paper, we propose a non-deterministic agent scheme to the mobile sink in distributed wireless sensor networks. The sensor network area can be divided into several sensor regions. Hence, to these such networks, the specified suitable scheme is requested by the applied network model to implement satisfactory network management. In this paper, we theoretically represent the proposed scheme, and provide the evaluation with the simulation results.

A Swarm System Design Based on Coupled Nonlinear Oscillators for Cooperative Behavior

  • Kim, Dong-Hun
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.3
    • /
    • pp.301-307
    • /
    • 2003
  • A control system design based on coupled nonlinear oscillators (CNOs) for a self- organized swarm system is presented. In this scheme, agents self-organize to flock and arrange group formations through attractive and repulsive forces among themselves using CNOs. Virtual agents are also used to create richer group formation patterns. The objective of the swarm control in this paper is to follow a moving target with a final group formation in the shortest possible time despite some obstacles. The simulation results have shown that the proposed scheme can effectively construct a self-organized multi-agent swarm system capable of group formation and group immigration despite the emergence of obstacles.

Comparison of Intelligent Charging Algorithms for Electric Vehicles to Reduce Peak Load and Demand Variability in a Distribution Grid

  • Mets, Kevin;D'hulst, Reinhilde;Develder, Chris
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.672-681
    • /
    • 2012
  • A potential breakthrough of the electrification of the vehicle fleet will incur a steep rise in the load on the electrical power grid. To avoid huge grid investments, coordinated charging of those vehicles is a must. In this paper, we assess algorithms to schedule charging of plug-in (hybrid) electric vehicles as to minimize the additional peak load they might cause. We first introduce two approaches, one based on a classical optimization approach using quadratic programming, and a second one, market based coordination, which is a multi-agent system that uses bidding on a virtual market to reach an equilibrium price that matches demand and supply. We benchmark these two methods against each other, as well as to a baseline scenario of uncontrolled charging. Our simulation results covering a residential area with 63 households show that controlled charging reduces peak load, load variability, and deviations from the nominal grid voltage.

Task Allocation of Intelligent Warehouse Picking System based on Multi-robot Coalition

  • Xue, Fei;Tang, Hengliang;Su, Qinghua;Li, Tao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3566-3582
    • /
    • 2019
  • In intelligent warehouse picking system, the allocation of tasks has an important influence on the efficiency of the whole system because of the large number of robots and orders. The paper proposes a method to solve the task allocation problem that multi-robot task allocation problem is transformed into transportation problem to find a collision-free task allocation scheme and then improve the capability of task processing. The task time window and the power consumption of multi-robot (driving distance) are regarded as the utility function and the maximized utility function is the objective function. Then an integer programming formulation is constructed considering the number of task assignment on an agent according to their battery consumption restriction. The problem of task allocation is solved by table working method. Finally, simulation modeling of the methods based on table working method is carried out. Results show that the method has good performance and can improve the efficiency of the task execution.

Kinetic study for the optimization of ginsenoside Rg3 production by heat treatment of ginsenoside Rb1

  • Vo, Hoang Tung;Cho, Jae Youl;Choi, Yong-Eui;Choi, Yong-Soon;Jeong, Yeon-Ho
    • Journal of Ginseng Research
    • /
    • v.39 no.4
    • /
    • pp.304-313
    • /
    • 2015
  • Background: Ginsenoside Rg3 is a promising anticancer agent. It is usually produced by heat treatment of ginseng, in which ginsenoside Rb1 is the major ginsenoside. A kinetic study was conducted to optimize ginsenoside Rg3 production by the heat treatment of ginsenoside Rb1. Methods: Ginsenoside Rb1 was heated using an isothermal machine at $80^{\circ}C$ and $100^{\circ}C$ and analyzed using HPLC. The kinetic parameters were calculated from the experimental results. The activation energy was estimated and used to simulate the process. The optimized parameters of ginsenoside Rg3 production are suggested based on the simulation. Results: The rate constants were $0.013h^{-1}$ and $0.073h^{-1}$ for the degradation of ginsenosides Rb1 and Rg3 at $80^{\circ}C$, respectively. The corresponding rate constants at $100^{\circ}C$ were $0.045h^{-1}$ and $0.155h^{-1}$. The estimated activation energies of degradation of ginsenosides Rb1 and Rg3 were 69.2 kJ/mol and 40.9 kJ/mol, respectively. The rate constants at different temperatures were evaluated using the estimated activation energies, and the kinetic profiles of ginsenosides Rb1 and Rg3 at each temperature were simulated based on the proposed kinetic model of consecutive reaction. The optimum strategies for producing ginsenoside Rg3 from ginsenoside Rb1 are suggested based on the simulation. With increased temperature, a high concentration of ginsenoside Rg3 is formed rapidly. However, the concentration decreases quickly after the reaching the maximal concentration value. Conclusion: The optimum temperature for producing ginsenoside Rg3 should be the highest temperature technically feasible below $180^{\circ}C$, in consideration of the cooling time. The optimum reaction time for heat treatment is 30 min.

Rank-based Formation for Multiple Robots in a Local Coordinate System (지역 좌표에서 랭크기반의 다개체 로봇 포메이션 제어)

  • Jung, Hahmin;Kim, Dong Hun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.1
    • /
    • pp.42-47
    • /
    • 2015
  • This paper presents a rank-based formation for multiple agents based on potential functions, where the proposed method uses the relative position of two neighboring agents. The conventional formation scheme of multiple systems requires communication between agents and a central computer to get the positions of all multiple agents. In the study, differently from previous studies, the formation scheme uses the relative position of two neighboring agents in a local coordinate system. In addition, it introduces a singular agent association that considers only the relative position between an agent and its neighboring agents, instead of multiple associations among all information about all agents. Furthermore, the proposed framework explores the benefits of different formation types. Extensive simulation results show that the proposed approach verifies the viability and effectiveness of the proposed formation.

A mixed-initiative conversational agent for ubiquitous home environments (유비쿼터스 가정환경을 위한 상호주도형 대화 에이전트)

  • Song In-Jee;Hong Jin-Hyuk;Cho Sung-Bae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.7
    • /
    • pp.834-839
    • /
    • 2005
  • When a great variety of services become available to user through the broadband convergence network in the ubiquitous home environment, an intelligent agent is required to deal with the complexity of services and perceive intension of a user. Different from the old-fashioned command-based user interface for selecting services, conversation enables flexible and rich interactions between human and agents, but diverse expressions of the user's background and context make conversation hard to implement by using either user-initiative or system-initiative methods. To deal with the ambiguity of diverse expressions between user and agents, we have to apply hierarchial bayesian networks for the mixed initiative conversation. Missing information from user's query is analyzed by hierarchial bayesian networks to inference the user's intension so that can be collected through the agent's query. We have implemented this approach in ubiquitous home environment by implementing simulation program.