• Journal of the Korean Institute of Intelligent Systems
• /
• 제13권2호
• /
• pp.192-199
• /
• 2003

Agents in multi-agent systems (MAS ) are required to achieve their own goals. An agent s goal, however, can conflict with others either when agents compete with each other to achieve a common goal or when they have to use a set of limited resources to accomplish agents divergent goals. In either case, agents need to be designed to reach a mutual acceptable state where they can avoid any goal conflicts through negotiation with others to achieve their goals. In this paper, we consider a BDI agent architecture where belief, desire, and intention are the three major components for agents mental attitudes and represent resource-bounded BDI agents in logic programming framework. We propose a negotiation algorithm for BDI agents solving their problems without goal conflicts in distributed cooperative environments. Finally, we describe a simple scenario to show the effectiveness of the negotiation algorithm implemented in a negotiation meta-language.

• Journal of Communications and Networks
• /
• 제16권2호
• /
• pp.121-129
• /
• 2014

The trend of an increasing demand for a high-quality user experience, coupled with a shortage of radio resources, has necessitated more advanced wireless techniques to cooperatively achieve the required quality-of-experience enhancement. In this study, we investigate the critical problem of rate splitting in heterogeneous cellular networks, where concurrent transmission, for instance, the coordinated multipoint transmission and reception of LTE-A systems, shows promise for improvement of network-wide capacity and the user experience. Unlike most current studies, which only deal with spectral efficiency enhancement, we implement an optimal rate splitting strategy to improve both spectral efficiency and energy efficiency by exploring and exploiting cooperation diversity. First, we introduce the motivation for our proposed algorithm, and then employ the typical cooperative bargaining game to formulate the problem. Next, we derive the best response function by analyzing the dual problem of the defined primal problem. The existence and uniqueness of the proposed cooperative bargaining equilibrium are proved, and more importantly, a distributed algorithm is designed to approach the optimal unique solution under mild conditions. Finally, numerical results show a performance improvement for our proposed distributed cooperative rate splitting algorithm.

• Journal of Korean Port Research
• /
• 제13권2호
• /
• pp.289-302
• /
• 1999

As the size and complexity of network increase Distributed System Management (DSM) will be significant issue within information network in order to increase the high reliability and to improve the flexibility of network management. The OSI management model has several problems. The key problems are that it does not fully address the problem of how to develop communication protocol in support of DSM and how to classify the management connection criteria. In this paper to solve first problem described above this paper propose the connectionless CMIP to accomplish for effectively managing the distributed management managing systems to handle the dynamic informations. To work out second problem we introduce the connection criteria in the hierarchy of management system and finally evaluate the efficiency of a suggested protocol during cooperative negotiation among the managing system.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.97-100
• /
• 2000

In previous research of social dilemma, there is no extended game that the players can select one game out of some social dilemma games. We propose this kind of game as ＂Distributed Social Dilemma＂ In this game, each player tries to acquire the adaptive strategy throughout local interactions. We make use of GA as evolutionary operations. In this paper, our purpose is to examine how the game selection of players influences the evolution of cooperation in distributed social dilemma. In order to examine, we formulate distributed social dilemma by Game Theory and use agent-based simulation that each agent is regard as player

• Journal of Korea Multimedia Society
• /
• 제14권3호
• /
• pp.423-432
• /
• 2011

In a warehouse, because there exist frequent changes of stock status and the quality of some contents are influenced by the environment such as temperature, fast and accurate management of the warehouse's environment is very important for Warehouse Management Systems (WMS). However, due to the absence of a unified standard for the communication protocol between RFID nodes, the connection between RFID nodes can be broken in case of movement of a RFID reader to a region with a different protocol. Moreover, centralized MAC schemes for RFID communications in previous studies have severe problems. For an example, if a cluster header disappears from the cluster due to the cluster header's movement or bad channel conditions, the RFID member nodes of the cluster waste lots of time and energy to re-elect a new cluster header. Therefore, in this paper, we propose a WiMedia Distributed MAC (D-MAC) scheme for RFID communications and its cooperative relay transmission scheme for WMS applications Simulation results show performance improvement at the RFID node by using the proposed cooperative relay transmission scheme.

