• Title/Summary/Keyword: cooperative algorithm

Search Result 356, Processing Time 0.031 seconds

Relay node selection algorithm consuming minimum power of MIMO integrated MANET

  • Chowdhuri, Swati;Banerjee, Pranab;Chaudhuri, Sheli Sinha
    • Advances in Computational Design
    • /
    • v.3 no.2
    • /
    • pp.191-200
    • /
    • 2018
  • Establishment of an efficient routing technique in multiple-input-multiple-output (MIMO) based mobile ad hoc network (MANET) is a new challenge in wireless communication system to communicate in a complex terrain where permanent infrastructure network implementation is not possible. Due to limited power of mobile nodes, a minimum power consumed routing (MPCR) algorithm is developed which is an integration of cooperative transmission process. This algorithm select relay node and support short distance communication. The performance analysis of proposed routing algorithm increased signal to noise interference ratio (SNIR) resulting effect of cooperative transmission. Finally performance analysis of the proposed algorithm is verified with simulated result.

Cooperative behavior and control of autonomous mobile robots using genetic programming (유전 프로그래밍에 의한 자율이동로봇군의 협조행동 및 제어)

  • 이동욱;심귀보
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.1177-1180
    • /
    • 1996
  • In this paper, we propose an algorithm that realizes cooperative behavior by construction of autonomous mobile robot system. Each robot is able to sense other robots and obstacles, and it has the rule of behavior to achieve the goal of the system. In this paper, to improve performance of the whole system, we use Genetic Programming based on Natural Selection. Genetic Programming's chromosome is a program of tree structure and it's major operators are crossover and mutation. We verify the effectiveness of the proposed scheme from the several examples.

  • PDF

A Motion Planning Algorithm for Synchronizing Spatial Trajectories of Multi-Robots (다수 로봇간 공간궤적 동기화를 위한 모션계획 알고리즘)

  • Jeong Young-Do;Kim Sung-Rak;Lee Choong-Dong;Lim Hyun-Kyu
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.12
    • /
    • pp.1233-1240
    • /
    • 2004
  • Recently the need for cooperative control among robots is increasing in a variety of industrial robot applications. Such a control framework enhances the efficiency of the real robotic assembly environment along with extending the robot application. In this paper, an ethernet-based cooperative control framework was proposed. The cooperative control of robots can multiply the handling capacity of robot system, and make it possible to implement jigless cooperation, due to realization of trajectory-synchronized movement between a master robot and slave robots. Coordinate transformation was used to relate among robots in a common coordinate. An optimized ethernet protocol of HiNet was developed to maximize the speed of communication and to minimize the error of synchronous movement. The proposed algorithm and optimization of network protocol was tested in several class of robots.

Stability Analysis of Decentralized PVFC Algorithm for Cooperative Mobile Robotic Systems

  • Suh, Jin-Ho;Lee, Kwon-Soon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1909-1914
    • /
    • 2004
  • Passive velocity field control (PVFC) was previously developed for fully mechanical systems, in which the motion task was specified behaviorally in terms of a velocity field, and the closed-loop was passive with respect to a supply rate given by the environment input. However the PVFC was only applied to a single manipulator, the proposed control law was derived geometrically, and the geometric and robustness properties of the closed-loop system were also analyzed. In this paper, we propose a method to apply a decentralized control algorithm to cooperative 3-wheeled mobile robots whose subsystem is under nonholonomic constraints and which convey a common rigid object in a horizontal plain. Moreover it is shown that multiple robot systems ensure stability and the velocities of augmented systems convergence to a scaled multiple of each desired velocity field for cooperative mobile robot systems.

  • PDF

A Study on Cooperative Intelligece and Chaotic Behaviors of Distributed Autonomuos Mobile Robot Systems (분산 자율 이동 로봇 시스템의 협조 지능 및 카오스 행동의 연구)

  • Jae-Kal, Uk;Kang, Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.4
    • /
    • pp.8-17
    • /
    • 1998
  • Autonomous mobile robot agents(AMRAs) are robots which perform a given task by the same distributed self-organizing rules. In this paper, we let them form an equi-distance circle for the task of cooperative behaviors. Here, we suggest an algorithm to perform the taqk and then utilize a fuzzy system to improve the algorithm. It is shown that various cooperative activities appear in the simulation and particularly chaotic behaviors also appear by increasing the robot speed. Moreover, we prove the characteristics of this chaotic behaviors by calculating Lyapunov exponent.

  • PDF

