Competitive complexity of mobile robot on-line motion planning problems
From MaRDI portal
Publication:3575385
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
Cites work
- scientific article; zbMATH DE number 2238822 (Why is no real title available?)
- An Online Algorithm for Improving Performance in Navigation
- Approximation algorithms for lawn mowing and milling
- Competitive on-line coverage of grid environments by a mobile robot
- Hamilton Paths in Grid Graphs
- Knowledge versus search: a quantitative analysis using A*
- Navigating in Unfamiliar Geometric Terrain
- Online Navigation in a Room
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- Searching in the plane
- Shortest paths without a map
- The polygon exploration problem
Cited in
(8)- A competitive analysis of algorithms for searching unknown scenes
- scientific article; zbMATH DE number 2085302 (Why is no real title available?)
- 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)