An experimental study of distributed robot coordination

Authors:
Stefano Carpin;Enrico Pagello
Affiliations:
School of Engineering, University of California, Merced, USA;Department of Information Engineering, University of Padova, Italy
Venue:
Robotics and Autonomous Systems
Year:
2009

Citing 5
Cited 5

Improved Approximation Algorithms for Shop Scheduling Problems

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths

International Journal of Robotics Research
Planning Algorithms

Planning Algorithms
Motion planning using adaptive random walks

IEEE Transactions on Robotics

Fusion of probabilistic A* algorithm and fuzzy inference system for robotic path planning

Artificial Intelligence Review
Evolving robotic path with genetically optimised fuzzy planner

International Journal of Computational Vision and Robotics
Robotic path planning in static environment using hierarchical multi-neuron heuristic search and probability based fitness

Neurocomputing
Multi-robot path planning using co-evolutionary genetic programming

Expert Systems with Applications: An International Journal
Robotic clusters: Multi-robot systems as computer clusters

Robotics and Autonomous Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coordinating the path of multiple robots along assigned paths is a computationally hard problem with great potential for applications. We here provide a detailed experimental study of a randomized algorithm for scheduling priorities that we have developed, and also compare it with exact and approximated solutions. It turns out that for problems of reasonable size our algorithm exhibits an appealing compromise between speed and quality.