Motion planning among time dependent obstacles
From MaRDI portal
Recommendations
- Motion planning in the presence of moving obstacles
- Reducing Multiple Object Motion Planning to Graph Searching
- Time-minimal paths amidst moving obstacles in three dimensions
- Planning a time-minimal motion among moving obstacles
- A unified approach for robot motion planning with moving polyhedral obstacles
Cites work
- scientific article; zbMATH DE number 3951430 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Motion planning in the presence of moving obstacles
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- On the Movement of Robot Arms in 2-Dimensional Bounded Regions
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- Strong NP-hardness of moving many discs
Cited in
(21)- Probabilistic Motion Planning Under Temporal Tasks and Soft Constraints
- A survey of motion planning and related geometric algorithms
- Planning a time-minimal motion among moving obstacles
- scientific article; zbMATH DE number 4126714 (Why is no real title available?)
- A cop and robber game on edge-periodic temporal graphs
- scientific article; zbMATH DE number 1830755 (Why is no real title available?)
- Movement planning in the presence of flows
- scientific article; zbMATH DE number 4174372 (Why is no real title available?)
- Dynamic motion planning in low obstacle density environments
- Time-minimal paths amidst moving obstacles in three dimensions
- Motion planning in environments with low obstacle density
- Fastest path across constrained moving rectilinear obstacles
- scientific article; zbMATH DE number 4020520 (Why is no real title available?)
- Dynamic motion planning in low obstacle density environments
- Motion planning in the presence of moving obstacles
- Time-dependent routing problems: a review
- scientific article; zbMATH DE number 1684391 (Why is no real title available?)
- Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
- The computational complexity of Portal and other 3D video games
- Feasibility of Motion Planning on Directed Graphs
- scientific article; zbMATH DE number 7295087 (Why is no real title available?)
This page was built for publication: Motion planning among time dependent obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096427)