| Форма представления | Тезисы и материалы конференций в зарубежных журналах и сборниках |
| Год публикации | 2004 |
| Язык | английский |
|
Магид Евгений Аркадьевич, автор
|
| Библиографическое описание на языке оригинала |
Magid E., Rivlin E. CAUTIOUSBUG: A Competitive Algorithm for Sensory-Based Robot Navigation // 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2004) (Sendai, Japan; 28 September - 2 October 2004) - p. 2757-2762. |
| Аннотация |
Proceedings of 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2004) |
| Ключевые слова |
Robot sensing systems, Navigation, Motion planning, Convergence, Path planning, Algorithm design and analysis, Mathematics, Layout, Mobile robots, Cleaning |
| Название журнала |
Proceedings of 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2004)
|
| URL |
http://www.cs.technion.ac.il/~ehudr/publications/pdf/MagidR04i.pdf |
| Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на эту карточку |
https://repository.kpfu.ru/?p_id=149734 |
| Файлы ресурса | |
|
|
Полная запись метаданных  |
| Поле DC |
Значение |
Язык |
| dc.contributor.author |
Магид Евгений Аркадьевич |
ru_RU |
| dc.date.accessioned |
2004-01-01T00:00:00Z |
ru_RU |
| dc.date.available |
2004-01-01T00:00:00Z |
ru_RU |
| dc.date.issued |
2004 |
ru_RU |
| dc.identifier.citation |
Magid E., Rivlin E. CAUTIOUSBUG: A Competitive Algorithm for Sensory-Based Robot Navigation // 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2004) (Sendai, Japan; 28 September - 2 October 2004) - p. 2757-2762. |
ru_RU |
| dc.identifier.uri |
https://repository.kpfu.ru/?p_id=149734 |
ru_RU |
| dc.description.abstract |
Proceedings of 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2004) |
ru_RU |
| dc.description.abstract |
Bug algorithms are a class of popular algorithms for autonomous robot navigation in unknown environments with local information. Very natural, with low memory requirements, Bug strategies do not yet allow any competitive analysis. The bound on the robot's path changes from scene to scene depending on the obstacles, even though a new obstacle may not alter the length of the shortest path. We propose a new competitive algorithm, CautiousBug, whose competitive factor has an order of O(d/sup m-1/), where d is the length of the optimal path from starting point S to a target point T. m = 2/sup #Min-1/ and #Min denote the number of the distance function isolated local minima points in the given environment. Simulations were performed to study the average competitive factor of the algorithm. |
ru_RU |
| dc.language.iso |
ru |
ru_RU |
| dc.subject |
Robot sensing systems |
ru_RU |
| dc.subject |
Navigation |
ru_RU |
| dc.subject |
Motion planning |
ru_RU |
| dc.subject |
Convergence |
ru_RU |
| dc.subject |
Path planning |
ru_RU |
| dc.subject |
Algorithm design and analysis |
ru_RU |
| dc.subject |
Mathematics |
ru_RU |
| dc.subject |
Layout |
ru_RU |
| dc.subject |
Mobile robots |
ru_RU |
| dc.subject |
Cleaning |
ru_RU |
| dc.title |
CAUTIOUSBUG: A Competitive Algorithm for Sensory-Based Robot Navigation |
ru_RU |
| dc.type |
Тезисы и материалы конференций в зарубежных журналах и сборниках |
ru_RU |
|
EN 
中文 
ES 
Карта сайта
