I am facing a problem that I have to use A* to search through the map, and there are multiple goals in this map to reach. My aim is to expand the least nodes in the map, any idea on how to design the heuristic for this A* algorithm? thanks
How to design the heuristic for A* when there are multiple goals in the grid map?
1k Views Asked by photosynthesis At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- Two different numbers in an array which their sum equals to a given value
- Given two arrays of positive numbers, re-arrange them to form a resulting array, resulting array contains the elements in the same given sequence
- Time complexity of the algorithm?
- Find a MST in O(V+E) Time in a Graph
- Why k and l for LSH used for approximate nearest neighbours?
- How to count the number of ways of choosing of k equal substrings from a List L(the list of All Substrings)
- Issues with reversing the linkedlist
- Finding first non-repeating number in integer array
- Finding average of an array
- How to check for duplicates with less time in a list over 9000 elements by python
- How to pick a number based on probability?
- Insertion Sort help in javascript -- Khan Academy
- Developing a Checkers (Draughts) engine, how to begin?
- Can Bellman-Ford algorithm be used to find shorthest path on a graph with only positive edges?
- What is the function for the KMP Failure Algorithm?
Related Questions in ARTIFICIAL-INTELLIGENCE
- Developing a Checkers (Draughts) engine, how to begin?
- STRIPS representation of monkey in the lab
- Difference between weak AI and strong AI?
- Q-learning in game not working as expected
- How do I use a class as a template in C#?
- prolog rules as arguments
- How to evaluate a recurrent connection in an artificial neural network?
- AS3 AI barrier detection and movement
- How to simulate neural network by changing different parameters after training in MATLAB?
- Debugging Neural Network for (Natural Language) Tagging
- How do I create a back propagation neural network that has different kinds of output?
- Google Deep Dream art: how to pick a layer in a neural network and enhance it
- Pylearn2 example for time series or sequence prediction
- A Star Pathfinding
- Using Neural Networks Without Training Them
Related Questions in A-STAR
- A star algorithm not working because of pointer to parent, help fixing it
- A Star Pathfinding
- How to edit A* pathfinding algorithm to find only straight moves?
- A*, what's the best data structure for the open list?
- PHP A* Pathfinding can't work for complex maze HackerRank
- How to Represent Maze of Pixels as Nodes
- AStar sometimes no way
- A* Pathfinding in a 2D Sidescroller
- Heuristic for A*-Algorithm with irregular distances between nodes
- Implementing a wall in get successor for A*
- Comparator implementation that involves multiple objects java
- Why isn't my heuristic for the A* algorithm admissible?
- Don't understand what return does in pseudo code
- Is Manhattan distance still an admissible heuristic in this modified n-puzzle?
- When is a heuristic admissible but not consistent?
Related Questions in HEURISTICS
- Heuristic function of A* search for sorting
- Neighborhood Structure for Graph Coloring Local Search Heuristic
- Heuristic for A*-Algorithm with irregular distances between nodes
- What are some effective techniques for learning heuristic weights?
- Why allowing diagonal movement would make the A* and Manhattan Distance inadmissible?
- Why isn't my heuristic for the A* algorithm admissible?
- How do we do Graph representation in Ruby
- When is a heuristic admissible but not consistent?
- Find "complemented" bit vectors clusters
- Artificial Intelligence/Rules to guess user taste in Apparel/Clothing
- How can we implement Artificial Intelligence in Javascript games?
- Heuristic and A* algorithm
- Should I use one class or more?
- Interesting metaheuristic algorithms, easy to lern, many usages in real-world applications
- Shortest Path Algorithm in a partial graph
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Assuming by "multiple goals" you mean you want to reach any one, just take the minimum of all the heuristics. Assuming your heuristic is consistent, this is still a consistent heuristic.
If instead you're trying to reach all of them, this is essentially the traveling salesman problem, which is NP-Complete.