Questions tagged [admissible-heuristic]
For questions related to admissible heuristics, which are heuristics that never overestimate the cost of reaching a goal.
12
questions
2
votes
1answer
63 views
Is A* with an admissible but inconsistent heuristic optimal?
I understand that, in tree search, an admissible heuristic implies that $A*$ is optimal. The intuitive way I think about this is as follows:
Let $P$ and $Q$ be two costs from any respective nodes $p$ ...
0
votes
1answer
57 views
Which heuristics guarantee the optimality of A*?
The following is a statement and I am trying to figure out if it's True or False and why.
Given a non-admissible heuristic function, A* will always give a solution if one exists, but there is no ...
2
votes
1answer
114 views
Checking consistency and admissibility of heuristic functions
Consider the following question:
n vehicles occupy squares (1, 1) through (n, 1) (i.e., the bottom row) of an n × n grid.
The vehicles must be moved to the top row but in reverse order; so the ...
3
votes
1answer
99 views
Is the summation of consistent heuristic functions also consistent?
Imagine that we have a set of heuristic functions $\{h_i\}_{i=1}^N$, where each $h_i$ is both admissible and consistent (monotonic). Is $\sum_{i=1}^N h_i$ still consistent or not?
Is there any proof ...
4
votes
2answers
877 views
If an heuristic is not admissible, can it be consistent?
I am solving a problem in which, according to the given values, the heuristic is not admissible. According to my calculation from other similar problems, it should be consistent, as well as keeping in ...
6
votes
1answer
76 views
Can two admissable heuristics not dominate each other?
I am working on a project for my artificial intelligence class. I was wondering if I have 2 admissible heuristics, A and B, is it possible that A does not dominate B and B does not dominate A? I am ...
5
votes
1answer
147 views
How do we determine whether a heuristic 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 heuristics.
Currently, I explored the Manhattan and Euclidean distances. ...
2
votes
1answer
115 views
Understanding the proof that A* search is optimal
I don't understand the proof that $A^*$ is optimal.
The proof is by contradiction:
Assume $A^*$ returns $p$ but there exists a $p'$ that is cheaper. When $p$ is chosen from the frontier, assume $...
2
votes
1answer
383 views
Is the minimum and maximum of a set of admissible and consistent heuristics also consistent and admissible?
Let's suppose I have a set of heuristics $H$ = {$h_1, h_2, ..., h_N$}.
If all heuristics in $H$ are admissible, does that mean that a heuristic that takes the $\min(H)$ (or $\max(H)$ for that matter) ...
3
votes
1answer
209 views
How do I find whether this heuristic is or not admissible and consistent?
I was given the following problem to solve.
Given a circular trail divided by $n> 2$ segments labeled $0 \dots n-1$. In the beginning, an agent is at the start of segment number $0$ (the edge ...
2
votes
1answer
294 views
Why Nilsson's Sequence Score isn't an admissible heuristic?
I understand what an admissible heuristic is, I just don't know how to tell whether one heuristic is admissible or not. So, in this case, I'd like to know why Nilsson heuristic isn't admissible.
8
votes
1answer
8k views
Why is A* optimal if the heuristic function is admissible?
A heuristic is admissible if it never overestimates the true cost to reach the goal node from $n$. If a heuristic is consistent, then the heuristic value of $n$ is never greater than the cost of its ...
