Pages that link to "Item:Q1869751"

The following pages link to Competitive on-line coverage of grid environments by a mobile robot (Q1869751):

Displaying 12 items.

• Worst-case optimal exploration of terrains with obstacles (Q384930) (← links)
• Multi-robot area patrol under frequency constraints (Q693285) (← links)
• A local strategy for cleaning expanding cellular domains by simple robots (Q888433) (← links)
• The giving tree: Constructing trees for efficient offline and online multi-robot coverage (Q1022451) (← links)
• Classifying the multi robot path finding problem into a quadratic competitive complexity class (Q1022454) (← links)
• The simple grid polygon exploration problem (Q2025057) (← links)
• Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
• Fast collaborative graph exploration (Q2347797) (← links)
• An Improved Strategy for Exploring a Grid Polygon (Q3408174) (← links)
• COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS (Q3575385) (← links)
• Potential field hierarchical reinforcement learning approach for target search by multi-AUV in 3-D underwater environments (Q5134313) (← links)
• On-line exploration of rectangular cellular environments with a rectangular hole (Q6195347) (← links)