Multidimensional online motion planning for a spherical robot

DOI10.1142/S0218195910003475MaRDI QIDQ3070042zbMATH OpenFDO

Authors Josh Brown Kramer, Lucas Sabalka

Publication date 2 February 2011

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195910003475

zbMATH Keywords

competitivenessmultidimensional navigationrobot motion

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27) Robot dynamics and control of rigid bodies (70E60)

Recommendations

• Competitive complexity of mobile robot on-line motion planning problems
• Classifying the multi robot path finding problem into a quadratic competitive complexity class
• AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT
• A competitive analysis of algorithms for searching unknown scenes
• Models and algorithms for online exploration and search.

Cites work

• Areas of level sets of distance functions induced by asymmetric norms
• Navigating in Unfamiliar Geometric Terrain
• Online algorithms. The state of the art
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
• Planning Algorithms
• Searching in the plane
• Shortest paths without a map

Cited in

(1)

• Competitive complexity of mobile robot on-line motion planning problems

This page was built for publication: Multidimensional online motion planning for a spherical robot

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