Corpus ID: 38858751

SPARTA : Fast global planning of collision-avoiding robot trajectories

  title={SPARTA : Fast global planning of collision-avoiding robot trajectories},
  author={C. Mathy and Felix Gonda and Dan Schmidt and Nate Derbinsky and Alexander Amir Alemi and Jos{\'e} Bento and F. D. Fave and J. Yedidia},
We present an algorithm for obtaining collision-avoiding robot trajectories we call SPARTA (SPline-based ADMM for Robot Trajectory Avoidance). We break the problem of solving for collision-avoiding trajectories of robots into tractable subproblems, using the framework of a recently developed generalization of ADMM, the Three Weight Algorithm. The generated paths are smooth, include physical constraints of the robots, and the convergence speed is such that it becomes feasible for real-time… Expand
2 Citations

Figures from this paper

Exact inference under the perfect phylogeny model
  • PDF
Estimating Cellular Goals from High-Dimensional Biological Data
  • 4


Motion Planning in Dynamic Environments Using Velocity Obstacles
  • 1,360
  • PDF
Proximal Operators for Multi-Agent Path Planning
  • 13
  • PDF
Randomized Kinodynamic Planning
  • 1,644
Reciprocal collision avoidance for multiple car-like robots
  • 103
  • PDF
Collision avoidance for multiple agents with joint utility maximization
  • 8
Mixed-integer quadratic program trajectory generation for heterogeneous quadrotor teams
  • 198
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
  • 2,814
  • PDF
An Improved Three-Weight Message-Passing Algorithm
  • 42
  • PDF
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
  • 12,265
  • Highly Influential
  • PDF