Competitive disconnection detection in on-line mobile robot navigation

DOI10.1007/978-3-540-68405-3_16zbMATH Open1188.93062OpenAlexW1593977723MaRDI QIDQ3564310FDOQ3564310

Authors: Yoav Gabriely, Elon Rimon 

Publication date: 2 June 2010

Published in: Springer Tracts in Advanced Robotics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68405-3_16

Recommendations

• Competitive complexity of mobile robot on-line motion planning problems
• AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT
• On-line path planning in an unknown polygonal environment
• Classifying the multi robot path finding problem into a quadratic competitive complexity class
• Evasive navigation of an autonomous mobile robot in hostile unknown environments

zbMATH Keywords

navigation algorithm for a disc-shaped mobile roboton-line mobile robot navigationunreachability detection

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Geometric methods (93B27)

Cited In (2)

• Competitive complexity of mobile robot on-line motion planning problems
• Evasive Navigation of an Autonomous Mobile Robot in Hostile Unknown Environments

This page was built for publication: Competitive disconnection detection in on-line mobile robot navigation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564310)