Single robot search for a stationary object in an unknown environment
In This article we introduce The problem of finding an optimal path in order To find a stationary object placed in The environment whose map is not a-priory known. At first sight The problem seems To be similar To exploration which has been Thoroughly studied by The robotic community. We show That a...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | CONF |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_10504729_v_n_p5830_Kulich |
| Aporte de: |
| id |
todo:paper_10504729_v_n_p5830_Kulich |
|---|---|
| record_format |
dspace |
| spelling |
todo:paper_10504729_v_n_p5830_Kulich2023-10-03T16:00:27Z Single robot search for a stationary object in an unknown environment Kulich, M. Preučil, L. Bront, J.J.M. In This article we introduce The problem of finding an optimal path in order To find a stationary object placed in The environment whose map is not a-priory known. At first sight The problem seems To be similar To exploration which has been Thoroughly studied by The robotic community. We show That a general framework for search can be derived from frontier-based exploration, but exploration strategies for selection of a next goal To which navigate a robot cannot be simply reused. We present Three goal selection strategies (greedy, Traveling salesmen based, and Traveling deliveryman based) and statistically evaluate and discuss Their performance for search in comparison To exploration. © 2014 IEEE. CONF info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_10504729_v_n_p5830_Kulich |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| description |
In This article we introduce The problem of finding an optimal path in order To find a stationary object placed in The environment whose map is not a-priory known. At first sight The problem seems To be similar To exploration which has been Thoroughly studied by The robotic community. We show That a general framework for search can be derived from frontier-based exploration, but exploration strategies for selection of a next goal To which navigate a robot cannot be simply reused. We present Three goal selection strategies (greedy, Traveling salesmen based, and Traveling deliveryman based) and statistically evaluate and discuss Their performance for search in comparison To exploration. © 2014 IEEE. |
| format |
CONF |
| author |
Kulich, M. Preučil, L. Bront, J.J.M. |
| spellingShingle |
Kulich, M. Preučil, L. Bront, J.J.M. Single robot search for a stationary object in an unknown environment |
| author_facet |
Kulich, M. Preučil, L. Bront, J.J.M. |
| author_sort |
Kulich, M. |
| title |
Single robot search for a stationary object in an unknown environment |
| title_short |
Single robot search for a stationary object in an unknown environment |
| title_full |
Single robot search for a stationary object in an unknown environment |
| title_fullStr |
Single robot search for a stationary object in an unknown environment |
| title_full_unstemmed |
Single robot search for a stationary object in an unknown environment |
| title_sort |
single robot search for a stationary object in an unknown environment |
| url |
http://hdl.handle.net/20.500.12110/paper_10504729_v_n_p5830_Kulich |
| work_keys_str_mv |
AT kulichm singlerobotsearchforastationaryobjectinanunknownenvironment AT preucill singlerobotsearchforastationaryobjectinanunknownenvironment AT brontjjm singlerobotsearchforastationaryobjectinanunknownenvironment |
| _version_ |
1782024313706119168 |