• Corpus ID: 38858751

SPARTA : Fast global planning of collision-avoiding robot trajectories

@inproceedings{Mathy2015SPARTAF,
  title={SPARTA : Fast global planning of collision-avoiding robot trajectories},
  author={Charles Mathy and Felix Gonda and Dan Schmidt and Nate Derbinsky and Alexander A. Alemi and Jos{\'e} Bento and Francesco Maria Delle Fave and Jonathan S. Yedidia},
  year={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… 

Figures from this paper

Exact inference under the perfect phylogeny model
TLDR
ExACT is a tool that can explore the space of all possible phylogenetic trees, and performs exact inference under the PPM with noisy data, and allows users to obtain not just the most-likely tree for some input data, but exact statistics about the distribution of trees that might explain the data.
Estimating Cellular Goals from High-Dimensional Biological Data
TLDR
The first approach to estimating constraint reactions from data that can scale to realistically large metabolic models is developed and recovered, enabling accurate prediction of metabolic states in hundreds of growth environments not seen in training data.

References

SHOWING 1-10 OF 14 REFERENCES
Motion Planning in Dynamic Environments Using Velocity Obstacles
This paper presents a method for robot motion planning in dynamic environments. It consists of selecting avoidance maneuvers to avoid static and moving obstacles in the velocity space, based on the
Proximal Operators for Multi-Agent Path Planning
TLDR
New operators to deal with agents moving in arbitrary dimensions that are faster to compute than their 2D predecessors are introduced and landmarks, space-time positions that are automatically assigned to the set of agents under different optimality criteria are introduced.
Randomized Kinodynamic Planning
This paper presents the first randomized approach to kinodynamic planning (also known as trajectory planning or trajectory design). The task is to determine control inputs to drive a robot from an
A message-passing algorithm for multi-agent trajectory planning
TLDR
A novel approach for computing collision-free global trajectories for p agents with specified initial and final configurations, based on an improved version of the alternating direction method of multipliers (ADMM), which allows for incorporating different cost functionals with only minor adjustments.
Reciprocal collision avoidance for multiple car-like robots
TLDR
The proposed algorithm, bicycle reciprocal collision avoidance (B-ORCA), builds on the concept of optimal reciprocal collisions avoidance (ORCA) for holonomic robots but furthermore guarantees collision-free motions under the kinematic constraints of car-like vehicles.
Rapidly-exploring random trees : a new tool for path planning
We introduce the concept of a Rapidly-exploring Random Tree (RRT) as a randomized data structure that is designed for a broad class of path planning problems. While they share many of the bene cial
Collision avoidance for multiple agents with joint utility maximization
In this paper a centralized method for collision avoidance among multiple agents is presented. It builds on the velocity obstacle (VO) concept and its extensions to arbitrary kino-dynamics and is
Mixed-integer quadratic program trajectory generation for heterogeneous quadrotor teams
TLDR
An algorithm for the generation of optimal trajectories for teams of heterogeneous quadrotors in three-dimensional environments with obstacles in mixed-integer quadratic programs where the integer constraints are used to enforce collision avoidance.
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
TLDR
An SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems is discussed.
An Improved Three-Weight Message-Passing Algorithm
We describe how the powerful "Divide and Concur" algorithm for constraint satisfaction can be derived as a special case of a message-passing version of the Alternating Direction Method of Multipliers
...
1
2
...