Priority-based coordination of robots

20 pagesThis paper addresses the problem of coordinating multiple robots travelling through an intersection along fixed paths with positive velocities and kinodynamic constraints. The approach relies on a novel tool: a priority graph that encodes the relative order of the robots at the intersection. The overall planning approach can be decomposed into two key components as follows. The entry of robots into the intersection is managed by an intersection controller that assigns priorities. Within the intersection area, robots are controlled by a control law that preserves assigned priorities, avoids collisions, and is robust to unexpected decelerations of some robots occurring randomly

Robot coordination using task-priority and sliding-mode techniques

In this work, an approach based on task-priority redundancy resolution and sliding mode ideas is proposed for robot coordination. In particular, equality and inequality constraints representing the coordination of the multi-robot system are considered as mandatory (for instance, rigid-body manipulation constraints to distance between the end-effectors of several robot arms, or other inequality constraints guaranteeing safe operation of a robotic swarm or confining the robot's workspace to avoid collision and joint limits). Besides the mandatory constraints, other constraints with lower priority are considered for the tracking of the workspace reference and to achieve secondary goals. Thus, lower-priority constraints are satisfied only in the null space of the higherpriority ones. The fulfillment of the constraints is achieved using geometric invariance and sliding mode control theory. The validity and effectiveness of the proposed approach is substantiated by 2D and 3D simulation results using two 3R planar robots and two 6R PUMA-762 robots, respectively.This work was supported in part by research under Project DPI2011-27845-C02-01 of the Spanish Government and Projects ANPCyT PICT-2011-0888, CONICET PIP 112-2011-00361 and UNLP 1164 in Argentina.Gracia Calandin, LI.; Sala Piqueras, A.; Garelli, F. (2014). Robot coordination using task-priority and sliding-mode techniques. Robotics and Computer-Integrated Manufacturing. 30(1):74-89. https://doi.org/10.1016/j.rcim.2013.08.003S748930

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

Priority-based intersection management with kinodynamic constraints

We consider the problem of coordinating a collection of robots at an intersection area taking into account dynamical constraints due to actuator limitations. We adopt the coordination space approach, which is standard in multiple robot motion planning. Assuming the priorities between robots are assigned in advance and the existence of a collision-free trajectory respecting those priorities, we propose a provably safe trajectory planner satisfying kinodynamic constraints. The algorithm is shown to run in real time and to return safe (collision-free) trajectories. Simulation results on synthetic data illustrate the benefits of the approach.Comment: to be presented at ECC2014; 6 page

Time-optimal Coordination of Mobile Robots along Specified Paths

In this paper, we address the problem of time-optimal coordination of mobile robots under kinodynamic constraints along specified paths. We propose a novel approach based on time discretization that leads to a mixed-integer linear programming (MILP) formulation. This problem can be solved using general-purpose MILP solvers in a reasonable time, resulting in a resolution-optimal solution. Moreover, unlike previous work found in the literature, our formulation allows an exact linear modeling (up to the discretization resolution) of second-order dynamic constraints. Extensive simulations are performed to demonstrate the effectiveness of our approach.Comment: Published in 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS