Agent Group Università di Modena e Reggio Emilia Theory and Practice of Field- based Motion Coordination in Multi-Agent Systems Marco Mamei, Franco Zambonelli DISMI – Università di Modena e Reggio Emilia – ITALY { mamei.marco, franco.zambonelli

Agent Group Università di Modena e Reggio Emilia Background and Motivations Main challenge in open and dynamic application scenario is the need for robustness despite environment dynamism. With this regard the Autonomous Agent approach is promising, in that it promotes a shift from design-time interaction patterns to run-time interaction patterns. To shape these interaction patterns, agents need to be context- aware. An agent can meaningfully interact and coordinate with other agents only if it is aware of “what is around”. …However, current systems focus mainly in providing general- purpose contextual information and almost disregard how to use the information. –E.g. Pub/sub models

Agent Group Università di Modena e Reggio Emilia What we are looking for… On the contrary, enabling adaptive and cost- effective coordination requires minimizing: agents’ efforts in acquiring AND exploiting contextual information. –In most situations human agents want to act - they do not want to study large context info. –In most situations software agents cannot be provided with enough AI to effectively understand large context info. Special purpose contextual information:. –(CONS) context information cannot easily be re-used in several applications. –(PRO) easy to decide what to do

Agent Group Università di Modena e Reggio Emilia Coordinating mobility in Pervasive Computing Scenarios –Agents have to organize their respective movements according to some policy Our Domain and Follow Though Case Study… Marco Franco Marco and Franco want to maintain a formation while moving in the building.

Agent Group Università di Modena e Reggio Emilia What we found Co-Fields Special purpose contextual information: a “red carpet” leading to the right location. Field based motion coordination –The Flocking-Formation Problem

Agent Group Università di Modena e Reggio Emilia Theory of Field Approach… Agents are seen as balls rolling on a surface… dynamical system formalism. Differential Equations Integrate …

Agent Group Università di Modena e Reggio Emilia The TOTA Middleware –P2P Network, where each peer runs a local version of the TOTA middleware Distributed tuples injected and spread in the network implement the concept of field. –T=(C,P) TOTA maintains tuples’ shape despite network dynamics From Theory to Practice… Tuples On The Air

Agent Group Università di Modena e Reggio Emilia Flocking Example Marco creates a flock field having a minimum at two hop distance

Agent Group Università di Modena e Reggio Emilia Flocking Example

Agent Group Università di Modena e Reggio Emilia Flocking Example

Agent Group Università di Modena e Reggio Emilia Flocking Example

Agent Group Università di Modena e Reggio Emilia Flocking Example

Agent Group Università di Modena e Reggio Emilia Flocking Example

Agent Group Università di Modena e Reggio Emilia Flocking Example

Agent Group Università di Modena e Reggio Emilia Implementation The same code installed on simulated nodes, runs also on the IPAQ

Agent Group Università di Modena e Reggio Emilia Programming TOTA Applications Programming the agents Programming the tuples

Agent Group Università di Modena e Reggio Emilia TOTA API voidinject (TotaTuple tuple); Vectorread (Tuple template); VectorreadOneHop (Tuple template); Tuplekeyrd (Tuple template); VectorkeyrdOneHop (Tuple template); Vectordelete (Tuple template); voidsubscribe (Tuple template, ReactiveComponent comp, String rct); voidunsubscribe (Tuple template, ReactiveComponent comp); voidmove (TotaTuple tuple); void store (TotaTuple tuple);

Agent Group Università di Modena e Reggio Emilia Flocking Agent public class FlockAgent extends AbstractAgent { public void run() { FlockingTuple ft = new FlockingTuple(); ft.content = "flock"; tota.inject(ft); while(true) { FlockingTuple ft = new FlockingTuple(); ft.content = "flock"; Vector pv = tota.readOneHop(ft); /* get minimum */ Peer min = getDownhill(pv); if(min == null) return; /* get min coordinates...*/ GenPoint target = min.getCoordinates(); if(target == null) return; this.move(target); } Very Simple: Agents are balls just rolling upon the field surface…

Agent Group Università di Modena e Reggio Emilia Programming TOTA Applications Programming the agents Programming the tuples

Agent Group Università di Modena e Reggio Emilia TOTA Tuples TotaTuple MetricTuple StructureTuple SpaceTupleHopTupleMessageTuple

Agent Group Università di Modena e Reggio Emilia Tuple Programming public final void propagate() { if( decideEnter() ) { boolean prop = decidePropagate() ; changeTupleContent() ; makeSubscriptions() ; tota.store(this); if(prop) tota.move(this); }

Agent Group Università di Modena e Reggio Emilia Flocking Tuple public class FlockingTuple extends HopTuple { public int value = 2; protected void changeTupleContent() { super.changeTupleContent(); if(hop <= 2) value --; else if(hop >2) value ++; }

Agent Group Università di Modena e Reggio Emilia From Practice to Experiment Tuples must be propagated and maintained. Propagation is based on a simple hop-by-hop epidemic mechanism. We developed an algorithm to maintain the tuples locally… What happens is realistic scenarios?

Agent Group Università di Modena e Reggio Emilia Experiment I Inject a tuple Change the topology and record the number of messages sent to update the tuple distributed shape. Evaluate the average number of messages exchanged by peers 0,1,2,3,… hop away from the topology change. Average these numbers over a large set of experiments

Agent Group Università di Modena e Reggio Emilia Results Locality scopes emerge in a network without predefined boundaries. Network topology changes do not affect far nodes, but tend to remain confined …sign of scalability

Agent Group Università di Modena e Reggio Emilia Other Already Implemented Applications More motion coordination Routing in MANET Location based access to information Content based routing (DHT) Modular Robot Control Algorithms

Agent Group Università di Modena e Reggio Emilia On Going and Future Directions Conduct other experiments on performances Develop more applications, trying to move beyond motion coordination Develop global programming languages and compiler to automatically obtain single agents code: –Amorphous Computer (MIT) or Spatial Programming (Rutgers Univ.)

Agent Group Università di Modena e Reggio Emilia Further Info