1

Cooperation and Competition in Multi Agent Systems (MAS)

National Institute of Technology, Durgapur

Mechanical Engineering Department

Submitted by: Debal Saha (08/ME/76) Aman Agarwal (08/ME/83) Nishant Kumar Singh (08/ME/93) Manjunath Shrivastav Gandham (08/ME/78) Madhyama Thakur (08/ME/60)

Contents
Acknowledgement ... 3 Abstract ................. 4 I. Introduction ......... . 5 II. Literature Review ...... 6 III. Game Theory for MAS ..... 7 IV. Collision avoidance scheme for MAS................ 8 V. Strategies for soccer robot ... 10 VI. Experimental Set up .......................... 12 VII.Technical Difficulties faced ..... 18 VIII. Probable reasons non-functionality of microbots ................................ 20

IX. Remedies .. 22 X. References ......... 24

Acknowledgement
It is a well-established fact, that any endeavour undertaken is the amalgamation of the direct or indirect efforts of countless individuals coming together for a common goal. As we present our report on our final year project, we take this opportunity to express our sincere gratitude to all those who rendered valuable support to our project. First and foremost, we are thankful to our Project Guide Dr. Nirmal Baran Hui for allowing us to carry out our final project under his able guidance. The discussion regarding the various important aspects of the project, the clarification of some complicated topics, and the provisions of experimental set up by him to our project group were very crucial for the accomplishment of the project. He not only guided us to the best possible means of accomplishing a said goal, but also allowed us to explore our realms and make mistakes, and to learn from those mistakes. We are greatly indebted to him for the trust he showed on us and the latitude he allowed us. Further, we must acknowledge our entire Department of Mechanical Engineering for providing us with state of the art equipment and experimental setup.

Abstract

The report encapsulates both the theoretical foundation and the associated experimental setup required for studying and analysing the developed theoretical work. The objective of our project was to develop a game theoretic approach to address the issue of competition and coordination in Multi-Agent Systems (MAS). Here it has been shown how we can model the same real-time problems marked by dynamic constraints in the form of games where the participating agents can be treated as players with the combination of their available moves as strategies. The developed approach has been implemented for devising motion planners for agents of a MAS responsible for collision-free traversal of randomly generated paths. A second analysis is done on strategies employed by soccer robots using the game theoretic approach for MAS. The theory is developed keeping in mind its practical feasibility and its credibility to embody the basic principles of MAS. The experimental set up described in the report is the MIROSOT microbot package mainly utilized in robo-soccer tournaments. It is an efficient test bed to analyse theories of MAS. In the last two sections the various technical difficulties faced during carrying out the experiments are enumerated. Some remedies are also suggested so that the work can be continued further.

I. Introduction
Since the inception of the concept of Multi-Agent Systems (MAS) there has been a significant shift in various realms from the idea of centralized control to the approach of distributed control. The changes in the control strategies adopted for soccer robots, the change in the way to obtain optimal scheduling and resource allocation in shop floor control, the efficient routing of information/data in communication networks are few illustrations where the concepts of MAS has much better results as compared to that of the conventional centralized approaches. Various algorithms and approaches have been suggested for solving various problems by considering them and a system comprising of various agents. A strong proof regarding Genetic algorithm optimized Fuzzy logic controllers and Genetic Algorithm optimized Neural network based controllers outperforming Potential field method based controllers, were obtained in a paper published by Hui N.B.,Pratihar D.K. , A comparative study on Some Navigation Schemes of a Real Robot tackling moving Obstacles. The reason is given as the absence of any optimization technique in the Potential field method based approach or algorithm. This paper that forms the backbone or starting point of our project has considered a single planning robot. However, our main emphasis is on multiple robots working in a common dynamic environment (like a soccer game environment). One such approach is game theory. In this paper this approach is used to work with MAS. Game theory is a method of studying strategic decision making. Game theory applies to a wide range of class relations, and has developed into an umbrella term for the logical side of science, to include both human and non-humans, like computers. Classic uses include a sense of balance in numerous games, where each person has found or developed a tactic that cannot successfully better his results, given the other approach. The games studied in game theory are well-defined mathematical objects. At first, a brief review of the significant work done regarding various aspects of MAS and their implementation in diverse realms has been explored. Then the relevant concepts of game theory are discussed. Some analogies are made between the scenarios that will be tackled in the subsequent sections and the aspects of game theory resembling them. Two realistic problems are discussed using the Game Theoretic approach for MAS which are: 1) collision avoidance in MAS and 2) Strategies for soccer robots. How a collision is defined in the soccer robotics arena is defined and various schemes are tried to avoid the same. Terms such as cooperation and coordination gain enormous significance and form an integral part of our project. Later some conclusions are drawn from the analysis presented in the paper. Some suggestions are also made regarding the scope for betterment.

