Information Invariants for Distributed Manipulation

1 October 1997

journal article
Published by SAGE Publications in The International Journal of Robotics Research

Vol. 16 (5), 673-702
https://doi.org/10.1177/027836499701600506

Abstract

In Donald (1995), we described a manipulation task for coop erating mobile robots that can push large, heavy objects. There, we asked whether explicit local and global communication between the agents can be removed from a family of pushing protocols. In this article, we answer in the affirmative. We do so by using the general methods of Donald (1995), analyzing information invariants.

Keywords

This publication has 12 references indexed in Scilit:

Analysis of adaptation and environment
Artificial Intelligence, 1995
On information invariants in robotics
Artificial Intelligence, 1995
Randomization for robot tasks: Using dynamic programming in the space of knowledge states
Algorithmica, 1993
Mechanical parts orienting: The case of a polyhedron on a table
Algorithmica, 1993
Orienting polygonal parts without sensors
Algorithmica, 1993
Constructive recognizability for task-directed robot programming
Robotics and Autonomous Systems, 1992
The complexity of planar compliant motion planning under uncertainty
Algorithmica, 1990
An exploration of sensorless manipulation
IEEE Journal on Robotics and Automation, 1988
Using Backprojections for Fine Motion Planning with Uncertainty
The 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

Cited by 81 articles