• Corpus ID: 14477557

Analysis and implementation of distributed algorithms for multi-robot systems

  title={Analysis and implementation of distributed algorithms for multi-robot systems},
  author={James McLurkin},
Distributed algorithms for multi-robot systems rely on network communications to share information. However, the motion of the robots changes the network topology, which affects the information presented to the algorithm. For an algorithm to produce accurate output, robots need to communicate rapidly enough to keep the network topology correlated to their physical configuration. Infrequent communications will cause most multi-robot distributed algorithms to produce less accurate results, and… 

Time scales and stability in networked multi-robot systems

This paper examines the dynamic interplay between decentralized controllers and mesh networking protocols for controlling groups of robots and shows that systems made up of robots with stable first order dynamics are stable for all network update times, positive feedback gains, and connected communication graphs.

Distributed Path Planning for Collective Transport Using Homogeneous Multi-robot Systems

This work presents a scalable distributed path planning algorithm for transporting a large object through an unknown environment using a group of homogeneous robots and sets up a framework that allows the user to balance the trade-off between the safety of the path and the mechanical work required to move the object.

Distributed deformable configuration control for multi-robot systems with low-cost platforms

A fully distributed algorithm that allows multiple robots to deform their configuration to avoid various shapes of obstacles while maintaining connectivity and provides theoretical analysis about maintaining connectivity while robots are avoiding an obstacle.

Distributed centroid estimation and motion controllers for collective transport by multi-robot systems

Four distributed motion controllers are presented to enable a group of robots to collectively transport an object towards a guide robot, and it is shown that the error of the centroid estimation is low, and that all four controllers produce reliable motion of the object.

Agreement on stochastic multi-robot systems with communication failures

This work presents a practical agreement algorithm, input-based consensus (IBC), that produces bounded error and recovery in the face of significant communications failures in a stochastic distributed system.

Scale-free coordinates for multi-robot systems with bearing-only sensors

This work derives a precise mathematical characterization of the computability of scale-free coordinates using only bearing measurements, and describes an efficient algorithm to obtain them that is tailored to low-cost systems with limited communication bandwidth and sensor resolution.

K-Redundant Trees for Safe and Efficient Multi-robot Recovery in Complex Environments

This paper presents a self-stabilizing distributed algorithm to recover a large number of robots safely and efficiently in a goal location that provides k-connectivity in the network, meaning that each robot is connected to the goal location through k trees.

Maximum-Leaf Spanning Trees for Efficient Multi-Robot Recovery with Connectivity Guarantees

This paper presents a self-stabilizing distributed algorithm for the recovery of a large population of robots in a complex environment—that is, to gather them all in a goal location, and presents empirical results on the competitive ratio of the DMLST.

Multi-Robot Foraging for Swarms of Simple Robots

A method is developed by which the swarm as a whole can choose its algorithm based on the home–target separation it encounters, and the feasibility of running these algorithms on physical robots is considered.

Ad Hoc Network-Based Task Allocation With Resource-Aware Cost Generation for Multirobot Systems

A decentralized MRTA approach considering the robots' residual expendable resources and their limited communication ranges that minimization of unnecessary task performance cost caused by resource shortage of robots during task execution and the use of an ad hoc network among the robots to allow more robots to participate in the task allocation process.

Distributed multirobot localization

The distributed localization algorithm is applied to a group of three robots and the improvement in localization accuracy is presented and a comparison to the equivalent decentralized information filter is provided.

A Probabilistic Approach to Collaborative Multi-Robot Localization

This paper uses a sample-based version of Markov localization, capable of localizing mobile robots in an any-time fashion, to demonstrate drastic improvements in localization speed and accuracy when compared to conventional single-robot localization.

Consensus and Cooperation in Networked Multi-Agent Systems

This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in

Coverage, Exploration and Deployment by a Mobile Robot and Communication Network

An efficient minimalist algorithm which assumes that global information is not available is presented which deploys a network of radio beacons which assists the robot in coverage and also used by the robot for navigation.

Dynamic Task Assignment in Robot Swarms

This paper presents four distributed algorithms for assigning swarms of homogenous robots to subgroups to meet a specified global task distribution, and implements the algorithms on a group of 25 iRobot SwarmBots.

The Analysis of an Efficient Algorithm for Robot Coverage and Exploration based on Sensor Network Deployment

    M. BatalinG. Sukhatme
    Computer Science
    Proceedings of the 2005 IEEE International Conference on Robotics and Automation
  • 2005
The design and theoretical analysis of a novel algorithm (LRV) that efficiently solves the problems of coverage, exploration and sensor network deployment at the same time and formally establishes the following two properties: LRV is complete on graphs, andLRV is optimal on trees.

Achieving connectivity through coalescence in mobile robot networks

This paper analyzes coalescence time for a worst-case scenario where the robots do not have any knowledge about the environment or positions of other robots and perform independent, memoryless search and shows that coalescent time has an exponential distribution which is a function of the number of robots, speed, communication range, and size of the domain.

Interference as a Tool for Designing and Evaluating Multi-Robot Controllers

It is explored how key issues in multi-robot control can be addressed using interference, a directly measurable property of a multi- robot system.

Control of changes in formation for a team of mobile robots

An algorithm that allows the team of robots to move between any two formations, while avoiding obstacles is described, derived from optimal control theory.

Collective construction with multiple robots

Results show that with minimal inter-robot communication (1 bit of state), there is a significant improvement in the system performance, and this improvement is invariant with respect to the size of the environment.