حل تمرین یادگیری ماشین(یادگیری تقویتی و برنامه ریزی پویا)
سه سال پیش منتشر شده
تعداد بازدید: 913
کد پروژه: 184482
شرح پروژه
اگر یادگیری تقویتی و برنامه ریزی پویا را بلد هستین می توانید دو خواسته زیر را انجام دهید
(a) Choose an example of a single-agent search problem listed below. Describe its
environment properties (Lec2), give an initial state, goal states, actions,
action costs, as well as a sample admissible heuristic function that could be
used in the A* search algorithm to help solve it efficiently. Assume that for
each problem, your goal is to produce a sequence of actions that solves the
problem in as few actions as possible.
Example Problems/Games:
- Sliding Puzzle (Numbers) https://en.wikipedia.org/wiki/Sliding_puzzle
- Rubik's Cube https://en.wikipedia.org/wiki/Rubik%27s_Cube
- Rush Hour https://en.wikipedia.org/wiki/Rush_Hour_(puzzle)
- Sokoban https://en.wikipedia.org/wiki/Sokoban
(b) For the problem/game chosen in part (a) of this question, you are now tasked
with solving it using Evolutionary Computing. Of the choice between a Genetic
Algorithm or Genetic Programming, which is better suited for this task? Give
a detailed explanation of why you made this choice. Your answer should include
a discussion of candidate solutions, genotype representation, and reproduction.
مهارت ها و تخصص های مورد نیاز
بودجه
300,000 تومان تا 750,000 تومان
مهلت برای انجام
5روز
وضعیت مناقصه
بسته
درباره کارفرما
عضویت پنج سال پیش
