On information invariants in robotics
Open Access
- 1 January 1995
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 72 (1-2), 217-304
- https://doi.org/10.1016/0004-3702(94)00024-u
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Constructive recognizability for task-directed robot programmingRobotics and Autonomous Systems, 1992
- An efficient algorithm for one-step planar compliant motion planning with uncertaintyAlgorithmica, 1992
- The complexity of planar compliant motion planning under uncertaintyAlgorithmica, 1990
- Complexity of deciding Tarski algebraJournal of Symbolic Computation, 1988
- Planning for conjunctive goalsArtificial Intelligence, 1987
- The complexity of elementary algebra and geometryJournal of Computer and System Sciences, 1986
- Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1986
- Using Backprojections for Fine Motion Planning with UncertaintyThe International Journal of Robotics Research, 1986
- On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem"The International Journal of Robotics Research, 1984
- Turing machines with restricted memory accessInformation and Control, 1966