Start learning 50% faster. Sign in now
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.
Gujarat’s new textile policy offers a capital subsidy ranging from:
In which country the International Union for Conservation of Nature (IUCN) 'World Conservation Congress' 2025 will be organized?
As per Union Budget 2023-24, what is the estimated fiscal deficit as a percentage of GDP?
Mission Basundhara 3.0, launched by Assam, focuses on providing:
Why have sugar prices hit a three-year low, despite India’s approval for exports of 1 million metric tons?
What is India's ranking in the 2023 World Press Freedom Index released by Reporters Without Borders (RSF)?
Which river will the first underwater railroad tunnel in Assam be built under?
India's company HealthKart’s MuscleBlaze signs whom as brand ambassador?
What is the total number of unorganised workers registered on the e-Shram portal?
Which private sector bank in India has acquire Citibank’s India consumer business for an amount of USD 1.6 billion (Rs 12,325 crores)?