default search action
MAPF@AAAI 2012: Toronto, Ontario, Canada
- Ariel Felner, Nathan R. Sturtevant, Kostas E. Bekris, Roni Stern:
Multiagent Pathfinding, Papers from the 2012 AAAI Workshop, MAPF@AAAI 2012, Toronto, Ontario, Canada, July 22, 2012. AAAI Technical Report WS-12-10, AAAI Press 2012, ISBN 978-1-57735-575-5 - Organizers.
- Preface.
- Shawn Adams, Matthew J. Rutherford:
Towards Decentralized Waypoint Negotiation. - Daman Bareiss, Jur van den Berg:
Reciprocal Collision Avoidance for Quadrotor Helicopters Using LQR-Obstacles. - Jan-Peter Calliess, Michael Alan Osborne, Stephen J. Roberts:
Towards Optimization-Based Multi-Agent Collision-Avoidance Under Continuous Stochastic Dynamics. - Yann-Michaël De Hauwere, Ann Nowé:
Learning Conflicts from Experience. - Mohamad El Falou, Maroua Bouzid, Abdel-Illah Mouaddib:
DEC-A*: A Decentralized A* Algorithm. - Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Jonathan Schaeffer:
A* Variants for Optimal Multi-Agent Pathfinding. - Athanasios Krontiris, Qandeel Sajid, Kostas E. Bekris:
Towards Using Discrete Multiagent Pathfinding to Address Continuous Problems. - Patrick MacAlpine, Francisco Barrera, Peter Stone:
Positioning to Win: A Dynamic Role Assignment and Formation Positioning System. - Gabriele Röger, Malte Helmert:
Non-Optimal Multi-Agent Pathfinding Is Solved (Since 1984). - Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-Based Search for Optimal Multi-Agent Path Finding. - Jamie Snape, Stephen J. Guy, Jur van den Berg, Ming C. Lin, Dinesh Manocha:
Reciprocal Collision Avoidance and Multi-Agent Navigation for Video Games. - Trevor Scott Standley:
Independence Detection for Multi-Agent Pathfinding Problems. - Jingjin Yu, Steven M. LaValle:
Time Optimal Multi-Agent Path Planning on Graphs.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.