Movement control algorithms for realization of fault-tolerant ad hoc robot networks

  title={Movement control algorithms for realization of fault-tolerant ad hoc robot networks},
  author={Prithwish Basu and Jason Redi},
  journal={IEEE Network},
Autonomous and semi-autonomous mobile multirobot systems require a wireless communication network in order to communicate with each other and collaboratively accomplish a given task. A multihop communications network that is self-forming, self-healing, and self-organizing is ideally suited for such mobile robot systems that exist in unpredictable and constantly changing environments. However, since every node in a multihop (or ad hoc) network is responsible for forwarding packets to other nodes… 

Figures from this paper

Movemeni Control Algoriihms for Rea Iiza iion of Fa u //-To /era n / Ad Hoc Robot Networks
A few simple algorithms for achieving the baseline graph theoretic metric o PP to erance to node failures, namely, biconnectivity are presented, and an optimization problem for the creation of a movement plan minimizing the total distance moved by the robots is formulated.
Connectivity maintenance by robotic Mobile Ad-hoc NETwork
To study the problem, a distributed multi-robot system with wifi communication capabilities has been developed and used to implement a Mobile Ad-hoc NETwork (MANET) to guarantee the required multi-hop communication.
A localized algorithm for bi-connectivity of connected mobile robots
This work presents the first localized protocol for constructing a fault-tolerant bi-connected robotic network topology from a connected network, in such a way that the total movement of robots is minimized.
Fault-tolerant topology control algorithm for mobile robotic networks
This work studies the problem of fault-tolerant topology control in mobile robotic networks, with the aim of constructing self-healing networks, and proposes a K-connectedTopology control algorithm that can cope with faults such as node failures and link disruptions.
Enforcing Network Connectivity in Robot Team Missions
A multi-robot cooperative motion control technique based on a virtual spring—damper model, a task allocation algorithm that takes advantage of network link information in order to ensure autonomous mission completion, and a network layer which works over wireless 802.11 devices, capable of sustaining hard real-time traffic and changing topologies are contributed.
Communication-assisted topology control for autonomous unmanned systems
This paper proposes a cross layer design-based control layer algorithm that finds and maintains stable links among the mobile nodes and the main controller, and shows that the algorithm guarantees permanent node connectivity with minimum overhead.
Relay Placement and Movement Control for Realization of Fault-Tolerant Ad Hoc Networks
This work proposes algorithms for minimizing the number of additional nodes required and the distance they need to move for construction of a topology with desired levels of fault-tolerance and shows that these algorithms perform much better than an algorithm that does not take minimizing the movement of additional node into account.
Distributed mobility control for fault-tolerant mobile networks
  • Jie Lin
  • Computer Science
    2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)
  • 2005
A provably correct distributed rendezvous algorithm to achieve both goals by making the underlying communication graph biconnected and works both synchronously and asynchronously.
Localized Movement Control for Fault Tolerance of Mobile Robot Networks
In this paper, we present a novel localized movement control algorithm to form a fault-tolerant bi-connected robotic network topology from a connected network, such that total distance of movement of
Communication network discovery and leader selection strategies for multi-robot deployments
A combination of Lévy walks, past path memory and convex hull concepts are used to develop an efficient hybrid model that allows the robots to escape from no-network areas and results are presented that show the superiority of the hybrid model in establishing connectivity with the base station.


Distributed Sensing and Data Collection via Broken Ad Hoc Wireless Connected Networks of Mobile Robots
The paper concludes that in mission scenarios that do not require data collection in real-time and where occasional data loss is acceptable, then the proposed data collection mechanism is feasible, robust and economical in terms of the number of robots required.
Topology control of multihop wireless networks using transmit power adjustment
  • R. Ramanathan, R. Hain
  • Computer Science
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
This work considers the problem of adjusting the transmit powers of nodes in a multihop wireless network as a constrained optimization problem with two constraints-connectivity and biconnectivity, and one optimization objective-maximum power used.
Sending messages to mobile users in disconnected ad-hoc wireless networks
This paper develops algorithms that minimize the trajectory modifications under two different assumptions: (a) the movements of all the nodes in the system are known and (b) the Moves of the hosts in the System are not known.
The application of wireless local area network technology to the control of mobile robots
Optimized Link State Routing Protocol (OLSR)
The Optimized Link State Routing protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN and provides optimal routes (in terms of number of hops).
Making link-state routing scale for ad hoc networks
A novel perspective on the "overhead" of a protocol that includes not only the overhead due to control messages but also due to route sub-optimality is presented, and an analytical model whose solution automatically leads to the best algorithm in this class is formed.
The Optimized Link State Routing Protocol
Urethane prepolymer compositions are made from 1-isocyanato-3-isocyanatomethyl-3,5,5-trimethyl cyclohexane and polyols at a total NCO to OH ratio of at least 1.2:1, and the prepolymers are reacted
An iterative linear programming solution to the Euclidean regression model
Graph Theory
Gaph Teory Fourth Edition is standard textbook of modern graph theory which covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each chapter by one or two deeper results.
Most of the articles appearing in this column are oriented toward Common Lisp. However, a wider community of Lisp dialects still exists. One that is of particular interest is GNU Emacs Lisp---the