Stable placements for spider robots

Authors :: Franco P. Preparata
Olivier Devillers
Leonbattista Donati
J.-D. Boissonnat
Geometry, Algorithms and Robotics (PRISME)
Inria Sophia Antipolis - Méditerranée (CRISAM)
Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Department of Computer Science (Brown University)
Brown University
Source :: Scopus-Elsevier, Proceedings of the 8th Annual Symposium on Computational Geometry, Proceedings of the 8th Annual Symposium on Computational Geometry, 1992, Berlin, Germany. pp.242-250, ⟨10.1145/142675.142725⟩, Symposium on Computational Geometry
Abstract: We study the problem of computing the set of admissible and stable placements of spider robots, a simple case of legged robots. The environment consists of a set of n points in the plane representing authorized footholds. We show that the space of admissible and stable placements of such robots has size t(n2) and can be constructed in O(n2 log n) time and O(n2) space. We give also efficient algorithms for several related problems.

Subjects :: Spider
Plane (geometry)
Efficient algorithm
Binary logarithm
Space (mathematics)
Topology
[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Computer Science::Robotics
Set (abstract data type)
Combinatorics
Simple (abstract algebra)
Robot
ComputingMilieux_MISCELLANEOUS
Mathematics

Database :: OpenAIRE
Journal :: Scopus-Elsevier, Proceedings of the 8th Annual Symposium on Computational Geometry, Proceedings of the 8th Annual Symposium on Computational Geometry, 1992, Berlin, Germany. pp.242-250, ⟨10.1145/142675.142725⟩, Symposium on Computational Geometry
Accession number :: edsair.doi.dedup.....8238c40057f3c712b8050a98a65dbab5
Full Text :: https://doi.org/10.1145/142675.142725⟩