The FINDSPACE Problem

dc.contributor.author	Sussman, Gerald Jay
dc.date.accessioned	2008-04-03T14:01:17Z
dc.date.available	2008-04-03T14:01:17Z
dc.date.issued	1971-08-03
dc.identifier.uri	http://hdl.handle.net/1721.1/41051
dc.description	Work reported herein was conducted at the Artificial Intelligence Laboratory, a Massachusetts Institute of Technology research program supported by the Advanced Research Projects Agency of the Department of Defense, and was monitored by the Office of Naval Research contract number N00014-70-A-0362-0002.	en
dc.description.abstract	The FINDSPACE problem is that of establishing a volume in space where an object of specified dimensions will fit. The problem seems to have two subproblems: the hypothesis generation problem of finding a likely spot to try, and the verification problem of testing that spot for occupancy by other objects. This paper treats primarily the verification problem.	en
dc.description.sponsorship	MIT Artificial Intelligence Laboratory Vision Group Department of Defense Advanced Research Projects Agency	en
dc.language.iso	en_US	en
dc.publisher	MIT Artificial Intelligence Laboratory	en
dc.relation.ispartofseries	MIT Artificial Intelligence Laboratory Working Papers, WP-18	en
dc.relation.ispartofseries	Vision Flash, No. 18	en
dc.title	The FINDSPACE Problem	en
dc.type	Working Paper	en