An exact geometry-based algorithm for path planning
From MaRDI portal
Recommendations
- A shortest path based path planning algorithm for nonholonomic mobile robots
- Shortest paths in the plane with convex polygonal obstacles
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Shortest paths in the plane with polygonal obstacles
- Time and space efficient algorithms for shortest paths between convex polygons
Cites work
- scientific article; zbMATH DE number 2238822 (Why is no real title available?)
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An optimal path planning problem for heterogeneous multi-vehicle systems
- Computational geometry. Algorithms and applications.
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Introduction to algorithms
- Multi-objective optimization using evolutionary algorithms
- Optimal Point Location in a Monotone Subdivision
- Shortest paths in the plane with convex polygonal obstacles
- Visibility of disjoint polygons
Cited in
(5)- Optimal algorithm for shape from shading and path planning
- DMPC: a data-and model-driven approach to predictive control
- Multiquery motion planning in uncertain spaces: incremental adaptive randomized roadmaps
- scientific article; zbMATH DE number 5371059 (Why is no real title available?)
- An efficient approach to 3D path planning
This page was built for publication: An exact geometry-based algorithm for path planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1797878)
