ACG

Towards Dynamic Adaptation of the Differential Majority-Rule Solution of the Double Bridge Problem

In the double-bridge problem, a population of ants seeks to discover the shortest path from to nest to two alternative places with food. For swarmonoids, a collective of small robots which coorperate to achieve a common goal, a solution using the so-called majority rule for the double-bridge problem was recently proposed by Marco Dorigo and co-workers. We explain the setting of the problem and discuss initial steps to generalize the majority-rule solution to a configuration with dynamically changing path lengths. We present a number of schemes and their discrete-time simulation.

Other presentations

Verification of security protocols using Casper and FDR

Published: di 18 december 2001
By Erik de Vink (TUE & CWI)

In presentations.

Security protocols are relatively small and need to be right. One can interpret these protocols as messages exchanged between agents that might be intercepted or altered by an intruder. Therefore, a security protocol can be represented as a system of parallel CSP processes that correspond to the agents and intruder …
read more
Axiomatizing GSOS with termination

Published: di 12 juni 2001
By Erik de Vink (TUE & CWI)

In presentations.

Aceto, Bloom and Vaandrager showed for the GSOS-format how to generate sound and complete axiomatizations. We add to the GSOS-format a notion of termination and adapt the axiomatization technique for this setting. The result is twofold: successful termination and deadlock are treated separately; the resulting axiom systems are in several …
read more

Page 1 / 1

Other presentations

hosted by

social