What robots can do: robot programs and effective achievability

Authors:
Fangzhen Lin;Hector J. Levesque
Affiliations:
Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong;Department of Computer Science, University of Toronto, Toronto, Canada M5S 3H5
Venue:
Artificial Intelligence
Year:
1998

Citing 15
Cited 5

How to clear a block: A theory of plans

Journal of Automated Reasoning
ADL: exploring the middle ground between STRIPS and the situation calculus

Proceedings of the first international conference on Principles of knowledge representation and reasoning
The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
An empirical study of sensing and defaulting in planning

Proceedings of the first international conference on Artificial intelligence planning systems
Conditional nonlinear planning

Proceedings of the first international conference on Artificial intelligence planning systems
Building plans to monitor and exploit open-loop and closed-loop dynamics

Proceedings of the first international conference on Artificial intelligence planning systems
Proving properties of states in the situation calculus

Artificial Intelligence
PLACA, an agent oriented programming language

PLACA, an agent oriented programming language
How to progress a database

Artificial Intelligence
An ordering on subgoals for planning

Annals of Mathematics and Artificial Intelligence
A Logic of Capabilities

LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Applications of the situation calculus to formalizing control-and strategic information: the prolog cut operator

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Introduction to Mathematical Logic

Introduction to Mathematical Logic
What is planning in the presence of sensing?

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
The frame problem and knowledge-producing actions

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence

On the Epistemic Feasibility of Plans in Multiagent Systems Specifications

ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Property persistence in the situation calculus

Artificial Intelligence
A BDI agent programming language with failure handling, declarative goals, and planning

Autonomous Agents and Multi-Agent Systems
Deductive systems' representation and an incompleteness result in the situation calculus

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
A correctness result for reasoning about one-dimensional planning problems

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot, including some actions which return binary sensing information, what goals can be achieved by the robot? The main technical result of the paper is a proof that a simple robot programming language is universal, in that any effectively achievable goal can be achieved by getting the robot to execute one of the robot programs. The significance of this result is at least twofold. First, it is in many ways similar to the equivalence theorem between Turing machines and recursive functions, but applied to robots whose actions are specified by an action theory. Secondly, it provides formal justifications for using the simple robot programming language as a foundation for our work on robotics.