Mobile Agent Rendezvous in a Synchronous Torus | Zendy

Evangelos Kranakis | Zendy; Danny Kriz̧anc | Zendy; Ευριπίδης Μάρκου | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Mobile Agent Rendezvous in a Synchronous Torus

Author(s) -

Evangelos Kranakis,

Danny Kriz̧anc,

Ευριπίδης Μάρκου

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-32755-X

DOI - 10.1007/11682462_60

Subject(s) - rendezvous , security token , computer science , torus , constant (computer programming) , mobile agent , mathematics , computer network , physics , geometry , programming language , astronomy , spacecraft

We consider the rendezvous problem for identical mobile agents (i.e., running the same deterministic algorithm) with tokens in a synchronous torus with a sense of direction and show that there is a striking computational dierence between one and more tokens. More specifically, we show that 1) two agents with a constant number of unmovable tokens, or with one movable token

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research