Corpus ID: 2462116

Proximal Operators for Multi-Agent Path Planning

@inproceedings{Bento2015ProximalOF,
  title={Proximal Operators for Multi-Agent Path Planning},
  author={Jos{\'e} Bento and Nate Derbinsky and C. Mathy and Jonathan S. Yedidia},
  booktitle={AAAI},
  year={2015}
}
  • José Bento, Nate Derbinsky, +1 author Jonathan S. Yedidia
  • Published in AAAI 2015
  • Computer Science, Engineering, Mathematics
  • 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… CONTINUE READING
    13 Citations
    SPARTA : Fast global planning of collision-avoiding robot trajectories
    • 2
    • PDF
    Resolving Spatial-Time Conflicts In A Set Of Any-angle Or Angle-constrained Grid Paths
    • 1
    • PDF
    SI-Based mACO Multi-Agent Path Planning in Web3D Mountain Battle Scenes
    • F. Yan, J. Jia
    • Computer Science
    • 2016 International Conference on Virtual Reality and Visualization (ICVRV)
    • 2016
    Efficient Projection onto the Perfect Phylogeny Model
    • 1
    • PDF
    Distributed Optimization, Averaging via ADMM, and Network Topology

    References

    SHOWING 1-10 OF 38 REFERENCES
    A message-passing algorithm for multi-agent trajectory planning
    • 34
    • PDF
    Collision avoidance for multiple agents with joint utility maximization
    • 8
    • Highly Influential
    The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding
    • 161
    • PDF
    Randomized preprocessing of configuration for fast path planning
    • L. Kavraki, J. Latombe
    • Computer Science
    • Proceedings of the 1994 IEEE International Conference on Robotics and Automation
    • 1994
    • 445
    • PDF
    Complete Algorithms for Cooperative Pathfinding Problems
    • 147
    • PDF
    Motion Planning in Dynamic Environments Using Velocity Obstacles
    • 1,300
    • PDF
    Distributed multi-robot task assignment and formation control
    • 193
    • PDF
    The increasing cost tree search for optimal multi-agent pathfinding
    • 25
    • PDF
    Incremental Sampling-based Algorithms for Optimal Motion Planning
    • 520
    • PDF