Constructive recognizability for task-directed robot programming☆
25
TL;DR: A framework for mobot programming based on constructive recognizability , and why it should be robust in uncertain environments is proposed, and how to extend the theory and the geometric theory of planning to overcome challenges of the autonomous mobile robot domain is discussed.
read more
About: This article is published in Robotics and Autonomous Systems. The article was published on 01 Jan 1992. and is currently open access. The article focuses on the topics: Mobile robot & Social robot.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On information invariants in robotics
TL;DR: This paper represents the attempt to characterize a family of complicated and subtle issues concerned with measuring robot task complexity, and develops a theory whereby one sensor can be ''reduced'' to another by adding, deleting, and reallocating (a)-(e) among collaborating autonomous agents.
166
•Dissertation
Specialization of perceptual processes
Ian Horswill
- 01 Jan 1993
TL;DR: It is argued that a variety of interesting tasks can be solved using simple and inexpensive vision systems and that specialized systems can be analyzed and understood in a principled manner, one that allows general lessons to be extracted from specialized systems.
144
•Proceedings Article
Information invariants for distributed manipulation
Bruce R. Donald,James Jennings,Daniela Rus +2 more
- 12 May 1995
TL;DR: Whether explicit local and global communication between the agents can be removed from a family of pushing protocols is answered in the affirmative by using the general methods of Donald (1995), analyzing information invariants.
Information invariants for distributed manipulation
TL;DR: In this paper, the information complexity of the manipulation task was analyzed by using the general methods of Donald (1995), analyzing information invariants and developing a technique whereby one sensor can be constructed from others by adding, deleting and reallocating.
Motion planning with uncertainty: a landmark approach
TL;DR: It is shown that sensing and control do not have to be perfect in landmark regions and the structure of a reliable plan only changes at critical values of this uncertainty, and the proposed planner of polynomial complexity is proposed.
112
References
•Book
A robust layered control system for a mobile robot
Rodney A. Brooks
- 01 Jun 1991
TL;DR: A new architecture for controlling mobile robots is described, building a robust and flexible robot control system that has been used to control a mobile robot wandering around unconstrained laboratory areas and computer machine rooms.
7.9K
A robust layered control system for a mobile robot
Rodney A. Brooks
- 01 Mar 1986
TL;DR: In this paper, a new architecture for controlling mobile robots is described, which is made up of asynchronous modules that communicate over low-bandwidth channels, each module is an instance of a fairly simple computational machine.
A framework for representing knowledge
Marvin Minsky
- 01 Jun 1974
TL;DR: The enormous problem of the volume of background common sense knowledge required to understand even very simple natural language texts is discussed and it is suggested that networks of frames are a reasonable approach to represent such knowledge.
Hybrid position/force control of manipulators
M. H. Raibert,J. J. Craig +1 more
TL;DR: A new conceptually simple approach to controlling compliant motions of a robot manipulator that combines force and torque information with positional data to satisfy simultaneous position and force trajectory constraints specified in a convenient task related coordinate system is presented.
3.2K
•Book
A decision method for elementary algebra and geometry
Alfred Tarski
- 01 Jan 1951
TL;DR: A decision method for a class K of sentence (or other expressions) is meant a method by means of which, given any sentence θ, one can always decide in a finite number of steps whether θ is in K; by a decision problem for K, we mean the problem of finding a decision algorithm for K.
2.2K
Related Papers (5)
Bruce R. Donald,James Jennings +1 more
- 12 May 1992
Michael A. Erdmann,Matthew T. Mason +1 more
- 01 Apr 1986
Raja Chatila,Simon Lacroix +1 more
- 01 Jan 1996