skip to content
Hypothesizing Channels through Free-Space in Solving the Findpath Problem. Preview this item
ClosePreview this item
Checking...

Hypothesizing Channels through Free-Space in Solving the Findpath Problem.

Author: Bruce R Donald; MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB.
Publisher: Ft. Belvoir Defense Technical Information Center JUN 1983.
Edition/Format:   Book : English
Database:WorldCat
Summary:
Channels are an encoding of free-space corresponding to the classes of paths within an environment. An implementation exploiting this global model of the connectivity of free-space has been able to solve 2-dimensional find-path problems in several minutes which formerly took many hours. The author's algorithm is essentially a problem-solving strategy using a homeomorphic reduction of the search space. Given a  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Bruce R Donald; MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB.
OCLC Number: 227596015
Notes: Sponsored in part by Contract N00014-82-K-0334.
Description: 60 p.

Abstract:

Channels are an encoding of free-space corresponding to the classes of paths within an environment. An implementation exploiting this global model of the connectivity of free-space has been able to solve 2-dimensional find-path problems in several minutes which formerly took many hours. The author's algorithm is essentially a problem-solving strategy using a homeomorphic reduction of the search space. Given a polyhedral environment, a technique is presented for hypothesizing a channel volume through the free space containing a class of successful collision-free paths. A set of geometric constructions between obstacle faces is proposed, and defined is a mapping from a field of view analysis to a direct local construction of free space. The algorithm has the control structure of a search which propagates construction of a connected channel towards a goal along a frontier of exterior free faces. Thus a channel volume starts out by surrounding the moving object in the initial configuration and grows towards the goal. Finally, techniques for analyzing the channel decomposition of free space and suggesting a path are shown. This paper addresses issues in the find-path or piano mover's problem in robotics and spatial planning: the problem involves finding a path for a solid object in an environment containing obstacles. In robotics we are typically interested in motion planning for a mobile robot or manipulator. In Computer-Aided Design, the problem of automated structural design for n structural members is also an instance of the most general form of the mover's problem.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227596015>
library:oclcnum"227596015"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227596015>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:datePublished"JUN 1983"
schema:datePublished"1983"
schema:description"Channels are an encoding of free-space corresponding to the classes of paths within an environment. An implementation exploiting this global model of the connectivity of free-space has been able to solve 2-dimensional find-path problems in several minutes which formerly took many hours. The author's algorithm is essentially a problem-solving strategy using a homeomorphic reduction of the search space. Given a polyhedral environment, a technique is presented for hypothesizing a channel volume through the free space containing a class of successful collision-free paths. A set of geometric constructions between obstacle faces is proposed, and defined is a mapping from a field of view analysis to a direct local construction of free space. The algorithm has the control structure of a search which propagates construction of a connected channel towards a goal along a frontier of exterior free faces. Thus a channel volume starts out by surrounding the moving object in the initial configuration and grows towards the goal. Finally, techniques for analyzing the channel decomposition of free space and suggesting a path are shown. This paper addresses issues in the find-path or piano mover's problem in robotics and spatial planning: the problem involves finding a path for a solid object in an environment containing obstacles. In robotics we are typically interested in motion planning for a mobile robot or manipulator. In Computer-Aided Design, the problem of automated structural design for n structural members is also an instance of the most general form of the mover's problem."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1862853074>
schema:inLanguage"en"
schema:name"Hypothesizing Channels through Free-Space in Solving the Findpath Problem."@en
schema:numberOfPages"60"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.