• Title/Summary/Keyword: multiagent

Search Result 92, Processing Time 0.023 seconds

A Performance Improvement Technique for Nash Q-learning using Macro-Actions (매크로 행동을 이용한 내시 Q-학습의 성능 향상 기법)

  • Sung, Yun-Sik;Cho, Kyun-Geun;Um, Ky-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.3
    • /
    • pp.353-363
    • /
    • 2008
  • A multi-agent system has a longer learning period and larger state-spaces than a sin91e agent system. In this paper, we suggest a new method to reduce the learning time of Nash Q-learning in a multi-agent environment. We apply Macro-actions to Nash Q-learning to improve the teaming speed. In the Nash Q-teaming scheme, when agents select actions, rewards are accumulated like Macro-actions. In the experiments, we compare Nash Q-learning using Macro-actions with general Nash Q-learning. First, we observed how many times the agents achieve their goals. The results of this experiment show that agents using Nash Q-learning and 4 Macro-actions have 9.46% better performance than Nash Q-learning using only 4 primitive actions. Second, when agents use Macro-actions, Q-values are accumulated 2.6 times more. Finally, agents using Macro-actions select less actions about 44%. As a result, agents select fewer actions and Macro-actions improve the Q-value's update. It the agents' learning speeds improve.

  • PDF

A Secure Multiagent Engine Based on Public Key Infrastructure (공개키 기반 구조 기반의 보안 다중 에이전트 엔진)

  • 장혜진
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.3 no.4
    • /
    • pp.313-318
    • /
    • 2002
  • The Integration of agent technology and security technology is needed to many application areas like electronic commerce. This paper suggests a model of extended multi-agent engine which supports privacy, integrity, authentication and non-repudiation on agent communication. Each agent which is developed with the agent engine is composed of agent engine layer and agent application layer. We describe and use the concepts self-to-self messages, secure communication channel, and distinction of KQML messages in agent application layer and messages in agent engine layer. The suggested agent engine provides an agent communication language which is extended to enable secure communication between agents without any modifications or restrictions to content layer and message layer of KQML. Also, in the model of our multi-agent engine, secure communication is expressed and processed transparently on the agent communication language.

  • PDF

Multi Agent System (MAS) Framework for Home Network Application (홈 네트워크 응용을 위한 Multi Agent System (MAS) 프레임워크)

  • Jang, In-Hun;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.1
    • /
    • pp.80-85
    • /
    • 2007
  • As home network system begins serving in earnest, the recent fruits of research in home service robot show that the new epoch that human and intelligent robots are living, communicating and interacting together at home, may come true in the near future. In the other hand, it is generally known that the multiagent system, performing distributed process together with other different devices in a home network system, is better than single robot or single home server for adapting themselves to home environment and completing their mission because the characteristic of home environment is 'open'. Therefore, in this paper we suggest the framework model to define agents, which is needed lot the home with a home network system, and the communication protocol architecture between agents. For this, we focus our attention on an agent comprising the set of many agent instances rather than the single intelligent or ability of a robot or home server, and also suggest the way of adaptation for agent systems to their environments and interaction with human in the manner of cooperation and negotiation among agents or agent instances in each agent.

A Cooperation Strategy of Multi-agents in Real-Time Dynamic Environments (실시간 동적인 환경에서 다중 에이전트의 협동 기법)

  • Yoo, Han-Ha;Cho, Kyung-Eun;Um, Ky-Hyun
    • Journal of Korea Game Society
    • /
    • v.6 no.3
    • /
    • pp.13-22
    • /
    • 2006
  • Games such as sports, RTS, RPG, which teams of players play, require advanced artificial intelligence technology for team management. The existing artificial intelligence enables an intelligent agent to have the autonomy solving problem by itself, but to lack interaction and cooperation between agents. This paper presents "Level Unified Approach Method" with effective role allocation and autonomy in multiagent system. This method allots sub-goals to agents using role information to accomplish a global goal. Each agent makes a decision and takes actions by itself in dynamic environments. Global goal of Team coordinates to allocated role in tactics approach. Each agent leads interactive cooperation by sharing state information with another using Databoard, As each agent has planning capacity, an agent takes appropriate actions for playing allocated roles in dynamic environments. This cooperation and interactive operation between agents causes a collision problem, so it approaches at tactics side for controlling this problem. Our experimental result shows that "Level Unified Approach Method" has better performance than existing rental approach method or de-centralized approach method.

  • PDF

Acute lymphoblastic leukemia in children: past, present and future (소아 급성 림프모구 백혈병: 과거, 현재, 미래)

  • Kang, Hyoung Jin;Shin, Hee Young;Ahn, Hyo Seop
    • Clinical and Experimental Pediatrics
    • /
    • v.50 no.7
    • /
    • pp.601-605
    • /
    • 2007
  • The cure rate of acute lymphoblastic leukemia (ALL) in children dramatically improved over past 5 decades from zero to about 80%. The main cause of improvement is owing to the development of chemotherapy by multicenter clinical trial of large study groups with the understanding of leukemia biology. Recently, pediatric ALL protocols were applied to the treatment of adolescent and even adult ALL patients. For nearly 30 years, clinical factors have been used to risk-stratify therapy for children with ALL, so that the most intensive therapies are reserved for those patients at the highest risk of relapse. The risk groups of ALL are divided as standard- (low- plus intermediate-), high- and very high-risk group according to the prognostic factors, and treatment results improved by this risk based treatment. The factors used to risk-stratify therapy include age, gender, presenting leukocyte count, immunophenotype, cytogenetic aberrations including ploidy and translocations, and initial response after 1 to 2 weeks of therapy. But treatment efficacy is the most important determinant and can abolish the clinical significance of most, if at all, prognostic factors. Today, in the era of intensive, multiagent regimens, there is increasing evidence that we have reached the limits of prognostic significance of currently applied clinical risk factors in childhood ALL. As the cure rate of ALL is about 80%, introducing new prognostic factors such as new molecular prognostic markers, new methods of assessment about minimal residual disease, and pharmacogenetic study, with the development of stem cell transplantation and molecular targeted therapy are needed to cure residual 20% of childhood ALL patients without short and long term complications.

A Distributed Path-Finding Algorithm for Distributed Metabolic Pathways (분산된 대사경로네트워크에 대한 경로검색을 위한 분산알고리즘)

  • Lee, Sun-A;Lee, Keon-Myung;Lee, Seung-Joo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.4
    • /
    • pp.425-430
    • /
    • 2005
  • Many problems can be formulated in terms nf graphs and thus solved by graph-theoretic algorithms. This paper is concerned with finding paths between nodes over the distributed and overlapped graphs. The proposed method allows multiple agents to cooperate to find paths without merging the distributed graphs. For each graph there is a designated agent which is charged of providing path-finding service for hot graph and initiating the path-finding tasks of which path starts from the graph. The proposed method earlier on constructs an abstract graph so-called viewgraph for the distributed overlapped graphs and thus enables to extract the information about how to guide the path finding over the graphs. The viewgraph is shared by all agents which determine how to coordinate other agents for the purpose of finding paths. Each agent maintains the shortest path information among the nodes which are placed in different overlapped subgraphs of her graph. Once an agent is asked to get a path from a node on her graph to another node on another's graph, she directs other agents to provide the necessary information for finding paths.

DENTAL CARE FORE MULTIPLE ROOTLESS TEETH : A CASE REPORT (다발성 무치근 치아에 대한 치과적 처치)

  • Lee, Mi-Sook;Lee, Keung-Ho;Choi, Yeong-Chul
    • Journal of the korean academy of Pediatric Dentistry
    • /
    • v.28 no.2
    • /
    • pp.316-322
    • /
    • 2001
  • Chemotherapy and radiotherapy used on pediatric oncology patients often causes dentofacial anomalies. Defects noted include tooth and root agenesis, root thinning, root shortening, localized enamel defect and maxillofacial underdevelopment. The effect of radiotherapy usually is confined to the radiation site but the effect of chemotherapy may be more wide spread becuase of its systemic distribution. Many pediatric cancers are treated with a combination of radiation and multiagent chemotherapy. Dental treatment affected by chemotherapy and radiation therapy damage to developing teeth and maxilloface includes retention of teeth, space maintenance, prosthetic considerations, requirements for oral hygiene. The following case related to multiple rootless teeth.

  • PDF

