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.
With reference to NITI Aayog’s Governing Council, consider the following statements:
I. It is a platform to discuss inter-sectoral, inter-...
Who is the youngest female to scale the highest peaks on each of the seven continents?
Which country was authorized to join the BRICS New Development Bank in September 2024?
The Securities and Exchange Board of India (SEBI) has classified ______cases (companies) as untraceable out of 692 cases in the ‘difficult to recoverâ...
PM-Suraj' national portal aims to provide credit support to one lakh entrepreneurs from communities across the society, it is implemented by _____.
Which IIT and Kotak Mahindra Bank Ltd have collaborated to establish the Kotak School of Sustainability?
Gujarat's 'Gharchola' has been given the Geographical Indication (GI) tag for what?