• Corpus ID: 6283479

Distributed Computing on the Move: From mobile computing to cooperative robotics and nanorobotics

  title={Distributed Computing on the Move: From mobile computing to cooperative robotics and nanorobotics},
  author={X. D{\'e}fago},
Distributed computing is beginning to extend its scope to address problems relevant to a mobile environment (mobile computing). For the most part, current research efforts in mobile computing and ad hoc networking are implicitly aimed at mobile telephony and the emerging field of ubiquitous computing. More generally, this paper considers distributed computing environments in which hosts are (physically) mobile. The paper essentially advocates the integration into the picture of other important… 
Looking for a common view for mobile worlds
This paper considers central issues of distributed computing in a mobile environment and claims that the next logical step in building a common view is to design a model which conceptually should unify systems by providing an abstract description of the parameters which distinguish these systems from classic distributed systems.
Fail-safe mobility management and collision prevention platform for cooperative mobile robots with asynchronous communications
The main contribution of this dissertation is providing a motion coordination platform that makes a system of mobile robots fail-safe independently of timeliness properties of the system, and analyzes the performance of the protocols.
A distributed algorithm for the coordination of dynamic barricades composed of autonomous mobile robots
2 , 1 PRESTO, Japan Science and Technology Agency (JST) Abstract: In this paper, we study the distributed coordination of a set of synchronous, anonymous, memoryless mobile robots that can freely
Distributed coordination of a set of autonomous mobile robots
The distributed coordination and control of a set of autonomous mobile robots is a problem widely studied in a variety of fields, such as engineering, artificial intelligence, artificial life,
Using an Alternative Model in a Complex Environment for Nanorobotics Navigation
Advances in nanotechnology have opened the space: exploration of unaccessible environments, microsurgery, and nanorobotics, with these advances come a growing need to develop control strategies
Distributed protocols for asynchronous cooperative mobile robots
This work considers a distributed system composed of cooperative autonomous mobile robots executing tasks provided by a user application that necessitates the presence of a deterministic distributed protocols, which guarantee that no collision can occur between robots while moving towards their goals.
Evolutionary and Adaptive Systems Msc. Animal and Machine Intelligence Report
When is many better than one? An examination of cooperative and social animal behaviour and the pros and cons of collective robotics. " Many hands make light work. " " Too many cooks spoil the broth.
Implementation of Distributed Mosaic Formation and Object Detection in Modular Robotic Systems
This research builds on the efficient use of these dis- tributed processing resources and presents the manner these resources can be utilised to implement distributed mosaic formation and object detection within the organism.
Circle formation for oblivious anonymous mobile robots with no common sense of orientation
A distributed algorithm by which a collection of mobile robots roaming on a plane move to form a circle is proposed by which robots are unable to recall past actions and observations and share no common sense of direction.
NASCENT: network layer service for vicinity ad-hoc groups
  • Jun Luo, J. Hubaux
  • Computer Science
    2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004.
  • 2004
It is argued that, since distributed services require group-oriented communications, the NASCENT approach can achieve both design simplicity and runtime efficiency in VAGs, and it is shown that NASCENT greatly improves the runtime efficiency of these distributed algorithms.


A Free Market Architecture for Distributed Control of a Multirobot System
This work introduces a novel economic approach for coordinating robots based on the free market system and initial simulation results indicate the approach is successful at producing effective global plans for a team of several robots performing an interior sensing task.
Choosing good paths for fast distributed reconfiguration of hexagonal metamorphic robots
  • J. Walter, E. Tsai, N. Amato
  • Mathematics, Computer Science
    Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)
  • 2002
A combination graph traversal-weighting algorithm that traverses all paths in the rooted DAG and use this algorithm to determine the best substrate path to result in fast parallel reconfiguration of a metamorphic robot system.
Fundamental control algorithms in mobile networks
This work provides a new and very efficient protocol for counting the number of mobile hosts and provides a simple but very efficient Compulsory (forced random walks) Las Vegas protocol for leader election in ad-hoc networks.
Ant-like task allocation and recruitment in cooperative robots
It is shown that the general principles regulating division of labour in ant colonies indeed allow the design of flexible, robust and effective robotic systems.
Architecture for group communication in mobile systems
  • R. Prakash, R. Baldoni
  • Computer Science
    Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)
  • 1998
The paper identifies the issues a group communication service has to take into account in order to handle node mobility, including the need to identify the location of a node, and the ability to cope with inaccuracies in the determination of a group membership.
Collective Intelligence for Control of Distributed Dynamical Systems
A mathematical theory for such configuration applicable when (as in the bar problem) the global goal can be expressed as minimizing a global energy function and the nodes can be express as minimizers of local free energy functions is summarized.
Leader election algorithms for mobile ad hoc networks
Two new leader election algorithms for mobile ad hoc networks that ensure that eventually each connected component of the topology graph has exactly one leader are presented.
NASA's JPL Nanorover Outposts Project Develops Colony of Solar-Powered Nanorovers
JPL's Nanorover Outposts Project is discussed, which is developing a colony of solar-powered nanorovers with the idea of one day excavating surface areas of Mars, and may literally lay the groundwork for human settlements to come.
Never lost, never forgotten
It is predicted that nanotechnology and novel modulation techniques, as well as the simple density of deployment of 4th or 5th generation wireless networks, will allow us to dispense with external devices altogether, and people will learn to exercise new senses and limbs able to communicate over a distance (almost as if possessing telepathy) with other people, and with objects around them.
Geocasting in mobile ad hoc networks: location-based multicast algorithms
  • Young-Bae Ko, N. Vaidya
  • Computer Science
    Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
  • 1999
The paper addresses the problem of geocasting in mobile ad hoc network (MANET) environments by presenting two different algorithms for delivering packets to a multicast group, and presenting simulation results.