II. Literature Review

Cooperation and coordination are two important traits that all researchers try to incorporate in MAS as these two phenomena are central to the successful application of MAS for arriving at tangible solutions to the dynamic problems. These traits are incorporated in MAS by providing means of communication between agents and employing mechanisms to arrive at a consensus for the whole system of agents after the negotiation on the strategies employed by each agent. Various researchers have proposed various ways to formally define the term coordination and cooperation among the participating agents in a problem solving scenario. In [4] Jmaiel et al has proposed a formal model to define the coordination structure in a MAS with a formal operational semantics based on set theoretical language for the coordination process among agents. In [6] Prunak et al has described various terminologies used for the MAS both for its individual agents as well as for the system as a whole. The various attributes of MAS like coordination, cooperation, collaboration etc. have been collectively denoted as Co-X and have been studied in the generalized context to assign the various constituents of Co-X either to an agent individualistically or toe the whole MAS holistically. This assignment was done based on both empirical and statistical analysis of various processes prevailing in MAS implementation. For example the Joint information of agents is regarded as correlation entropy and by statistically computing this entropy the degree of correlation can be established. The primary issue to be addresses in such MAS is to devise an efficient way to create subtasks that has to be assignment to individual agent so that the agents should try to arrive at a consensus while trying to complete the assigned subtask. Many researchers have rigorously studied the issues of cooperation and coordination while seeking consensus for the MAS. In [10] Qianwei et al have studied the issue of collision avoidance in MAS by using centralized control mode for avoiding static obstacles. But it does not take in consideration the dynamic nature of the surrounding. In [5] Vishnu et al has explained that by implementing single agent path-planners the complexity of tackling various issues arising from the dynamic nature of surrounding/environment. They have developed a decentralized multi-agent rapidly exploring random tree (DMA-RRT). By having prior information of some obstacles a path is planned by a component of DMA-RRT algorithm whereas another component keeps updating this path following strategy dynamically by communicating with other agents and following a Merit-based Token Passing Coordination Strategy. Thus their thesis is more efficient and realistic in comparison to the centralized approach mentioned in [10]. But seldom has the issue of competition among agents with different attitudes been explored. Some researchers have tried to incorporate the concept of completion among agents by employing bidding mechanisms e.g. [1]. In [1] the authors have tried to address the problem of optimum scheduling of and resource allocation for the various processes in a production plant by implementing the concepts of Game theory and the Multi-agent systems. The various processes involved in the production of plant are treated as individual agents. A hetrarchical Multiagent system (where there is no predefined master-slave relationship) has been considered opposed to the hierarchical system where there is predefined master-slave relation among agents. In the hetrarchical system the negotiations taking place between all the agents in a distributed fashion. The negotiation among them is term co-opetition (= cooperation + competition)has been used to refer to the interaction between the various processes of the production plant. The allocation of resources and the issue of scheduling have been done optimally by treating the processes a normal form game. The time required by each particular process is referred as the available strategies for the processes which are the players.

III.

Game Theory FOR MAS:

In this section the concept of game theory is explained along with the description of the analogies required for implementing these concepts in MAS. A game can be defined as a decision-making scenario where one or more participants are involved and their decisions are interdependent. Every participant has to decide on the strategy he/she has to adopt. The participants can be called players of the game. The outcome of a game is decided by a comparative study of the various combinations of strategies for each player and the possible outcomes or payoffs of these possible combinations. We can consider a two players (A and B) game where each player plays with one strategy at a time (S A and SB). If by adopting a particular strategy SA1 player A gains more than by adopting another strategy SA2 irrespective of any strategy SB adopted by Player B, then SA1 is said to be dominant over Strategy SA2. Nash Equilibrium The behaviour of the interacting agents can be interpreted in terms of Nash Equilibrium and the global system performance correlates to the payoff of this equilibrium. The move of the agents (strategy adopted by agents) will be decided based on the dominant strategy i.e. the strategy which maximizes the payoff. In most of the cases one or more Nash Equilibria may emerge from the confrontation of strategies, leading to a pure strategy , if Nash Equilibria is unique or mixed strategies in case of multiple equilibria, which may be probability driven.

