Files in this item

FilesDescriptionFormat

application/pdf

application/pdf3395519.pdf (3MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:Minimalist Models and Methods for Visibility-Based Tasks
Author(s):Tovar, Benjamin
Doctoral Committee Chair(s):LaValle, Steven M.
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Engineering, Robotics
Abstract:This dissertation proposes minimal models for solving visibility-based robotic tasks. It introduces strategies that handle sensing and actuation uncertainty while avoiding precise state estimations. This is done by analyzing the space of sensing and actuation histories, the history information space. The history information space is compressed into smaller spaces, called derived information spaces, which are used for filtering and planning. By designing and analyzing the derived information spaces, we determine minimal information requirements to solve the robotic tasks. In this context, minimal information refers to the detection combinatorial properties of the environment necessary to complete the task. Examples of these combinatorial properties are the order type of a configuration of landmarks, or the inflection arrangement of a polygonal boundary. By establishing that certain tasks can be solved using simple sensors that detect these properties, formal performance guarantees are made while avoiding substantial modeling challenges. From this perspective, the thesis provides novel strategies for classical robotic tasks, such as navigation in unknown planar environments, navigation among unknown sets of landmarks, and visibility-based pursuit-evasion. Information is recovered from combinatorial events with models of sensors unable to gather metric information (e.g., distances or angles), or global reference frames (e.g., without a compass, or a global positioning system). These combinatorial events served as the base of a sensor beam abstraction, from which several inferences about the path followed by the robot are made.
Issue Date:2009
Type:Text
Language:English
Description:176 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009.
URI:http://hdl.handle.net/2142/81867
Other Identifier(s):(MiAaPQ)AAI3395519
Date Available in IDEALS:2015-09-25
Date Deposited:2009


This item appears in the following Collection(s)

Item Statistics