The complexity of the tabulation of trajectory problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3934720
- scientific article; zbMATH DE number 2002586
- Polynomial time algorithms for tracking path problems
- Polynomial Time Algorithms for Tracking Path Problems
- Geodesic complexity of motion planning
- The problem of trajectories avoiding a sparse terminal set
- Topological complexity and efficiency of motion planning algorithms
- On the realizability of lengths in trajectory problems
- scientific article; zbMATH DE number 3871373
- Complexity of nonholonomic motion planning
Cited in
(3)
This page was built for publication: The complexity of the tabulation of trajectory problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738867)