Pareto optimal solution A particular case which illustrates the efficiency of cooperation is obtained when a Pareto Optimum exists. In that case, using a Pareto Optimal strategy in a repeated game scenario is expected to provide optimal results. In a two-player game this cooperation strategy is referred to as the well-known Prisoners Dilemma.

IV.

Collision Avoidance Schemes for MAS

A very simple and effective way to test the developed game theoretic approach to address the issue of completion and cooperation in MAS is the development of motion planner for a MAS with individual agent having different priority and attitude. Random starting points and destinations can be generated for each agent. The motion planner should be responsible for generating a path between the starting point and the destinations of the agents and ensuring their collision free traversal on that path. Here we define conflict scenario as the situation in which the paths generated for two particular agents by the motion planner to reach their respective destinations intersect or so close that they may lead to collision of the agents. For the study of such scenarios the motion of entire MAS is tracked for the time period in which the agents start moving and finally reach their respective destinations. This whole time period is then divided in discrete time intervals during which the position of each agent and its future motion is checked for detecting any impending collision or in other words any conflict scenarios. While checking the movements of an agent in a particular time step, there may be more than one agent which can impose a threat of a future collision with the agent under consideration. To generate a collision free for a particular agent, it will be paired with every other agent that impose the threat of collision in the near future and the collision between the agents constituting each such pair will be considered as separate conflict scenarios. By resolution of each such conflict scenario the further motion of all the agents will be planned for the next time step. After execution of the planned motion in the next time step, again the agents which can collide in the then next time step will be considered and for each agent pairs will be formed for studying the conflict scenarios. Thus resolution of conflict scenarios in consecutive time steps will eventually help all the agents reach their respective destinations without colliding with each other. We can consider a very simple game for a conflict scenario of an impending collision between two agents considering them to be the payers of that game. Each player of the pair which are playing the game for the resolution of the conflict scenario (impending collision) has just two moves as options, one is to stop other is to move. Let, P1 and P2 be the two players. Now pIJ will represent the payoff for the Ith player when he adopts JthStrategy. For example p12 represents the payoff when Player P1 has adopted 2nd strategy. P2 P1 Stop Move Stop ( p11, p21 ) ( p12, p21) Move ( p11, p22) ( p12, p22 )

Fig. 1. The payoff matrix of a normal form game between two players The payoff pIJ for each player for adopting a particular strategy should be determined by a particular payoff function. Each of the available strategies (si i.e. stop, move) should contribute to the payoff. Thus we can define payoff function as a function of the available strategies and the certain coefficients relating to the cooperative and non-cooperative aspects of the agents so that by tuning these coefficients (adjusting their values) we can obtain such payoffs (pIJ) for the players (involved in the game representing a conflict scenario) which will help determine conclusive strategies. Now, we can write:

9 pIJ = f(Cco, Cnco, PsJ) where

pIJ= Payoff for Ith player if it chooses to adopt Jth strategy Cco = Coefficient of Cooperation Cnco = Coefficient of Non-cooperation PsJ = A value characteristic to the strategy sJ (like if the Jth strategy i.e. sJ is to stop then PsJ may be the time for which the Player stops) The above game can also be treated as a zero sum game. In a zero game between two players, one players gain is the other players loss in terms of payoff and each cell of the payoff matrix for the zero game will have a single entry. In our case, if we represent the conflict scenario as a zero sum game then the payoff of one player will be negative of the other. In such a case we can come out with a payoff function for calculating the payoff of a scenario (the combination of the strategies of both the players) instead of calculating the payoff for individual players for their respective strategies. Here pIJwill mean the payoff for the scenario where the 1st player (P1) adopts Ith strategy and the 2nd player adopts Jthstrategy. If we consider stop to be the 1st strategy and move to be the second strategy, then the payoff table will look like as follows.

P2 P1 Stop Move

Stop p11 p21

Move p12 p22

Fig. 2. The payoff matrix of a Zero Sum game between two players

