# Proximal Operators for Multi-Agent Path Planning

@article{Bento2015ProximalOF, title={Proximal Operators for Multi-Agent Path Planning}, author={Jos{\'e} Bento and Nate Derbinsky and Charles Mathy and Jonathan S. Yedidia}, journal={ArXiv}, year={2015}, volume={abs/1504.01783} }

We address the problem of planning collision-free paths for multiple agents using optimization methods known as proximal algorithms. Recently this approach was explored in Bento et al. 2013, which demonstrated its ease of parallelization and decentralization, the speed with which the algorithms generate good quality solutions, and its ability to incorporate different proximal operators, each ensuring that paths satisfy a desired property. Unfortunately, the operators derived only apply to paths…

## Figures from this paper

## 13 Citations

SPARTA : Fast global planning of collision-avoiding robot trajectories

- Computer Science
- 2015

This work presents an algorithm for obtaining collision-avoiding robot trajectories called SPARTA (SPline-based ADMM for Robot Trajectory Avoidance), using a recently developed generalization of ADMM, the Three Weight Algorithm, which can be elegantly understood as a message passing algorithm.

Improved Ant Colony Algorithms for Multi-agent Path Planning in Web3D Environment

- Computer Science
- 2017

Two kinds of ant colony algorithms and a leader idea to solve the path planning in 3D large-scale scenes are improved and a concept of vertebral visual area is put forward, which accelerates the speed of path finding in looking for the next node locked area.

Resolving Spatial-Time Conflicts In A Set Of Any-angle Or Angle-constrained Grid Paths

- Computer ScienceArXiv
- 2016

This work proposes an algorithm that eliminates conflicts by using local re-planning and introducing time offsets to the execution of paths by different agents, which can find high quality conflict-free solutions at low computational cost.

IFC-based Improved ACO for Multi-agent Path Planning in Web3D Mountain Environment

- Computer ScienceICCAE '17
- 2017

A kind of method using an improved ant colony algorithm to find path for multi-agent in Web3D environment using HTML5 and an improved leader-follower method is used to organize the Blue army soldiers to attach the Red army soldiers.

SI-Based mACO Multi-Agent Path Planning in Web3D Mountain Battle Scenes

- Computer Science2016 International Conference on Virtual Reality and Visualization (ICVRV)
- 2016

A series of solutions proposed inhere: abstracting the mountain information including ray stone, round wood, entrenchment, bamboo nails trap and the fire power semantic information, then mapping every weapon's destruction value into every mountain terrain and use the value to compute the pheromones, which will be reused in the process of path planning.

m2ACO: Multi-agent Path Planning Algorithm for Web3D Mountain Scenario

- Computer Science
- 2017

The paper proposed an m2ACO (multi-agent in mountain environment using ACO) algorithm for multi-agent path planning in Web3D technology and the experimental results show that the m2 ACO is more accurate than the other kinds of path planning algorithms.

Distributed Optimization, Averaging via ADMM, and Network Topology

- Computer Science, MathematicsProceedings of the IEEE
- 2020

Different algorithms when applied to a canonical distributed averaging consensus problem are compared and interesting connections between ADMM and the lifted Markov chains are shown besides providing an explicit characterization of its convergence and optimal parameter tuning in terms of spectral properties of the network.

Efficient Projection onto the Perfect Phylogeny Model

- Computer ScienceNeurIPS
- 2018

This paper uses Moreau's decomposition for proximal operators, and a tree reduction scheme, to develop a new algorithm to compute a projection problem that assigns a fitness cost to phylogenetic trees.

Efficient Projection onto the Perfect Phylogeny Model

- Computer Science
- 2018

This paper uses Moreau’s decomposition for proximal operators, and a tree reduction scheme, to develop a new algorithm to compute a projection problem that assigns a fitness cost to phylogenetic trees.

Efficient Projection onto the Perfect Phylogeny Model

- Computer Science
- 2018

This paper uses Moreau’s decomposition for proximal operators, and a tree reduction scheme, to develop a new algorithm to compute a projection problem that assigns a fitness cost to phylogenetic trees.

## References

SHOWING 1-10 OF 36 REFERENCES

A message-passing algorithm for multi-agent trajectory planning

- Computer ScienceNIPS
- 2013

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.

Collision avoidance for multiple agents with joint utility maximization

- MathematicsICRA 2013
- 2013

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…

The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding

- Computer ScienceIJCAI
- 2011

A number of optional pruning techniques that can significantly speed up the goal test of ICTS, the novel two-level search algorithm framework for multiple agents, are introduced.

Randomized preprocessing of configuration for fast path planning

- Computer ScienceProceedings of the 1994 IEEE International Conference on Robotics and Automation
- 1994

This paper presents a new approach to path planning for robots with many degrees of freedom (DOF) operating in known static environments that is particularly attractive for many-DOF robots which have to perform many successive point-to-point motions in the same environment.

Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces

- Computer Science
- 1996

Experimental results show that the proposed roadmap method can eeciently solve problems which are beyond the capabilities of other existing methods.

Complete Algorithms for Cooperative Pathfinding Problems

- Computer ScienceIJCAI
- 2011

This work presents the first complete algorithm for finding cooperative pathfinding paths that is sufficiently fast for real-time applications and offers a trade-off between running time and solution quality.

Distributed multi-robot task assignment and formation control

- Computer Science2008 IEEE International Conference on Robotics and Automation
- 2008

This work addresses the challenge of distributed task assignment for multiple agents using market-based coordination protocols where the agents are able to bid for task assignment with the assumption that every agent has knowledge of the maximum number of agents that any given task can accommodate.

The increasing cost tree search for optimal multi-agent pathfinding

- Computer ScienceArtif. Intell.
- 2011

Motion Planning in Dynamic Environments Using Velocity Obstacles

- EngineeringInt. J. Robotics Res.
- 1998

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…

Incremental Sampling-based Algorithms for Optimal Motion Planning

- Computer ScienceRobotics: Science and Systems
- 2010

A new algorithm is considered, called the Rapidly-exploring Random Graph (RRG), and it is shown that the cost of the best path returned by RRG converges to the optimum almost surely, and a tree version of RRG is introduced, called RRT∗, which preserves the asymptotic optimality ofRRG while maintaining a tree structure like RRT.