Path Planning in 0/1/∞ Weighted Regions with Applications
From MaRDI portal
Recommendations
- On finding approximate optimal paths in weighted regions
- scientific article; zbMATH DE number 1614653
- Adaptive and compact discretization for weighted region optimal path finding.
- Solving some optimal path planning problems using an approach based on measure theory
- ON THE PATH PLANNING PROBLEM IN THE VICINITY OF OBSTACLES
- Path Planning among Movable Obstacles: A Probabilistically Complete Approach
- Efficient path planning algorithms in reach-avoid problems
- Path planning for robots by stochastic optimization methods
Cited in
(16)- Region-restricted clustering for geographic data mining
- Optimum watchman routes
- Optimum placement of guards
- On approximating shortest paths in weighted triangular tessellations
- Quickest path queries on transportation network
- CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER
- Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
- Link Distance and Shortest Path Problems in the Plane
- Routing multi-class traffic flows in the plane
- GUARDING ART GALLERIES BY GUARDING WITNESSES
- Maximum thick paths in static and dynamic environments
- On approximating shortest paths in weighted triangular tessellations
- Path planning in a weighted planar subdivision under the Manhattan metric
- Link distance and shortest path problems in the plane
- A survey of geodesic paths on 3D surfaces
- Guarding galleries and terrains
This page was built for publication: Path Planning in 0/1/∞ Weighted Regions with Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025920)
