Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
From MaRDI portal
Publication:3564298
DOI10.1007/978-3-540-68405-3_7zbMath1188.93030OpenAlexW1589443075MaRDI QIDQ3564298
Jur P. van den Berg, Mark H. Overmars
Publication date: 2 June 2010
Published in: Springer Tracts in Advanced Robotics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68405-3_7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
On a Fire Fighter’s Problem ⋮ An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane ⋮ Method of evolving junctions: a new approach to optimal control with constraints ⋮ Maximum thick paths in static and dynamic environments ⋮ A meshfree particle method for a vision-based macroscopic pedestrian model ⋮ Minimizing Co-location Potential of Moving Entities ⋮ Time-delayed follow-the-leader model for pedestrians walking in line
This page was built for publication: Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
