13,470 research outputs found
Coordination of several robots based on temporal synchronization
© 2016. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/This paper proposes an approach to deal with the problem of coordinating multi-robot systems, in which each robot executes individually planned tasks in a shared workspace. The approach is a decoupled method that can coordinate the participating robots in on-line mode. The coordination is achieved through the adjustment of the time evolution of each robot along its original planned geometric path according to the movements of the other robots to assure a collision-free execution of their respective tasks. To assess the proposed approach different tests were performed in graphical simulations and real experiments.Postprint (published version
Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning
We present a sampling-based framework for multi-robot motion planning which
combines an implicit representation of a roadmap with a novel approach for
pathfinding in geometrically embedded graphs tailored for our setting. Our
pathfinding algorithm, discrete-RRT (dRRT), is an adaptation of the celebrated
RRT algorithm for the discrete case of a graph, and it enables a rapid
exploration of the high-dimensional configuration space by carefully walking
through an implicit representation of a tensor product of roadmaps for the
individual robots. We demonstrate our approach experimentally on scenarios of
up to 60 degrees of freedom where our algorithm is faster by a factor of at
least ten when compared to existing algorithms that we are aware of.Comment: Kiril Solovey and Oren Salzman contributed equally to this pape
On the hardness of unlabeled multi-robot motion planning
In unlabeled multi-robot motion planning several interchangeable robots
operate in a common workspace. The goal is to move the robots to a set of
target positions such that each position will be occupied by some robot. In
this paper, we study this problem for the specific case of unit-square robots
moving amidst polygonal obstacles and show that it is PSPACE-hard. We also
consider three additional variants of this problem and show that they are all
PSPACE-hard as well. To the best of our knowledge, this is the first hardness
proof for the unlabeled case. Furthermore, our proofs can be used to show that
the labeled variant (where each robot is assigned with a specific target
position), again, for unit-square robots, is PSPACE-hard as well, which sets
another precedence, as previous hardness results require the robots to be of
different shapes
Research and development at ORNL/CESAR towards cooperating robotic systems for hazardous environments
One of the frontiers in intelligent machine research is the understanding of how constructive cooperation among multiple autonomous agents can be effected. The effort at the Center for Engineering Systems Advanced Research (CESAR) at the Oak Ridge National Laboratory (ORNL) focuses on two problem areas: (1) cooperation by multiple mobile robots in dynamic, incompletely known environments; and (2) cooperating robotic manipulators. Particular emphasis is placed on experimental evaluation of research and developments using the CESAR robot system testbeds, including three mobile robots, and a seven-axis, kinematically redundant mobile manipulator. This paper summarizes initial results of research addressing the decoupling of position and force control for two manipulators holding a common object, and the path planning for multiple robots in a common workspace
Motion coordination and programmable teleoperation between two industrial robots
Tasks for two coordinated industrial robots always bring the robots in contact with a same object. The motion coordination among the robots and the object must be maintained all the time. To plan the coordinated tasks, only one robot's motion is planned according to the required motion of the object. The motion of the second robot is to follow the first one as specified by a set of holonomic equality constraints at every time instant. If any modification of the object's motion is needed in real-time, only the first robot's motion has to be modified accordingly in real-time. The modification for the second robot is done implicitly through the constraint conditions. Thus the operation is simplified. If the object is physically removed, the second robot still continually follows the first one through the constraint conditions. If the first robot is maneuvered through either the teach pendant or the keyboard, the second one moves accordingly to form the teleoperation which is linked through the software programming. Obviously, the second robot does not need to duplicate the first robot's motion. The programming of the constraints specifies their relative motions
- …