Cooperative motion planning of two tightly-coupled mobile robots (강한 결합조건을 갖는 두 이동로봇의 협동 운동계획)

  • Lee, Seung-Hwan;Lee, Seung-Ha;Lee, Yun-Jung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.8
    • /
    • pp.948-954
    • /
    • 1999
  • In this paper, we propose a cooperative motion planning algorithm for two tightly-coupled mobile robots. Specifically, the considered cooperative work is that two mobile robots should transfer a long rigid object along a predefined path. To resolve the problem, we introduce a master-slave concept for two obile robots having the same structure. According to the velocity of the master robot and the positions of two robots on the path, the velocity of the slave robot is determined. The slave normally tracks the master's motion, but in case that the velocity of the slave exceeds the velocity limit, the roles of the robots should be interchanged. The effectiveness of the proposed algorithm is proved by computer simulations.

  • PDF

Decentralized Control of Cooperative Mobile Robot Systems Using Passive Velocity Field Control Method (수동 속도장 제어법을 이용한 협조 이동로봇 시스템의 분산제어)

  • 서진호;이권순
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.12 no.4
    • /
    • pp.129-138
    • /
    • 2004
  • In this paper, we propose a method to apply a decentralized control algorithm for passive velocity field control using virtual flywheel system to cooperative 3-wheeled mobile robots, and these subsystem are under nonholonomic constraints. The considered robotic systems convey a common rigid object in a horizontal plain. Moreover we will proof the passivity and robustness for cooperative mobile robotic systems with decentralized passive velocity field control. Finally, The effectiveness of proposed control algorithm is examined by numerical simulation for cooperation tasks with 3-wheeled mobile robot systems.

CADRAM - Cooperative Agents Dynamic Resource Allocation and Monitoring in Cloud Computing

  • Abdullah, M.;Surputheen, M. Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.3
    • /
    • pp.95-100
    • /
    • 2022
  • Cloud computing platform is a shared pool of resources and services with various kind of models delivered to the customers through the Internet. The methods include an on-demand dynamically-scalable form charged using a pay-per-use model. The main problem with this model is the allocation of resource in dynamic. In this paper, we have proposed a mechanism to optimize the resource provisioning task by reducing the job completion time while, minimizing the associated cost. We present the Cooperative Agents Dynamic Resource Allocation and Monitoring in Cloud Computing CADRAM system, which includes more than one agent in order to manage and observe resource provided by the service provider while considering the Clients' quality of service (QoS) requirements as defined in the service-level agreement (SLA). Moreover, CADRAM contains a new Virtual Machine (VM) selection algorithm called the Node Failure Discovery (NFD) algorithm. The performance of the CADRAM system is evaluated using the CloudSim tool. The results illustrated that CADRAM system increases resource utilization and decreases power consumption while avoiding SLA violations.

Power-aware Relay Selection Algorithm for Cooperative Diversity in the Energy-constrained Wireless Sensor Networks (전력 제한된 무선 센서네트워크에서 협력 다이버시티를 위한 전력인지 릴레이 선택 알고리즘)

  • Xiang, Gao;Park, Hyung-Kun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10A
    • /
    • pp.752-759
    • /
    • 2009
  • Cooperative diversity is an effective technique to combat multi-path fading. When this technique is applied to energy-constrained wireless sensor networks, it is a key issue to design appropriate relay selection and power allocation strategies. In this paper, we proposed a new multi-relay selection and power allocation algorithm to maximize network lifetime. The algorithm are composed of two relay selection stages, where the channel condition and residual power of each node were considered in multi-relay selection and the power is fairly allocated proportional to the residual power, satisfies the required SNR at destination and minimizes the total transmit power. In this paper, proposed algorithm is based on AF (amplify and forward) model. We evaluated the proposed algorithm by using extensive simulation and simulation results show that proposed algorithm obtains much longer network lifetime than the conventional algorithm.

A Novel Localization Algorithm using Received Signal Strength Difference

  • Lim, Deok Won;Seo, Jae-Hee;Chun, Sebum;Heo, Moon Beom
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.6 no.4
    • /
    • pp.141-147
    • /
    • 2017
  • In this paper, an efficient and robust localization algorithm using Receiver Signal Strength Difference (RSSD) for a non-cooperative RF emitter is given. The proposed algorithm firstly calculate the center point and radius of Apollonius's circles and then estimate the intersection point of the circles based on Time of Arrival concept. And this paper also compares the performance of RSSD localization algorithms such as Non-linear Least Squares and Linearized Least Squares by Lines of Position (LOP) with the proposed algorithm. And some conclusions have been reached regarding the relative accuracy, robustness and computational cost of these algorithms.