The payoff function for the zero-sum game will have the same factors as that for the normal form game as discussed earlier with the variation that instead of having a factor representing the characteristic value of one strategy, there will be two factors, one representing the characteristic value of the strategy adopted by player P1 and another for that of the strategy adopted by the player P2. pIJ = f(Cco, Cnco, PsJ, PsI) where

PsJ = Characteristic value for the Jth strategy adopted by player P1 PsI = Characteristic value for the Ith strategy adopted by player P2

10

V.

Strategies for Soccer Robots

Soccer robotics has proven to one of the ideal test beds to test/simulate the effectiveness of developed strategies and concepts for the MAS. Not only does it require cooperation among the members of the same team for winning the game but also requires to take the issue of competition among the agents so that the need for adequate dribbling and passing of ball by and among the agents, respectively can be solved to increase the possession of the ball and thus trying to score more goals in the game. The strategies of soccer robots are dependent on both the responsibilities/role assigned to them and also on the region in which they are currently located. The whole field/arena for the soccer game can be divided in two regions viz. the home ground and the opponents ground. The players are categorized into defenders, mid fielders and strikers. Generally, the purpose of a player in home ground is to defend the ball from going towards its own goal. Similarly when in the opponents ground, a player will try to take the ball towards the opponents goal and score a goal. While a striker is given the responsibility to score goals by maintaining a position in the opponents ground, a defender is given the responsibility defend its own goal by clearing the ball out of regions in the home ground which are vulnerable and from where an opponent teams player can score goals.

Fig 3.Microbot used for experiments in [9] Scoring of goals, defending goal all such actions can be done by just two basic moves/actions which are dribbling the ball/holding the ball and passing the ball. If we consider a microbot as shown in the picture above, then the basic actions of dribbling and passing of ball will further get reduced to two actions of stop and move only. Passing a ball can be done by moving with the ball in the desired direction and stopping and allowing the ball to roll further and reach the desired

player. Dribbling can be thought to be done by simply moving with the ball. The same move and stop actions can be adopted by the other player who has the responsibility of receiving a pass. It can move towards the incoming ball and stop to receive it. Now the issue arising in such a scenario is to decide when to pass the ball and when to retain it. Various factors that will constraint the decision-making process for a player can be: 1) position of the ball 2) its own position (whether it is in opponents ground or in home ground) 3) the position of opponents (is there any opponent nearby) 4) the position of other teammates to check the feasibility of a pass 5) its own role in its team (is it a defender or a striker) 6) distance from the goal (from both the opponents as well as own goal)

The position of the players should be known to all others (as it is in the real soccer game) and it is one of the crucial factors affecting the choice of a strategy or to decide upon a particular strategy. The players in immediate vicinity (defined in terms of range of vision of agents) include opponents which

11 are more susceptible to tackle as well as teammates who can take a pass easily. A player if present near own goal will have more tendency to pass it off rather than a player which is near opponents goal. But the passing of a ball also depends on the presence of a team mate with in the range of passing of the ball for a player. The decision-making scenario can be represented as a normal form game. The game will be between two players of the same team which are nearest to each other. Let us denote them by P1 and P2. The game representing the scenario is one which will decide how a player and its nearest teammate interact with each other. The normal form game will lead a payoff matrix similar to that shown in Fig.2. For this all the factors enumerated above need to be considered separately and should be part of the payoff function which will decide each players payoff (pIJ). pIJ = f (Ccom, Ccoop, C1, C2, C3, C4, C5) where Ccom = Coefficient represent tendency to compete Ccoop = Coefficient representing tendency to cooperate Ci= Coefficient with the characteristic value for the ith factor enumerated above and i = 1,2..5. Here the coefficient for competition and cooperation are quite useful. Their significance can be illustrated by a particular scenario concerning player P1 of a game. Let us check the five factors that we enumerated previously which can affect the decision making process. The first factor is about the balls position and we can assume that P1 possesses the ball. Next we can consider that position of P1 is in its own ground. Let P2 be its nearest teammate. There are neither any opponents nor any other teammate as near as P2. P1 is a defender and is very near to its own goal. The distance between P1 and P2 may close enough for an efficient pass. This may appear to be an ideal situation for P1 to pass the ball. SO it may adopt to move for a time step and stop for the next time step in a way to pass it to P2. But in this process there may be an opponent who may not be near in previous time steps but is near now and can intercept the ball and score goal as P1 itself is near its own goal. So here we need to consider about other options. An option may be tuning the coefficient of competition i.e. Ccom of P1 to higher values so that it does not pass the ball though it appears as if the conditions are so much favourable for a pass. By having a higher value for Ccom, P1 will have more tendency to keep the ball with itself rather than letting it go. An exactly opposite situation may arrive when P1 is striker, is near opponents goal, has no one nearby and may choose to shoot. But the passing of the ball to other teammate which though may not be near but is positioned in a direction where a clear shoot at the goal is possible and is more likely to get the ball into the goal, may be the more logical option. Here tuning the coefficient of cooperation i.e. Ccoop may help P1 to decide in more logical way rather than deciding on the basis of favourable conditions. The values for these coefficients Ccom and Ccoop, can be decided by heuristic functions which can be formulated after running some simulated games and seeking for the best values that help the players to decide more logically.

