cs188_sp09_mt1_sol 2

# cs188_sp09_mt1_sol 2 - EA! F! 2 C G 2. (15 points) A...

This preview shows page 1. Sign up to view the full content.

2 2. (15 points) Search: Crawler’s Escape Whilst Pacman was Q-learning, Crawler snuck into mediumClassic and stole all the dots. Now, it’s trying to escape as quickly as possible. At each time step, Crawler can either move its s houlder or its e lbow one position up or down. Both joints s and e have ﬁve total positions each (1 through 5) and both begin in position 3. Upon changing arm positions from ( s,e ) to ( s 0 ,e 0 ), Crawler’s body moves some distance r ( s,e,s 0 ,e 0 ), where | r ( s,e,s 0 ,e 0 ) | ≤ 2 meters (negative distance means the crawler moves backwards). Crawler must travel 10 meters to reach the exit. r(3, 3, 3, 4) 10 meters exit Action: increase elbow position ! In this problem, you will design a search problem for which the optimal solution will allow Crawler to escape in as few time steps as possible.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 08/30/2009 for the course CS 188 taught by Professor Staff during the Spring '08 term at Berkeley.

Ask a homework question - tutors are online