2 papers
cs.RO2024★ 3 cited
Exact Wavefront Propagation for Globally Optimal One-to-All Path Planning on 2D Cartesian Grids
Ibrahim Ibrahim, Joris Gillis, Wilm Decré +1
This paper introduces an efficient compute and memory complexity algorithm for globally optimal path planning on 2D Cartesian grids. Unlike existing marching metho…
cs.AI2021
Safe-Planner: A Single-Outcome Replanner for Computing Strong Cyclic Policies in Fully Observable Non-Deterministic Domains
Vahid Mokhtari, Ajay Suresha Sathya, Nikolaos Tsiogkas +1
Replanners are efficient methods for solving non-deterministic planning problems. Despite showing good scalability, existing replanners often fail to solve problems involving a lar…