COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS (Q3575385): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for lawn mowing and milling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Online Algorithm for Improving Performance in Navigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Navigating in Unfamiliar Geometric Terrain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5713497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Navigation in a Room / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive on-line coverage of grid environments by a mobile robot / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polygon Exploration Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths without a map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge versus search: a quantitative analysis using A* / rank
 
Normal rank

Latest revision as of 01:51, 3 July 2024

scientific article
Language Label Description Also known as
English
COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS
scientific article

    Statements