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 D. Schmidt and Nate Derbinsky and Alexander Amir Alemi and Jos{\'e} Bento and F. D. Fave and Jonathan S. Yedidia},
  • C. Mathy, Felix Gonda, +5 authors Jonathan S. Yedidia
  • Published 2015
  • 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… CONTINUE READING
    2 Citations

    Figures from this paper.

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


    Motion Planning in Dynamic Environments Using Velocity Obstacles
    • 1,298
    • PDF
    Proximal Operators for Multi-Agent Path Planning
    • 13
    • PDF
    Randomized Kinodynamic Planning
    • 1,686
    A message-passing algorithm for multi-agent trajectory planning
    • 34
    • PDF
    Reciprocal collision avoidance for multiple car-like robots
    • 100
    • PDF
    Collision avoidance for multiple agents with joint utility maximization
    • 8
    Mixed-integer quadratic program trajectory generation for heterogeneous quadrotor teams
    • 180
    SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
    • 2,749
    • PDF
    An Improved Three-Weight Message-Passing Algorithm
    • 41
    • PDF
    Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
    • 11,424
    • Highly Influential
    • PDF