Obstacle World (Search)

Search

Design and implement an agent program to help an autonomous agent navigate an area while avoiding triangular obstacles. The problem description as discovered in class follows.

Performance Measure The agent program will be evaluated based on a combination of the amount of time spent searching for a good path from the start to goal, and the distance actually traveled. To maximize the performance measure, the agent will need to be able to choose the best search strategy to find a good enough path in a short period of time.

Environment The agent is a robot in a 1000 meter by 1000 meter warehouse. The warehouse contains a collection of triangular obstacles.

Actuators The agent has the following actions:

Sensors The agent receives the following percepts

The starter kit is available through anonymous CVS checkout.

saturn$ cvs -d :pserver:anonymous@helios.cs.dixie.edu:/home/cs4300/cvs login
saturn$ cvs -d :pserver:anonymous@helios.cs.dixie.edu:/home/cs4300/cvs co ai ai-agents

The programs of interest are ObstacleCreateWorld, ObstacleDisplay, and OS_Test.

Citation: (course_default). (2007, November 15). Obstacle World (Search). Retrieved September 08, 2008, from Dixie State College of Utah Web site: http://pilot.educommons.usu.edu/dixiestate/computer-and-information-technology/artificial-intelligence/obstacle-world-search.
Copyright 2007, by the Contributing Authors. This work is licensed under a Creative Commons License. Creative Commons License