Optimal target assignment and path finding for teams of agents
We study the TAPF (combined target-assignment and path-finding) problem for teams of
agents in known terrain, which generalizes both the anonymous and non-anonymous multi …
agents in known terrain, which generalizes both the anonymous and non-anonymous multi …
Multi-agent path finding with kinematic constraints
Abstract Multi-Agent Path Finding (MAPF) is well studied in both AI and robotics. Given a
discretized environment and agents with assigned start and goal locations, MAPF solvers …
discretized environment and agents with assigned start and goal locations, MAPF solvers …
Formation change for robot groups in occluded environments
We study formation change for robot groups in known environments. We are given a team of
robots partitioned into groups, where robots in the same group are interchangeable with …
robots partitioned into groups, where robots in the same group are interchangeable with …
[PDF][PDF] Abstracts of Papers Presented at SoCS 2016 in the Previously Published Paper Track
J Baier, A Botea - Proceedings of the International Symposium on …, 2016 - ojs.aaai.org
Abstracts of Papers Presented at SoCS 2016 in the Previously Published Paper Track Page 1
Abstracts of Papers Presented at SoCS 2016 in the Previously Published Paper Track Jorge …
Abstracts of Papers Presented at SoCS 2016 in the Previously Published Paper Track Jorge …