Simplicial dijkstra and A ^* algorithms: From graphs to continuous spaces

Keyphrases

• A* Algorithm 33%
• Adaptation 33%
• Continuous Space 100%
• Cost-to-go Function 66%
• Dijkstra 100%
• Dijkstras Algorithm 33%
• Discrete Dynamic Programming 33%
• Discrete Version 33%
• Distance Traveled 33%
• Dynamic Programming Equation 33%
• Dynamic Programming Principle 33%
• Euclidean Distance 33%
• Feedback Planning 33%
• Interpolation Method 33%
• Nonlinear Systems 33%
• Optimal Feedback 66%
• Optimal Trajectory 33%
• Performance Improvement 33%
• Piecewise Linear Approximation 33%
• Planning Problem 33%
• Polygonal Obstacles 33%
• Simplicial 100%
• Simplicial Decomposition 33%

Computer Science

• Approximation (Algorithm) 50%
• Continuous Space 100%
• Dijkstras Algorithm 50%
• Dynamic Programming 100%
• Euclidean Distance 50%
• Nonlinear System 50%
• Optimal Trajectory 50%
• piecewise linear 50%

Mathematics

• Approximates 100%
• Euclidean Distance 50%
• Nonlinear System 50%
• Optimal Trajectory 50%
• Piecewise-Linear Approximation 50%