Fujipress Home | Search | About FINDER

Paper:
Language: English:

Taxonomy of Atomic Actions for Home-Service Robots


Hyunseok Kim, Yuchul Jung, and Yong K. Hwang


Digital Media Laboratory, Information and Communications University, Dogok-dong, Gangnam-gu, Seoul 135-854, Korea


Received: October 22, 2004

Accepted: December 25, 2004


Keywords: task classification, planning, monitoring

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.9, No.2 pp. 114-120, 2005

Abstract



In household environments, robots are expected to conduct many tasks. It is difficult, however, to write programs for all tasks beforehand ddue to task diversity and changing environmental conditions. One basic task of developing autonomous multifunctional robots is to define a set of basic robot actions that are executed unambiguously and checked for completion. A task planner then uses these actions to accomplish complex tasks that home-service robots are expected to do. This paper first proposes a set of tasks for first-generation home-service robots, then systematically decomposes them into sequences of smaller but meaningful actions called molecular actions. Molecular actions are then broken down into yet more primitive actions called atomic actions. Because vision, sound, range sensors, and force sensors are the main means of monitoring task progress and ompletion, atomic actions are classified based on the complexities and frequencies of the sensing algorithms used. The resulting taxonomy of atomic actions serves as a set of basic building blocks for a knowledge-based task planner. Its advantages are verified and demonstrated through experiments.
preview Preview (PDF)  full text Full Text (PDF 299KB)

Reference

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here:

adobe reader

Terms and Conditions | Privacy Policy | Recruit | Advertising Information | Contact Us