December 3, 2017

Overview

Problem

  • Navigate a single robot agent from an initial point to a goal state.
  • Environment has solid obstacles, visible and non-visible.
  • Use Hill Climbing and Learning Real-Time A* on convex and non-convex obstacles
  • Use Python 3 with Shapely (geometric objects) and Matplotlib (animations).

Initial Scenarios

Convex: Hill Climbing and LRTA*

Non-Convex: Hill Climbing and LRTA*