Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
413513 | Robotics and Autonomous Systems | 2009 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Stefano Carpin, Enrico Pagello,