An efficient robot planner which generates its own procedures

Authors:
L. Siklossy;J. Dreussi
Affiliations:
Department of Computer Sciences, University of Texas, Austin;Department of Computer Sciences, University of Texas, Austin
Venue:
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Year:
1973

Citing 3
Cited 4

Micro-Planner Reference Manual

Micro-Planner Reference Manual
Modelled Exploration by Robot

Modelled Exploration by Robot
Proving the Impossible Is Impossible, with Applications to Robot Worlds

Proving the Impossible Is Impossible, with Applications to Robot Worlds

Planning and execution in incompletely specified environments

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
A representation for robot plans

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Automatic program synthesis from example problems

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Characterizing abstraction hierarchies for planning

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

LAWALY is a LISP program which solves robot planning problems. Given an axiomatic description of its capabilities in some world, she generates her own procedures to embody these capabilities. She executes these procedures to solve specific tasks in the world. Hierarchies of subtasks guide the search for a solution. In sufficiently large worlds, LAWALY has routinely solved tasks requiring several hundred steps without needing to learn from previous tasks. The times to solution grow usually about linearly with the number of steps in the solution. LAWALY is extensively compared to another robot planner based on a theorem prover.