12

VI.

Experimental Setup

The Experimental Set Up can be divided into 3 distinct heads i.e MyVision Board RF Board CCD Cameras All of these heads need to be first installed and then tested if they are functioning properly or not. A brief outline is provided here enumerating how to install and check these hardware components. 1. Installation of MyVision board: The MyVision Board needs to be inserted in the PCI slot of the computer. It acts as an interface for the interaction between the CCD camera and the computer. The captured images by the CCD camera are transferred to the computer via the BNC cable that attached the CCD camera to the MyVision board. The drivers are installed from the CD provided by the manufacturers of the mirosot package. 2. RF Board: RF board allows the computer to wireless communicate with soccer robots. RF board is installed to control and move the soccer robots through wireless communication. This is done by connecting the serial cable into JP2 of the RF board and a serial port (COM1) of the PC. Then we plug the power adapter (DC9V) into J1 of the RF board and AC power source (AC220V).

13 * The three pins of JP4 should not be jumped with each other. That is, JP4 should remain open.

JP4

ANT BIM418(or 433) DC 9V JP1 POWER

DC 5V JP7

Radiometrix Module: A RF (Radio Frequency) module is a compact component used for wireless radio communication. In this case, radio frequency refers to a general electric wave and not only a radio broadcasting frequency. RF modules can be classified by frequency, modulation method, data, output strength, etc. RF modules are frequently used when precise wireless applications are necessary.

BiM-UHF
The BiM-418-F and BiM-433-F are miniature UHF radio modules capable of half duplex data transmissions at speeds up to 40 Kbit/s over distances of 30 meters in-building and 120 meters

14
over open ground. Single 4.5V to 5.5V power supply is required.

Frequency BiM-418F BiM-433F 418.00 MHz 433.92 MHz

Speed 40K bps 40K bps

Distance 30~120 m 30~120 m

Radiated Power -6 dBm -6 dBm

Receive Sensitivity -107 dBm -107 dBm

Power 4.5~5.5 V 4.5~5.5 V

Whip Antenna 16.5 cm 15.5 cm

TX2, RX2
The TX2 and RX2 data link modules are a miniature PCB mounting UHF radio transmitter and receiver pair which enable the simple implementation of a data link at up to 40 Kbit/s at distances up to 75 meters in-building and 300 meters open ground. 3.3V and 5V version are available.

Frequency 418.00 MHz 433.92 MHz 418.00 MHz 433.92 MHz

Speed 40K bps 40K bps

Speed Distance 75~300 m 75~300 m

TX2 RX2

Radiated Power -6 dBm +9 dBm

Receive Sensitivity

Power 4.0~6.0 V

-100 dBm

4.0~6.0 V

Whip Antenna 16.5 cm 15.5 cm 16.5 cm 15.5 cm

Tx Module

15

Rx Module

An RF Transmitter Module:-

16

Power supply The board uses a single DC 5V power source. Power can be supplied via three methods: DC 5V to the JP7 port. 9V battery to the JP1 port. DC 6~12V adapter to the J1 port.

You must use only one of the above. If a DC adapter is used, and the LED D2 does not light, change the polarity of the plug. The Charisma board has a power cut-off diode, which prevents damage due to incorrect polarity.
Power 5V 6~12V adapter 9V battery Port JP7 J1 JP1

Fig 3: Radiometrix module- BiM-UHF transceiver

