public:t-622-arti-14-1:prog1
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
| public:t-622-arti-14-1:prog1 [2014/01/22 09:05] – created stephan | public:t-622-arti-14-1:prog1 [2024/04/29 13:33] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 38: | Line 38: | ||
| - Think of a good (admissible) heuristic function for estimating the remaining cost given an arbitrary state of the environment. Make sure, that your heuristics is really admissible! | - Think of a good (admissible) heuristic function for estimating the remaining cost given an arbitrary state of the environment. Make sure, that your heuristics is really admissible! | ||
| - Implement A*-Search with an evaluation function that uses your heuristics. Run your agent with all the given environments and compare the results with those of the blind search methods. | - Implement A*-Search with an evaluation function that uses your heuristics. Run your agent with all the given environments and compare the results with those of the blind search methods. | ||
| - | - Post the results (number of state expansions, maximum size of the frontier, cost of the found solution) | + | - Post the results (number of state expansions, maximum size of the frontier, cost of the found solution) |
| - Try to improve your heuristics, but make sure that it does not increase the overall runtime of search algorithm. You can easily create a heuristics that tells you the optimal costs but is as expensive as a blind search. Try to avoid this. | - Try to improve your heuristics, but make sure that it does not increase the overall runtime of search algorithm. You can easily create a heuristics that tells you the optimal costs but is as expensive as a blind search. Try to avoid this. | ||
/var/www/cadia.ru.is/wiki/data/attic/public/t-622-arti-14-1/prog1.1390381522.txt.gz · Last modified: 2024/04/29 13:32 (external edit)