z-logo
open-access-imgOpen Access
Active object search using a pyramid approach to determine the next-best-view
Author(s) -
Karen-Lizbeth Flores-Rodriguez,
Felipe Trujillo-Romero,
José-Joel González-Barbosa
Publication year - 2022
Publication title -
international journal of robotics and automation (ijra)/iaes international journal of robotics and automation
Language(s) - English
Resource type - Journals
eISSN - 2722-2586
pISSN - 2089-4856
DOI - 10.11591/ijra.v11i1.pp70-88
Subject(s) - artificial intelligence , pyramid (geometry) , computer science , robotics , object (grammar) , computer vision , service robot , feature (linguistics) , robot , segmentation , service (business) , perception , mathematics , linguistics , philosophy , geometry , economy , neuroscience , economics , biology
The development of service robotics continues to arouse interest in the scientific community due to the complexity of the activities performed like interaction in human environments, identifying and manipulating objects, and even learning by themselves. This paper proposed to improve the perception of the environment by searching for objects in service robotics tasks. We present the development and implementation of an active object search method based on three main phases: Firstly, image pyramid segmentation to examine in detail the im- age features. Second step, object detection at each level of the pyramid through a local feature descriptor and a mutual information calculation. Finally, the next camera position selection through analyzing the object detections accumulation in the pyramid. To evaluate the implementation of the proposed method, we use a NAO robot in a familiar place for humans, such as an office or a home. Ordinary objects are part of our database with the premise that a robot must know them before looking for an object. The results in the experiments showed an acceptable performance in simulation and with a real platform.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here