16,423 research outputs found
Collision-aware Task Assignment for Multi-Robot Systems
We propose a novel formulation of the collision-aware task assignment (CATA)
problem and a decentralized auction-based algorithm to solve the problem with
optimality bound. Using a collision cone, we predict potential collisions and
introduce a binary decision variable into the local reward function for task
bidding. We further improve CATA by implementing a receding collision horizon
to address the stopping robot scenario, i.e. when robots are confined to their
task location and become static obstacles to other moving robots. The
auction-based algorithm encourages the robots to bid for tasks with collision
mitigation considerations. We validate the improved task assignment solution
with both simulation and experimental results, which show significant reduction
of overlapping paths as well as deadlocks
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
Bounded Distributed Flocking Control of Nonholonomic Mobile Robots
There have been numerous studies on the problem of flocking control for
multiagent systems whose simplified models are presented in terms of point-mass
elements. Meanwhile, full dynamic models pose some challenging problems in
addressing the flocking control problem of mobile robots due to their
nonholonomic dynamic properties. Taking practical constraints into
consideration, we propose a novel approach to distributed flocking control of
nonholonomic mobile robots by bounded feedback. The flocking control objectives
consist of velocity consensus, collision avoidance, and cohesion maintenance
among mobile robots. A flocking control protocol which is based on the
information of neighbor mobile robots is constructed. The theoretical analysis
is conducted with the help of a Lyapunov-like function and graph theory.
Simulation results are shown to demonstrate the efficacy of the proposed
distributed flocking control scheme
- …