• Journal of Institute of Control, Robotics and Systems
• /
• 제16권9호
• /
• pp.891-897
• /
• 2010

This paper proposes a cooperative control algorithm for a dual-arms robot which is carrying an object to the desired location. When the dual-arms robot is carrying an object from the start to the goal point, the optimal path in terms of safety, energy, and time needs to be selected among the numerous possible paths. In order to quantify the carrying efficiency of dual-arms, DAMM (Dual Arm Manipulability Measure) has been defined and applied for the decision of the optimal path. The DAMM is defined as the intersection of the manipulability ellipsoids of the dual-arms, while the manipulability measure indicates a relationship between the joint velocity and the Cartesian velocity for each arm. The cost function for achieving the optimal path is defined as the summation of the distance to the goal and inverse of this DAMM, which aims to generate the efficient motion to the goal. It is confirmed that the optimal path planning keeps higher manipulability through the short distance path by using computer simulation. To show the effectiveness of this cooperative control algorithm experimentally, a 5-DOF dual-arm robot with distributed controllers for synchronization control has been developed and used for the experiments.

• ETRI Journal
• /
• 제20권2호
• /
• pp.149-170
• /
• 1998

Between a wide range of distributed applications, this work is particularly focused on those applications which allow a group of persons, who are geographically distributed, to interact and cooperate exchanging different kind of information in order to realize group activities in a common work environment. In this paper we realized a study of this kind of applications to identify general and functional characteristics which will then enable us to determine their communication requirements. Also, we analyzed the existent support architectures to examine whether they support multimedia cooperative applications. Based on the results of analysis, we proposed a set of communication functions needed additionally to support these applications, using the ODP(Open Distributed Processing) modelling concepts, rules and view points as our global design methodology.

• 한국ITS학회:학술대회논문집
• /
• 한국ITS학회 2010년도 춘계학술대회
• /
• pp.33-36
• /
• 2010

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3810-3830
• /
• 2015

In this paper, we investigate the differential game theoretic approach for distributed dynamic cooperative power control in cognitive radio ad hoc networks (CRANETs). First, a payoff function is defined by taking into consideration the tradeoff between the stock of accumulated power interference to the primary networks and the dynamic regulation of the transmit power of secondary users (SUs). Specifically, the payoff function not only reflects the tradeoff between the requirement for quickly finding the stable available spectrum opportunities and the need for better channel conditions, but also reveals the impact of the differentiated types of data traffic on the demand of transmission quality. Then the dynamic power control problem is modeled as a differential game model. Moreover, we convert the differential game model into a dynamic programming problem to obtain a set of optimal strategies of SUs under the condition of the grand coalition. A distributed dynamic cooperative power control algorithm is developed to dynamically adjust the transmit power of SUs under grand coalition. Finally, numerical results are presented to demonstrate the effectiveness of the proposed algorithm for efficient power control in CRANETs.

• Journal of Institute of Control, Robotics and Systems
• /
• 제19권5호
• /
• pp.429-434
• /
• 2013

This paper proposes a CPSO (Cooperative Particle Swarm Optimization)-based MPC (Model Predictive Control) scheme to deal with formation control problem of multiple nonholonomic mobile robots. In a distributed MPC framework, each robot needs to optimize control input sequence over a finite prediction horizon considering control inputs of the other robots where their cost functions are coupled by the state variables of the neighboring robots. In order to optimize the control input sequence, a CPSO algorithm is adopted and modified to fit into the formation control problem. Experiments are performed on a group of nonholonomic mobile robots to demonstrate the effectiveness of the proposed CPSO-based MPC for multi-robot formation.