IEEE Access · 2018 · 36 citations · 37 references
ComputingComputer ScienceHigh-performance ComputingRobot ControlRoboticsSwarm RoboticsCollision AvoidanceRobot Motion PlanningTrajectory GenerationTrajectory OptimizationCollision Avoidance In Swarm RoboticsCollision-avoiding TrajectoriesGradient DescentMulti-robot TrajectoriesRobot Trajectory GenerationSwarm Collision AvoidanceTrajectory Planning For Collision AvoidanceUse Cases
As the capabilities of robots and their control systems improve, we see an increasing number of use cases where the simultaneous operation of robots within a space is advantageous. Although trajectories for individual robots can be computed quickly using the existing methods, when robots operate simultaneously and in close proximity, the requirement for collision avoidance introduces a coupling between robot trajectories and makes the trajectory generation problem difficult to solve quickly. In this paper, we propose a parallelizable formulation of such problems and a method for solving them quickly on modern graphics processing units, using momentum-based gradient descent. We demonstrate the proposed framework in simulation using two case studies: a swarm of 200 quadcopters traversing a maze and a fleet of 100 bicycle robots changing their formation. In both the cases, our method requires just seconds to generate feasible, collision-free trajectories for the entire swarm.
37
Adam: A Method for Stochastic Optimization
Diederik P. Kingma, Jimmy Ba · UvA-DARE (University of Amsterdam) · 2014 · 84.8K citations · Full text
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations
Automatic differentiation in PyTorch
Adam Paszke, Sam Gross, Soumith Chintala et al. · 2017 · 11.1K citations
TensorFlow: A system for large-scale machine learning
Martı́n Abadi, Paul Barham, Jianmin Chen et al. · arXiv (Cornell University) · 2016 · 8.8K citations · Full text