Continue with your mobile number
The A* (A-Star) algorithm is widely used for real-time pathfinding and graph traversal in robotics. It combines the benefits of Dijkstra’s algorithm and Greedy Best-First-Search. By using heuristics to estimate the cost to reach the goal, A* efficiently finds the shortest path from the start point to the goal. The algorithm is optimal and complete, ensuring that the found path is the shortest possible while considering the cost of the path and heuristic estimates. Why Other Options are Wrong: b) Support Vector Machines (SVM) are used for classification and regression tasks, not pathfinding. c) K-Nearest Neighbors (KNN) is a classification algorithm based on similarity and is not suitable for real-time pathfinding. d) Long Short-Term Memory (LSTM) networks are used for sequential data processing, such as time series analysis, not for pathfinding. e) Naive Bayes Classifier is a probabilistic classification algorithm and does not apply to pathfinding tasks.
Which material has the lowest refractive index?
Which of the following statements about magnetic field lines is correct?
Iron, Nickel and Cobalt are the examples of
Which of the following does NOT exemplify Potential Energy?
UNO was established on?
When two charged bodies are properly connected but do not exchange electric current, it indicates that they have the same _____.
Which of the following is equal to a measurement of 1 mA?
The energy of wind is-
Which of the following statements about X-rays is INCORRECT ?
Which law describes the relationship between electric current and potential difference?