26/10/2020

Revisiting Bounded-Suboptimal Safe Interval Path Planning

Konstantin Yakovlev, Anton Andreychuk, Roni Stern

Keywords: Safe interval path planning, Heuristic search, Path planning, Motion planning

Abstract: Safe-interval path planning (SIPP) is a powerful approach for finding a path in the presence of dynamic obstacles and continuous time. SIPP is based on the A* algorithm and returns provably optimal solutions. However, in many practical applications of SIPP such as path planning for robots, one would like to trade-off solution cost optimality for shorter planning time. In this paper we explore different ways to build a bounded-suboptimal SIPP and discusses their pros and cons. We compare the different bounded-suboptimal versions of SIPP experimentally. While there is no universal winner, the results provide insights into when each method should be used.

 0
 0
 0
 0
This is an embedded video. Talk and the respective paper are published at ICAPS 2020 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers