• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.229-245
• /
• 2023

In this paper, we consider cooperative elliptic systems under conjugation conditions. We first prove the existence of the state for 2 × 2 cooperative elliptic systems with Dirichlet and Neumann conditions, then we find the set of equations and inequalities that characterizes the optimal control of distributed type for these systems. The case of n × n cooperative systems is also established.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.3
• /
• pp.401-412
• /
• 2008

This paper discusses a design methodology of cooperative path planning for dynamical multi-agent systems with spatial and temporal constraints. The cooperative behavior of the multi-agent systems is specified in terms of the objective function in an optimization formulation. The path of achieving cooperative tasks is then generated by the optimization formulation constructed based on a differential flatness approach. Three scenarios of multi-agent tasking are proposed at the cooperative task planning framework. Given agent dynamics, both spatial and temporal constraints are considered in the path planning. The path planning algorithm first finds trajectory curves in a lower-dimensional space and then parameterizes the curves by a set of B-spline representations. The coefficients of the B-spline curves are further solved by a sequential quadratic programming solver to achieve the optimization objective and satisfy these constraints. Finally, several illustrative examples of cooperative path/task planning are presented.

• Journal of Korean Library and Information Science Society
• /
• v.35 no.1
• /
• pp.19-49
• /
• 2004

This study intends to develop a model of nation-wide library cooperative system for Korea. It analyzes and investigates the definitions, types and models of library cooperation; and current status and problems in operations of major cooperative systems in Korea and other nations. There are some cooperative systems such as cooperative system for public libraries operated by the National Library of Korea and other systems based on their regions or library types in Korea. New model of nationwide cooperative system can improve library functions through many cooperative plans.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.282-287
• /
• 2008

In distributed mobile robot systems, autonomous robots accomplish complicated tasks through intelligent cooperation with each other. This paper presents behavior learning and online distributed evolution for cooperative behavior of a group of autonomous robots. Learning and evolution capabilities are essential for a group of autonomous robots to adapt to unstructured environments. Behavior learning finds an optimal state-action mapping of a robot for a given operating condition. In behavior learning, a Q-learning algorithm is modified to handle delayed rewards in the distributed robot systems. A group of robots implements cooperative behaviors through communication with other robots. Individual robots improve the state-action mapping through online evolution with the crossover operator based on the Q-values and their update frequencies. A cooperative material search problem demonstrated the effectiveness of the proposed behavior learning and online distributed evolution method for implementing cooperative behavior of a group of autonomous mobile robots.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.81-82
• /
• 2006

Most work on cooperative diversity has assumed that the cooperating group (source and partners) and the associated average channel conditions between terminals (source, partners, and destination) are predetermined. In practical situations, however, it is important to develop the efficient algorithms for assigning the terminals with good inter-user channels for cooperating groups. In this paper, we propose the partner assignment algorithm for cooperative diversity in mobile communication systems. The proposed partner assignment algorithm is investigated by using the path loss model for mobile communication systems. Numerical results show that the proposed partner assignment algorithm provides the comparable probability of cooperative transmission to the partner assignment algorithm using exhaustive search. The probability of cooperative transmission increases with the number of users, which gives potential benefits of practical implementation to user cooperation in mobile communication systems.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.14-23
• /
• 2023

The cooperative communication systems using MIMO(multiple input multiple-output) relay are known as one of the most promising techniques to improve the performance and coverage of wireless communication systems. In this paper, we propose the cooperative communication systems using the relay with multi-antennas and DSTC(distributed space time coding) for decode-and-forward protocol. As using DSTC for DF(decode-and-forward), we can minimize the risk of error propagation at the wireless system using relay system. Also, the MIMO channel cab be formed by multi-antenna and DSTC at the MS(mobile station)-RS(relay station) and at the RS-BS(base station).Therefore, obtaining truly constructive the MIMO diversity and cooperative diversity gain from the proposed approach, the performance of system can be more improved than one of conventional system (relay with single antenna, no relay). The improvement in bit error rate is investigated through numerical analysis of the cooperative communication system with the proposed approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1387-1391
• /
• 2003

The fundamental aim of this paper is to present a solution algorithm to achieve cooperative contour controlling, under joint acceleration constraint with maximum cooperative speed. Usually, the specifications like maximum velocity of cooperative trajectory are determined by the application itself. In resolving the cooperative trajectory into two complementary trajectories, an optimum task resolving strategy is employed so that the task assignment for each robot is fair under the joint acceleration constraint. The proposed algorithm of being an off-line technique, this could be effectively and conveniently extended to the existing servo control systems irrespective of the computational power of the controller implemented. Further, neither a change in hardware setup nor considerable reconfiguration of the existing system is required in adopting this technique. A simulation study has been carried out to verify that the proposed method can be realized in the generation of complementary trajectories so that they could meet the stipulated constraints in simultaneous maneuvering.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.3
• /
• pp.789-801
• /
• 2014

In this paper, we study the existence of ground state solutions for a class of non-resonant cooperative elliptic systems by a variant weak linking theorem. Here the classical Ambrosetti-Rabinowitz superquadratic condition is replaced by a general super quadratic condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.661-668
• /
• 2008

In this paper, a channel estimation technique based on pilot tones is proposed for cooperative SFBC-OFDM systems with a STO(Symbol Timing Offset). In a cooperative SFBC-OFDM system, the STO between RS(Relay Station) and MS(Mobile Station) varies depending on the location of MS. Since the STO causes distortion in the form of phase rotation, a channel estimation technique based on linear interpolation with respect to phase and amplitude is proposed for the case of orthogonal pilot allocation. Also, a channel estimation technique is proposed by solving nonlinear equation for the case of pilot structure with orthogonal code. It is shown by computer simulation that the performance of channel estimation can be significantly improved when the proposed techniques are applied to cooperative SFBC-OFDM systems with STO.

• Journal of Mechanical Science and Technology
• /
• v.19 no.9
• /
• pp.1720-1730
• /
• 2005

Automatic guided vehicle in the factory has an important role to advance the flexible manufacturing system. In this paper, we propose a novel object-transportation control algorithm of cooperative AGV systems to apply decentralized control to multiple AGV systems. Each AGV system is under nonholonomic constraints and conveys a common object-transportation in a horizontal plain. Moreover it is shown that cooperative robot systems ensure stability and the velocities of augmented systems convergence to a scaled multiple of each desired velocity field for cooperative AGV systems. Finally, the application of proposed virtual passivity-based decentralized control algorithm via system augmentation is applied to trace a circle. Finally, the simulation and experimental results for the object-transportation by two AGV systems illustrates the validity of the proposed virtual-passivity decentralized control algorithm.