Discussion
Three of the following are heuristics derived from a relaxation. Which is the odd one out?
Mutex propagation in a planning graph
The additive heuristic over goal atoms
The maximum heuristic over goal atoms
The relaxed plan length heuristic
Answer: C
The additive, maximum and relaxed plan heuristics are all computed from the delete relaxation. Mutex propagation records interactions the relaxation deliberately ignores, so it strengthens rather than relaxes the model. Distinguishing techniques that simplify a problem to obtain a bound from those that add information to tighten one is what makes the relationship between them intelligible.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development