Fetching the paper…
Reading the bibliography…
We propose an extension to the MAPF formulation, called SocialMAPF, to account for private incentives of agents in constrained environments such as doorways, narrow hallways, and corridor intersections.
D. M. Kornhauser, G. Miller, and P. Spirakis, “Coordinating pebble motion on graphs, the diameter of permutation groups, and applications,” Master’s thesis, M. I. T., Dept. of Electrical Engineering and Computer Science, 1984
1984
Earlier work this paper cites.
D. Silver, “Cooperative pathfinding,” in
2005
Earlier work this paper cites.
P. R. Wurman, R. D’Andrea, and M. Mountz, “Coordinating hundreds of cooperative, autonomous vehicles in warehouses,”
2008
Earlier work this paper cites.
P. Surynek, “A novel approach to path planning for multiple robots in bi-connected graphs,” in
2009
Earlier work this paper cites.
R. Luna and K. E. Bekris, “Efficient and complete centralized multi-robot path planning,” in
2011
Earlier work this paper cites.
Q. Sajid, R. Luna, and K. Bekris, “Multi-agent pathfinding with simultaneous execution of single-agent primitives,” in
2012
Earlier work this paper cites.
G. Sharon, R. Stern, M. Goldenberg, and A. Felner, “The increasing cost tree search for optimal multi-agent pathfinding,”
2013
Earlier work this paper cites.
B. De Wilde, A. W. Ter Mors, and C. Witteveen, “Push and rotate: a complete multi-agent pathfinding algorithm,”
2014
Earlier work this paper cites.
M. Barer, G. Sharon, R. Stern, and A. Felner, “Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,” in
2014
Cited alongside, same era.
M. Veloso, J. Biswas, B. Coltin, and S. Rosenthal, “Cobots: Robust symbiotic autonomous mobile service robots,” in
2015
Cited alongside, same era.
G. Sharon, R. Stern, A. Felner, and N. R. Sturtevant, “Conflict-based search for optimal multi-agent pathfinding,”
2015
Cited alongside, same era.
E. Boyarski, A. Felner, R. Stern, G. Sharon, D. Tolpin, O. Betzalel, and E. Shimony, “Icbs: Improved conflict-based search algorithm for multi-agent pathfinding,” in
2015
Cited alongside, same era.
R. Morris, C. S. Pasareanu, K. Luckow, W. Malik, H. Ma, T. S. Kumar, and S. Koenig, “Planning, scheduling and monitoring for airport surface operations,” in
2016
R. Chandra, T. Guan, S. Panuganti, T. Mittal, U. Bhattacharya, A. Bera, and D. Manocha, “Forecasting trajectory and behavior of road-agents using spectral clustering in graph-lstms,”
2020
Later among the works it cites.
K. Vedder and J. Biswas, “X*: Anytime multi-agent path finding for sparse domains using window-based iterative repairs,”
2021
Later among the works it cites.
K. Zhang, Z. Yang, and T. Başar, “Multi-agent reinforcement learning: A selective overview of theories and algorithms,”
2021
Later among the works it cites.
J. Li, W. Ruml, and S. Koenig, “Eecbs: A bounded-suboptimal search for multi-agent path finding,” in
2021
Later among the works it cites.
A. Mavrogiannis, R. Chandra, and D. Manocha, “B-gap: Behavior-rich simulation and navigation for autonomous driving,”
2022
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
T. Roughgarden,
2016
Cited alongside, same era.
R. Stern, “Multi-agent path finding–an overview,”
2019
Cited alongside, same era.
J. J. Chung, A. J. Smith, R. Skeele, and G. A. Hollinger, “Risk-aware graph search with dynamic edge cost discovery,”
2019
Cited alongside, same era.
2022
Closest in time.
R. Chandra and D. Manocha, “Gameplan: Game-theoretic multi-agent planning with human drivers at intersections, roundabouts, and merging,”
2022
Closest in time.