COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS

DOI10.1142/S0218195910003293zbMath1245.68224MaRDI QIDQ3575385

Yoav Gabriely, Elon Rimon

Publication date: 27 July 2010

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

zbMATH Keywords

mobile roboton-line motion planningcompetitive complexity

Mathematics Subject Classification ID

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

Related Items (2)

Reaching a target in the plane with no information ⋮ Classifying the multi robot path finding problem into a quadratic competitive complexity class

Cites Work

• Unnamed Item
• Searching in the plane
• Shortest paths without a map
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
• Knowledge versus search: a quantitative analysis using A*
• Approximation algorithms for lawn mowing and milling
• Competitive on-line coverage of grid environments by a mobile robot
• The Polygon Exploration Problem
• Online Navigation in a Room
• Navigating in Unfamiliar Geometric Terrain
• An Online Algorithm for Improving Performance in Navigation
• Hamilton Paths in Grid Graphs

This page was built for publication: COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS