From drinking philosophers to asynchronous path-following robots
From MaRDI portal
Abstract: In this paper, we consider the multi-robot path execution problem where a group of robots move on predefined paths from their initial to target positions while avoiding collisions and deadlocks in the face of asynchrony. We first show that this problem can be reformulated as a distributed resource allocation problem and, in particular, as an instance of the well-known Drinking Philosophers Problem (DrPP). By careful construction of the drinking sessions capturing shared resources, we show that any existing solutions to DrPP can be used to design robot control policies that are collectively collision and deadlock-free. We then propose modifications to an existing DrPP algorithm to allow more concurrent behavior, and provide conditions under which our method is deadlock-free. Our method does not require robots to know or to estimate the speed profiles of other robots and results in distributed control policies. We demonstrate the efficacy of our method on simulation examples, which show competitive performance against the state-of-the-art.
Recommendations
Cites work
- A distributed approach to robust control of multi-robot systems
- A distributed method to avoid higher-order deadlocks in multi-robot systems
- A distributed protocol for motion coordination in free-range vehicular systems
- A modular drinking philosophers algorithm
- Finding All the Elementary Circuits of a Directed Graph
- Reciprocal n-body collision avoidance
- Safety Verification and Control for Collision Avoidance at Road Intersections
- Solving Coverage Problems with Embedded Graph Grammars
This page was built for publication: From drinking philosophers to asynchronous path-following robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163978)
