Finding a Path to a Dynamic Object Using the A* Algorithm.
Minki HongKanghyun JoPublished in: IWIS (2023)
Keyphrases
- np hard
- cost function
- worst case
- computational cost
- preprocessing
- search space
- dynamic programming
- significant improvement
- high accuracy
- probabilistic model
- computational complexity
- times faster
- feature selection
- objective function
- dynamic environments
- expectation maximization
- detection algorithm
- experimental evaluation
- k means
- computationally efficient
- optimization algorithm
- search algorithm
- shortest path
- matching algorithm
- object tracking
- region of interest
- optimal solution
- optimal path
- shortest path problem