17

3. How to install CCD camera

The CCD cameras are set up after this. The Lens is mounted on the CCD camera and we plug the Lens Cable (Auto Iris Control Cable) into the camera connector on the right side of the CCD camera. Set the Dip Switch (Lens Selection Switch) on the right side of the CCD camera to DC. That is why the lens is controlled by DC. Connect the Camera Power Adapter (AC24V) to the 2 pin connector on the rear of the CCD camera.Finally the CCD camera is fixed to the Camera Stand. The height and position of the camera is adjusted according to requirement.The Video Cable (included in MyVision Board Pack) is connected to the CCD camera and the MyVision board.

18

VII.

Technical Difficulties Faced

Incompatibility of the software Mirosot to Windows 7/Vista/XP:-

Fig 1. DB9 cable Our experiment has to be carried out with the help of a software named Mirosot which was to be used for the manipulation of the soccer robots. However, the problem that we faced was its incompatibility to various operating systems like Windows 7/Vista/XP. After installing the software we tried testing it but couldnt get any results, may be the software was not able to transfer the required signal to the RF Transmitter through DB 9 cable (Fig 1). Later on we had to install window 2000 as it was mentioned in the specification of the setup, still we were unable to get the results due to some other reasons.

Fig 2: Software used to run mirosot robot

19 Difficulties faced while charging the battery of the bots:Another problem that we faced during testing was improper charging of the bots. The specifications provided to us in the manual for the proper charging of the bots at different modes wereFast Mode: Time required for full charging of the bots is 6 hrs. Slow Mode: Time required for full charging of the bots is 12 hrs.
Charger used for charging the Mirosot Robots:-

RS-BATTERY-Charger Battery charger kit for the RS-BATTERY-NiMH-450, RS-BATTREY-NiMH-600, and RSBATTERY-NiCd batteries.

Specifications Size: 35 x 35 x 16 mm Power: 7.2 V (1.2 x 6), 450mAh 7.2 V (1.2 x 6), 600mAh Features: Designed for a small robot.
Compact and high power density

However, the backup given by the bots after full charging always lasted for 5 minutes at max, and some of them even had zero backup. Therefore, the sufficient time required to carry out the experiment was not fulfilled.

RF Transmitter: Problem with the transmitter:-

However, the problems that we encountered during the test was that the pins showed no voltage variation which was necessary for transmission. As mentioned in the above descriptions, the voltage and the current readings that were recorded at each pins were more or less the same. The supply voltage normally found was around 5.0 V, the voltage reading at the RX and the TX terminals were found to be 1.5 and 0.5 V and for the transmission of the signal this voltage must show some variations, but there was no sign of variation in either of the pins.

20

VIII. The probable reasons for the non-functionality of the microrobots:

Software incompatibility:

Software incompatibility is the foremost problem to be looked upon in carrying out the testing operations. There may be an error in the software itself. The software is designed at a very early stage before introduction of latest windows operating systems(Windows XP/Vista/7). So the software may not have been updated to run or the improper addressing of its compatibility issues. This may lead to severe incompatibility issues. Hence this issue is to be addressed primarily before proceeding any further into the testing operations.

Error due to serial port:

The error in the serial port of the computer may be due to hardware incompatibility with the RF Transmitter or there may be error in the baud rate for data transmission. As explained in [1] the name "serial" comes from the fact that a serial port "serializes" data. That is, it takes a byte of data and transmits the 8 bits in the byte one at a time. The advantage is that a serial port needs only one wire to transmit the 8 bits (while a parallel port needs 8). The disadvantage is that it takes 8 times longer to transmit the data than it would if there were 8 wires. Serial ports lower cable costs and make cables smaller. Before each byte of data, a serial port sends a start bit, which is a single bit with a value of 0. After each byte of data, it sends a stop bit to signal that the byte is complete. It may also send a parity bit. Serial ports, also called communication (COM) ports, are bi-directional. Bi-directional communication allows each device to receive data as well as transmit it. The baud rate is the rate which is used for the communication purpose and it is used to identify that how much of the data had been transferred but at how much speed. This is the symbol which is used for the measurement of the symbols but at the rate of per second. This is used for many different purposes but to measure the communication rate, the baud rate is the best rate which had been defined.In most of the cases the baud rate had been used in the sense of symbol rate which exactly show that how much of the speed had been in the transmission of the data or some other work which had been carried out through the systems. It is also at times used for some codes as well where the user is using it in determining the time that had been taken by the code and in its testing and the running phase. It must be taken into account that the baud rate must not be misused with the gross bit rate. In other terms the baud rate is used to describe the changes that are brought in the pr second line that are being entered. It had been found out that the bit of the information can be easily converted into electrical changes as well. The baud rate of data transmission in both transmitter and receiver (which in this case are system and RF transmitter) must be same for maximum efficiency. The baud rate of a transmitter must always be less than transmitter for the data transmission to take place. If the baud rate of transmitter is less than receiver then data transmission doesnt

