Competitive complexity of mobile robot on-line motion planning problems
From MaRDI portal
Publication:3575385
DOI10.1142/S0218195910003293zbMATH Open1245.68224MaRDI QIDQ3575385FDOQ3575385
Authors: Yoav Gabriely, Elon Rimon 
Publication date: 27 July 2010
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
- Classifying the multi robot path finding problem into a quadratic competitive complexity class
- A competitive analysis of algorithms for searching unknown scenes
- Competitive disconnection detection in on-line mobile robot navigation
- AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT
- Multidimensional online motion planning for a spherical robot
Online algorithms; streaming algorithms (68W27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Robot dynamics and control of rigid bodies (70E60)
Cites Work
- Searching in the plane
- Navigating in Unfamiliar Geometric Terrain
- Hamilton Paths in Grid Graphs
- Shortest paths without a map
- The polygon exploration problem
- Title not available (Why is that?)
- Competitive on-line coverage of grid environments by a mobile robot
- Online Navigation in a Room
- Approximation algorithms for lawn mowing and milling
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- An Online Algorithm for Improving Performance in Navigation
- Knowledge versus search: a quantitative analysis using A*
Cited In (8)
- A competitive analysis of algorithms for searching unknown scenes
- Title not available (Why is that?)
- Competitive disconnection detection in on-line mobile robot navigation
- Classifying the multi robot path finding problem into a quadratic competitive complexity class
- Reaching a target in the plane with no information
- On finding the complexity of an environment for the operation of a mobile object on a plane
- Multidimensional online motion planning for a spherical robot
- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
This page was built for publication: Competitive complexity of mobile robot on-line motion planning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575385)
