文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Experimental data driven robot for pattern classification
侵权投诉

Experimental data driven robot for pattern classification

In this paper the problem whether or not a human being can plan a tour for a mobile robot with a camera so that all changes in the room are detected within a time limit is investigated. A tour simulator and a game based on it are developed. The plan of the

Experimental data driven robot for pattern classification

Experimental data driven robot for pattern classification

Annales UMCS Informatica AI 3 (2005) 263-271

Annales UMCS Informatica

Lublin-Polonia Sectio AI

doc.guandang.net

Experimental data driven robot for pattern classification

Krzysztof Sapiecha, Barbara ukawska*, Pawe Paduch

Department of Computer Science, University of Technology, Al. 1000-lecia Państwa Polskiego, 25-314 Kielce, Poland

Abstract

In this paper the problem whether or not a human being can plan a tour for a mobile robot with a camera so that all changes in the room are detected within a time limit is investigated. A tour simulator and a game based on it are developed. The plan of the winner of the game is used for a driving real robot. It is shown that this plan is two times shorter (as Java bytecode for Lego RCX) than the average one.

1. Introduction

Most today guarding systems use stationary cameras and mobile guards. However, while cameras are getting better and cheaper guards are still unreliable and very expensive. It is almost certain that in the near future mobile robots equipped with cameras will replace today guarding systems. In this new approach the robot will acquire information and also process it [1-5]. To do this effectively the robot should properly tour the area it guards and correctly classify patterns it sees.

Visibility-based problems of surveying, guarding, or searching have a long history in the area of computational optimization. Determining of minimum stationary cameras for guarding a region is the well-known art gallery problem [6]. The watchman problem [7] is to find the shortest tour along which one the mobile guard can see the entire region. If the region is unknown in advance, we are faced with the online watchman problem. All these problems are NP-hard [5].

In the paper an efficient method of planning a tour for a mobile robot in a room (including positions where pictures should be taken), so that all changes in the room are detected within a time limit is presented. The method is based on an experiment in which human intuition and perceptivity are involved. In section 2 the problem is formulated. Section 3 describes the method we use to solve the

*

Corresponding author: e-mail address: b.lukawska@tu.kielce.pl

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email