How Do Mobile Agents Benefit from Randomness?

DOI10.1007/978-3-030-91081-5_7MaRDI QIDQ6488433zbMATH OpenFDO

Authors Pierre Fraigniaud

Publication date 21 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-91081-5_7

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Randomized mobile agent based routing in wireless networks
• Dispersion of mobile robots: the power of randomness
• scientific article; zbMATH DE number 3909433
• An Algorithmic Theory of Mobile Agents
• scientific article; zbMATH DE number 2006602

Cites work

• Ant-Inspired Density Estimation via Random Walks
• Distributed house-hunting in ant colonies
• How many ants does it take to find the food?
• scientific article; zbMATH DE number 7650913 (Why is no real title available?)
• Networks Become Navigable as Nodes Move and Forget
• Searching without communicating: tradeoffs between performance and selection complexity
• Solving the ANTS problem with asynchronous finite state machines
• Space Lower Bounds for Maze Threadability on Restricted Machines
• The ANTS problem

This page was built for publication: How Do Mobile Agents Benefit from Randomness?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488433)