Form of presentation | Conference proceedings in international journals and collections |
Year of publication | 2004 |
Язык | английский |
|
Magid Evgeniy Arkadevich, author
|
Bibliographic description in the original language |
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. |
Annotation |
Proceedings of 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2004) |
Keywords |
Robot sensing systems, Navigation, Motion planning, Convergence, Path planning, Algorithm design and analysis, Mathematics, Layout, Mobile robots, Cleaning |
The name of the journal |
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 |
Please use this ID to quote from or refer to the card |
https://repository.kpfu.ru/eng/?p_id=149734&p_lang=2 |
Resource files | |
|
Full metadata record ![](https://shelly.kpfu.ru/pdf/picture/arrow_black_right.gif) |
Field DC |
Value |
Language |
dc.contributor.author |
Magid Evgeniy Arkadevich |
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/eng/?p_id=149734&p_lang=2 |
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 |
Conference proceedings in international journals and collections |
ru_RU |
|