How do we decide how much to weight path length and the heuristic function in f = g + h when implementing A*? Computer Science

---

How do we decide how much to weight path length and the heuristic function in f = g + h when implementing A*? Posted: 16 Apr 2021 08:38 PM PDT Hello, I have implemented A* and I have found that sometimes weighting the path length higher helps find a solution faster while sometimes weighting the heuristic higher helps find a soln faster; is there a way to optimize the relative weighting for the average case? Note: I was not trying to optimize the path chosen, but rather the runtime. However I now believe that I should just g and h in terms of the most natural units rather than trying to weight them here is a demo of the current implementation: https://www.dropbox.com/s/k8k4n2dgoh0zqpm/2021-04-16%2020-48-23.mp4?dl=0 submitted by /u/BlindxWizard [link] [comments]

You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now.	Email delivery powered by Google
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States