|
HKUST Institutional Repository >
Computer Science and Engineering >
CSE Journal/Magazine Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1783.1/769
|
| Title: | What robots can do : robot programs and effective achievability |
| Authors: | Lin, Fangzhen
Levesque, Hector |
| Keywords: | Achievability
Robot programs
Robotics |
| Issue Date: | 6-Mar-1998 |
| Citation: | Artificial intelligence, v. 101, no. 1-2, 1998, p. 201-226 |
| 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 two fold. 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. |
| URI: | http://hdl.handle.net/1783.1/769 |
| Appears in Collections: | CSE Journal/Magazine Articles
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| robot.pdf | pre-published version | 159Kb | Adobe PDF | View/Open |
|
All items in this Repository are protected by copyright, with all rights reserved.
|