A Case of Neuroblastoma Presenting with Sudden Blindness (실명을 주소로 한 신경아세포종 1예)

  • Ma, In-Youl;Hah, Jeong-Ok;Kim, Chun-Dong;Lee, Tae-Sook
    • Journal of Yeungnam Medical Science
    • /
    • v.2 no.1
    • /
    • pp.259-264
    • /
    • 1985
  • Neuroblastoma is the most common extracranial solid tumor of childhood which presents various clinical symptoms depending on the primary and metastatic sites. However, it has been rarely reported that sudden onset of blindness was the chief complaint of neuroblastoma. A four years old boy was admitted to the Yeungnam University Hospital with the chief complaint of a sudden onset of blindness due to a distant metastasis of abdominal neuroblastoma to the sphenoid sinus. On admission, both side pupils were dilated without light reflex, fundoscopy showed pale optic disk, electroretinogram was subnormal and visual evoked potential showed no response. The liver was palpable in $3{\frac{1}{2}}$ finger breadth from the right costal margin and adult fist sized mass was palpable in the right flank. Skull X-ray showed destructed sphenoid bone and clinoid process and brain CT scan showed tumor mass in the sphenoid sinus and left orbit. Ultrasonogram and CT scan of the abdomen showed large tumor masses around the right kidney and para-aortic and retropancreatic lymph node. IVP showed displaced right calyceal system with preserved contour. Left supraclavicular lymph node which appeared after admission was biopsied and it showed poorly differentiated neuroblasts. He was treated according to the multiagent chemotherapy schedule for stage IV neuroblastoma patient of children's cancer study group. Abdominal tumor masses and sphenoid sinus mass were markedly reduced after 2 courses of the combination chemotherapy of cyclophosphamide, vincristine, DTIC, adriamycin and VM-26. Eventhough the blindness was not improved, the patient has been in good clinical condition.

  • PDF

A Study on Applications of CSP for Multi-Agent (멀티에이전트를 이용한 CSP의 활용에 관한 연구)

  • Kim, Jin-Su
    • The Journal of Engineering Research
    • /
    • v.7 no.1
    • /
    • pp.17-28
    • /
    • 2005
  • A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem (CSP) in which variables and constraints are distributed among multiple automated agents. A CSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CPSs. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-marking. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

  • PDF

A HARMS-based heterogeneous human-robot team for gathering and collecting

  • Kim, Miae;Koh, Inseok;Jeon, Hyewon;Choi, Jiyeong;Min, Byung Cheol;Matson, Eric T.;Gallagher, John
    • Advances in robotics research
    • /
    • v.2 no.3
    • /
    • pp.201-217
    • /
    • 2018
  • Agriculture production is a critical human intensive task, which takes place in all regions of the world. The process to grow and harvest crops is labor intensive in many countries due to the lack of automation and advanced technology. Much of the difficult, dangerous and dirty labor of crop production can be automated with intelligent and robotic platforms. We propose an intelligent, agent-oriented robotic team, which can enable the process of harvesting, gathering and collecting crops and fruits, of many types, from agricultural fields. This paper describes a novel robotic organization enabling humans, robots and agents to work together for automation of gathering and collection functions. The focus of the research is a model, called HARMS, which can enable Humans, software Agents, Robots, Machines and Sensors to work together indistinguishably. With this model, any capability-based human-like organization can be conceived and modeled, such as in manufacturing or agriculture. In this research, we model, design and implement a technology application of knowledge-based robot-to-robot and human-to-robot collaboration for an agricultural gathering and collection function. The gathering and collection functions were chosen as they are some of the most labor intensive and least automated processes in the process acquisition of agricultural products. The use of robotic organizations can reduce human labor and increase efficiency allowing people to focus on higher level tasks and minimizing the backbreaking tasks of agricultural production in the future. In this work, the HARMS model was applied to three different robotic instances and an integrated test was completed with satisfactory results that show the basic promise of this research.