21 take place (e.g: baud rate of transmitter is 10kbps n that of receiver is 2kbps then there is no way receiver can pass the remainder of 8 kbps of data)

Fault in the transmitter due to corrupted encoder which cant send proper signals even if there are proper commands given to the IR transmitter by the computer via the serial port:

An encoder is a device, circuit, transducer, software program, algorithm or person that converts information from one format or code to another, for the purposes of standardization, speed, secrecy, security, or saving space by shrinking size. In this case the encoder in the IR transmitter converts the data received into the required mode of transmission to be received by the receivers in the robots.

Fault in the architecture of the robot:

The primary fault may include battery wherein the power supplied from the battery is not constant. Secondary fault may perhaps be decrease in the power capacity of the batteries owing to large stagnant time between acquisition and application times. For much of the experiment the running time for the battery during the testing was below 20min, which is the approximate running time of the battery for a complete charge calculated in accordance with the specifications. This may be due to:1)faulty charger 2)faulty battery.

22

IX.

Remedies:-

1. Software Incompatibility Issue:The mirosot software that we used in our experiment was only compatible with windows 2000/98 and was incompatible with the operating systems usually used now days, so the software must be updated to its higher versions and proper addressing should be done to avoid this incompatibility issue.

2. Serial Port Issue:The problem with the serial port due to its hardware incompatibility with the RF Transmitter may lead to some serious issues that we need to work upon. The serial port enables the hardware to run by serializing the data, i.e. it takes a byte of data and transmits the 8 bits in the byte one at a time, the serial port takes 8 times longer to transmit the data, so while processing the serial port or the COM port might crash which may lead to further inconvenience. Therefore, in order to overcome this problem we consider the following procedure: OPEN "COM1:300,N,8,1,BIN,CD0,CS0,DS0,OP0,RS,TB2048,RB2048" AS #1 (This OPEN is FOR RANDOM access.) The following is an explanation of each parameter used in this OPEN statement: recommended

The higher the baud rate, the greater the chances for problems; thus, 300 baud is unlikely to give you problems. 2400 baud is the highest speed possible over most telephone lines, due to their limited highfrequency capability. 19,200 baud, which requires a direct wire connection, is most likely to cause problems. (Possible baud rates for QuickBasic are 75, 110, 150, 300, 600, 1200, 1800, 2400, 4800, 9600, and 19,200.). Parity usually does not help you significantly; because of this, you should try No parity (N). For those devices that require parity, you should use the PE option (Parity Enable) in the OPEN COM statement, which is required to turn on parity checking. When the PE option turns on parity checking, a "Device I/O error" occurs if the two communicating programs have two different parities. (Parity can be Even, Odd, None, Space, or Mark). For example, a "Device I/O error" occurs when two programs try to talk to each other across a serial line using the following two different OPEN COM statements: OPEN "COM1:1200, O, 7, 2, PE" FOR RANDOM AS #1 And OPEN "COM2:1200, E, 7, 2, PE" FOR RANDOM AS #2 If the PE option is removed from the OPEN COM statements above, no error message displays.

23 The above example uses 8 data bits and 1 stop bit. Eight data bits requires No parity (N), because of the size limit for Basic's communications data frame (10 bits). The BIN (binary mode) is the default. Note: The ASC option does NOT support XON/XOFF protocol, and the XON and XOFF characters are passed without special handling. Ignoring hardware handshaking often corrects many problems. Thus, if your application does not require handshaking, you should try turning off the following hardware line-checking: CD0 = Turns off time-out for Data Carrier Detect (DCD) line CS0 = Turns off time-out for Clear to Send (CTS) line DS0 = Turns off time-out for Data Set Ready (DSR) line OP0 = Turns off time-out for a successful OPEN RS suppresses detection of Request to Send (RTS). For buffer-related problems, try increasing the transmit and receive buffer sizes above the 512-byte default: TB2048 = Increases the transmit buffer size to 2048 bytes. RB2048 = Increases the receive buffer size to 2048 bytes.

