Outline Objectives Agents and Their building Blocks Principles for building agents Modeling formalisms Algorithmic Principles Building an agent: The Mars Exploration rover
How Might a mouse search a Maze for Cheese? heese · State Space Search? As a Constraint Satisfaction Problem? Goal-directed Planning As a rule or production System? What is missing? Ideas in this lecture Objective is to accumulate rewards rather than goal states Task is to generate policies for how to act in all situations rather than a plan for a single starting situation
Robot localization 3 canonical problems Position Tracking Global Localization Kidnapped robot problem onot the mapping problem. We always assume we have a map To start without a map or model is the Simultaneous Localization and Mapping problem, or SLAM. also known as concurrent Mapping and Localization
Roadmap path planning Brian C. williams 16410-13 October 27th. 2003 Assignment · Reading: Path Planning: AIMA Ch 25.4 Homework Online problem set #7 due Monday, November 3rd
How do we maneuver ImagestakenfromNasa'Swebsitehttp://www.nasa.gov/ Roadmaps are an effective state space abstraction Brian Williams, Spring 0 Courtesy of U.S. Geological survey
Achieving Arc Consistency via Constraint Propagation Arc consistency eliminates values of each variable domain that can never satisfy a particular constraint (an arc Directed arc (Vi, v) is arc consistent if VXED, 3yED, such that(x, y) is allowed by constraint C