Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles

DOI10.1007/978-3-540-68405-3_7MaRDI QIDQ3564298zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

collision-freefast implementationshortest safe path

Mathematics Subject Classification ID

Geometric methods (93B27) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• Planning a time-minimal motion among moving obstacles
• Path Planning among Movable Obstacles: A Probabilistically Complete Approach
• Motion planning in the presence of moving obstacles
• An effective framework for path planning amidst movable obstacles
• Path planning in the presence of obstacles based on task requirements
• ON THE PATH PLANNING PROBLEM IN THE VICINITY OF OBSTACLES
• Motion planning among time dependent obstacles
• Reliably Safe Path Planning Using Interval Analysis
• scientific article; zbMATH DE number 4174372
• Risk-optimal path planning in stochastic dynamic environments

Cited in

(16)

• A meshfree particle method for a vision-based macroscopic pedestrian model
• Time-delayed follow-the-leader model for pedestrians walking in line
• Minimizing co-location potential of moving entities
• Reliably Safe Path Planning Using Interval Analysis
• Planning near-optimal corridors amidst obstacles
• scientific article; zbMATH DE number 1241277 (Why is no real title available?)
• Method of evolving junctions: a new approach to optimal control with constraints
• The diagnostics of safety zones in motion planning
• On a fire fighter's problem
• An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane
• Maximum thick paths in static and dynamic environments
• Communicating safety of planned paths via optimally-simple explanations
• Risk-averse receding horizon motion planning for obstacle avoidance using coherent risk measures
• Computing shortest paths amid non-overlapping weighted disks
• Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning
• Consideration of obstacle danger level in path planning using A^* and fast-marching optimisation: Comparative study

This page was built for publication: Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564298)