3. How to solve the architecture issues of the robot:

Architecture issues of the robot may include faulty battery, faulty connections and faulty charger. All these problems can be fixed by replacing the battery and checking the connections properly. The backup of the battery should be sufficient enough to carry out the experiment, so in order to solve this issue, battery problem is the foremost issue that should be taken care of. After solving the battery problem, all the wired connections in the Microrobot should be checked properly. One more problem that we normally encounter while carrying out the experiment is that we dont find proper voltage variation at each terminal and the pins of the charisma board, so after each trial the voltage readings should be taken with the help of a multimeter. Replacing the charger might also solve this issue.

24

X.

References :

[1] Jihad Reaidy, Daniel Deip, Pierre Massote, Management and control of Complex Production Systems: Co-opetition through Game Theory Principles and Agent based Information Systems. [2] Vincent A. Cicirello, A Game Theoretic Analysis of Multiagent Systems for Floor Shop Routing, Tech. Report, CMU-RITR-01-28, Robotic Institute, Carnegie Mellon University, 2001. [3] Felix Brandt, Felix Fischer, Marcus Holzer, On Iterated Dominance, Matrix Elimination and Matched Paths, Symposium on Theoretical Aspects of Computer Science 2010, (Nancy, France), pp.107-118. [4] Mohamed Jmaiel, Ahmed Hadj, AmiraRgaieg, An operational semantics dedicated to the cooperation of cooperating agents,Intelligent agent and Multi-Agent systems, 5th Pacific Rim International Workshop on Multi-Agent Systems, PRIMA 2002, Japan, August 2002 Proceedings. [5] Vishnu R. Desaraju, Jonathan P. How, Decentralized Path Planning for Multi-Agent Teams in Complex Environment using Rapidly- exploring Random Trees, IEEE Int. Conf. on Robotics & Automation, 2011, Shanghai China, pp.4956-4961. [6] H.V.D. Parunak, S. Brueckner, Mitch Fleischer, James Odell, A design Taxonomy of MultiAgent Interaction, Agent-Oriented Software Engineering IV, Melbourne, AU 2003, pp 123-127. [7] K.H. Park, Y.J. Kim, J.H. Kim, Modular Q-learning based Multi-Agent Cooperation for robot soccer, Robotics and Automation Systems(2001) , Vol.35, pp. 109-122. [8] H.S. Shim, H.S. Kim, M.J. Jung, I.H. Choi, J.H. Kim, J.O. Kim, Designing distributed control architecture for cooperative multi-agent system and its real-time application to soccer robot, Robotics and Automation System(1997), Vol.21, pp. 149-165. [9] N.B. Hui, D.K. Pratihar, Comparative study on some navigation schemes of a real robot tackling moving obstacles, Robotics and Computer Integrated Manufacturing(2009), Vol.25, pp. 810828. [10] H. Qianwei, M. Hongxu, Z. Hui, Collision avoidance Mechanism for Multi-Agent Systems, Proceedings of 2003 IEEE Int. Conf. on Robotics, Intelligent Systems and Signal Processing, China (2003). [11] E.S. Kazerooni, K. Khorasani, Multi-Agent Team Cooperation: A Game Theory Approach, Automatica(2009), Vol.45, pp. 2205-2213. [12] R.B. Myerson, Game Theory: Analysis of Conflict, Harvard University Press, [13] Mirosot Soccer Robot The robots are developed for FIRA Mirosot in which two teams of five or eleven robots competes in a soccer game. The URL: http://www.roboerectus.org/Mirosot/Mirosot.php. [14] Soccer Robots and Accessories RS-MIROSOT-100 Advanced Soccer Robot. The URL: http://www.robotstorehk.com/soccer/soccer.html. [15] How Serial Ports work from the website www.howstuffswork.com . The url:

http://computer.howstuffworks.com/serial-port1.htm
[16] Serial port problem solutions from the website: http://support.microsoft.com/kb/39342