All Questions
Tagged with comparison search
22 questions
0
votes
1
answer
140
views
Which search algorithm expands nodes closest to the goal?
I want to know which search algorithm among A* and Best-First Search and Greedy First Search expands nodes closest to the goal. I have three opinions about A* and Best-First Search and Greedy First ...
- 3
1
vote
2
answers
2k
views
Is there any situation in which breadth-first search is preferable over A*?
Is there any situation in which breadth-first search is preferable over A*?
- 11
1
vote
1
answer
2k
views
What is the difference between the heuristic function and the evaluation function in A*?
I am reading college notes on state search space. The notes (which are not publicly available) say:
To do state-search space, the strategy involves two parts: defining a heuristic function, and ...
- 307
2
votes
2
answers
3k
views
What is the difference between the uniform-cost search and Dijkstra's algorithm?
Every computer science student (including myself, when I was doing my bachelor's in CS) probably encountered the famous single-source shortest path Dijkstra's algorithm (DA). If you also took an ...
- 41.4k
3
votes
1
answer
4k
views
How does best-first search differ from hill-climbing?
How does best-first search differ from hill-climbing?
1
vote
0
answers
539
views
What is a example showing that the tree-based variant for the greedy best-first search is incomplete?
I understand that a tree-based variant will have nodes repeatedly added to the frontier. How do I craft an example where a particular goal node is never found. Is this example valid.
On the other ...
- 63
3
votes
1
answer
5k
views
What is the difference between hill-climbing and greedy best-first search algorithms?
While watching MIT's lectures about search, 4. Search: Depth-First, Hill Climbing, Beam, the professor explains the hill-climbing search in a way that is similar to the best-first search. At around ...
- 1,291
7
votes
1
answer
2k
views
How do we determine whether a heuristic function is better than another?
I am trying to solve a maze puzzle using the A* algorithm. I am trying to analyze the algorithm based on different applicable heuristic functions.
Currently, I explored the Manhattan and Euclidean ...
- 333
3
votes
1
answer
466
views
How to transform a PDDL to search?
I have a question about search and planning:
I still haven't understood the difference from the two, but they seem very similar to me; here is a question I am struggling with:
"Having formulated a ...
- 273
7
votes
1
answer
396
views
A* is similar to Dijkstra with reduced cost
According to this Wikipedia article
If the heuristic $h$ satisfies the additional condition $h(x) \leq d(x, y) + h(y)$ for every edge $(x, y)$ of the graph (where $d$ denotes the length of that edge),...
2
votes
1
answer
1k
views
Why is informed search more efficient than uninformed search?
Why does informed search more efficiently finds a solution than an uninformed search?
- 109
10
votes
2
answers
1k
views
What is the difference between search and learning?
I came across an article, The Bitter Truth, via the Two Minute Papers YouTube Channel. Rich Sutton says...
One thing that should be learned from the bitter lesson is the great power of general ...
- 103
9
votes
2
answers
8k
views
What is the difference between search and planning?
I'm reading the book Artificial Intelligence: A Modern Approach (by Stuart Russell and Peter Norvig).
However, I don't understand the difference between search and planning. I was more confused when I ...
- 273
5
votes
1
answer
14k
views
How do I show that uniform-cost search is a special case of A*?
How do I show that uniform-cost search is a special case of A*? How do I prove this?
- 323
2
votes
1
answer
7k
views
What is the difference between the breadth-first search and recursive best-first search?
What is the difference between the breadth-first search and recursive best-first search? How can I describe the key difference between them?
- 375
5
votes
1
answer
8k
views
How is simulated annealing better than hill climbing methods?
In hill climbing methods, at each step, the current solution is replaced with the best neighbour (that is, the neighbour with highest/smallest value). In simulated annealing, "downhills" moves are ...
- 189
5
votes
1
answer
6k
views
What are the differences between uniform-cost search and greedy best-first search?
What are the differences between the uniform-cost search (UCS) and greedy best-first search (GBFS) algorithms? How would you convert a UCS into a GBFS?
- 566
14
votes
3
answers
68k
views
What are the differences between A* and greedy best-first search?
What are the differences between the A* algorithm and the greedy best-first search algorithm? Which one should I use? Which algorithm is the better one, and why?
- 375
6
votes
1
answer
14k
views
How is iterative deepening A* better than A*?
The iterative deepening A* search is an algorithm that can find the shortest path between a designated start node and any member of a set of goals.
The A* algorithm evaluates nodes by combining the ...
- 189
19
votes
1
answer
52k
views
What is the difference between tree search and graph search?
I have read various answers to this question at different places, but I am still missing something.
What I have understood is that a graph search holds a closed list, with all expanded nodes, so ...
- 423
6
votes
1
answer
11k
views
What is the difference between local search and global search algorithms?
What is the difference between local search and global (or complete) search algorithms?
- 171
9
votes
4
answers
5k
views
When to choose Stochastic Hill Climbing over Steepest Hill Climbing?
Stochastic Hill Climbing generally performs worse than Steepest Hill Climbing, but what are the cases in which the former performs better?
- 91