Locating Polyhedral Objects from Edge Point Data
Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Robotics. Pages 1149-1151.
Abstract
A method is presented to locate a general polyhedron in space with six degrees of freedom . A light stripe sensor is assumed to be capable of providing three-dimensional data points on known edges of the polyhedron to within a known accuracy. A representation is found for all the ways three line segments of fixed length can fall between the edges of a polyhedron. This representation, called an edge interval, is used in a tree search to find the location of each data point to within an interval on the edge. The final location of the object is determined by a onedimensional line search. The method is illustrated with simulated data from a unit tetrahedron and results from a computer implementation are presented. The tree search takes a negligible amount of time and the onedimensional line search takes a small additional increment.
@inproceedings{ijcai1987p232,
title = {Locating Polyhedral Objects from Edge Point Data},
author = {Silverman, Gary and Tsai, Roger Y. and Lavin, Mark},
booktitle = {Proceedings of the Tenth International Joint Conference on
Artificial Intelligence, {IJCAI-87}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John McDermott},
pages = {1149--1151},
year = {1987},
note = {Robotics},
url = {https://ijcai.org/proceedings/1987/232},
}
TY - CPAPER TI - Locating Polyhedral Objects from Edge Point Data AU - Silverman, Gary AU - Tsai, Roger Y. AU - Lavin, Mark T2 - Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI-87 PB - International Joint Conferences on Artificial Intelligence PY - 1987 SP - 1149 EP - 1151 UR - https://ijcai.org/proceedings/1987/232 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
