Departmental Papers (ESE)

Abstract

A navigation function is an artificial potential energy function on a robot configuration space (C-space) which encodes the task of moving to an arbitrary destination without hitting any obstacle. In particular, such a function possesses no spurious local minima. In this paper we construct navigation functions on forests of stars: geometrically complicated C-spaces that are topologically indistinguishable from a simple disc punctured by disjoint smaller discs, representing "model" obstacles. For reasons of mathematical tractability we approximate each C-space obstacle by a Boolean combination of linear and quadratic polynomial inequalities (with "sharp corners" allowed), and use a "calculus" of implicit representations to effectively represent such obstacles. We provide evidence of the effectiveness of this "technology" of implicit representations in the form of several simulation studies illustrated at the end of the paper.

Document Type

Conference Paper

Subject Area

GRASP, Kodlab

Date of this Version

May 1990

Comments

Copyright 1990 IEEE. Reprinted from Proceedings of the IEEE International Conference on Robotics and Automation, Volume 3, 1990, pages 1937-1942.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

NOTE: At the time of publication, author Daniel Koditschek was affiliated with Yale University. Currently, he is a faculty member in the Department of Electrical and Systems Engineering at the University of Pennsylvania.

Share

COinS
 

Date Posted: 06 June 2008

This document has been peer reviewed.