Any-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm

The problem of finding conflict-free trajectories for multiple agents of identical circular shape, operating in shared 2D workspace, is addressed in the paper and decoupled, e.g., prioritized, approach is used to solve this problem. Agents' workspace is tessellated into the square grid on which any-angle moves are allowed, e.g. each agent can move into an arbitrary direction as long as this move follows the straight line segment whose endpoints are tied to the distinct grid elements. A novel any-angle planner based on Safe Interval Path Planning (SIPP) algorithm is proposed to find trajectories for an agent moving amidst dynamic obstacles (other agents) on a grid. This algorithm is then used as part of a prioritized multi-agent planner AA-SIPP(m). On the theoretical, side we show that AA-SIPP(m) is complete under well-defined conditions. On the experimental side, in simulation tests with up to 200 agents involved, we show that our planner finds much better solutions in terms of cost (up to 20%) compared to the planners relying on cardinal moves only.

[1]  Ariel Felner,et al.  Theta*: Any-Angle Path Planning on Grids , 2007, AAAI.

[2]  Nathan R. Sturtevant,et al.  Benchmarks for Grid-Based Pathfinding , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[3]  Hong Xu,et al.  Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding , 2016, IJCAI.

[4]  Adi Botea,et al.  MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees , 2011, J. Artif. Intell. Res..

[5]  Michal Cáp,et al.  Complete Decentralized Method for On-Line Multi-Robot Trajectory Planning in Well-formed Infrastructures , 2015, ICAPS.

[6]  David Tolpin,et al.  ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding , 2015, SOCS.

[7]  Paul G. Spirakis,et al.  Strong NP-Hardness of Moving Many Discs , 1984, Inf. Process. Lett..

[8]  Trevor Scott Standley.  Finding Optimal Solutions to Cooperative Pathfinding Problems , 2010, AAAI.

[9]  Roni Stern,et al.  Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem , 2014, SOCS.

[10]  Maxim Likhachev,et al.  Anytime Safe Interval Path Planning for dynamic environments , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Alban Grastien,et al.  Optimal Any-Angle Pathfinding In Practice , 2016, J. Artif. Intell. Res..

[12]  Maxim Likhachev,et al.  SIPP: Safe interval path planning for dynamic environments , 2011, 2011 IEEE International Conference on Robotics and Automation.

[13]  David Silver,et al.  Cooperative Pathfinding , 2005, AIIDE.

[14]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[15]  Michal Cáp,et al.  Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots , 2014, IEEE Transactions on Automation Science and Engineering.

[16]  Nathan R. Sturtevant,et al.  Conflict-based search for optimal multi-agent pathfinding , 2012, Artif. Intell..

[17]  Xiaolin Wu.  An efficient antialiasing technique , 1991, SIGGRAPH.

[18]  Howie Choset,et al.  M*: A complete multirobot path planning algorithm with performance bounds , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.