Pages that link to "Item:Q1022450"
From MaRDI portal
The following pages link to Efficient Boustrophedon multi-robot coverage: An algorithmic approach (Q1022450):
Displaying 12 items.
- An innovative multi-agent search-and-rescue path planning approach (Q337250) (← links)
- Static target search path planning optimization with heterogeneous agents (Q512934) (← links)
- An information theoretic based integer linear programming approach for the discrete search path planning problem (Q895784) (← links)
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage (Q1022451) (← links)
- Efficient exploration of unknown indoor environments using a team of mobile robots (Q1022458) (← links)
- Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm (Q1022474) (← links)
- Optimal multirobot coverage path planning: ideal-shaped spanning tree (Q1720765) (← links)
- An evolutionary approach for the target search problem in uncertain environment (Q2331590) (← links)
- An MILP approach for persistent coverage tasks with multiple robots and performance guarantees (Q2667534) (← links)
- Complete distributed coverage of rectilinear environments (Q2749769) (← links)
- Unifying Geometric, Probabilistic, and Potential Field Approaches to Multi-robot Coverage Control (Q2914897) (← links)
- Coverage path planning algorithms for agricultural field machines (Q3394266) (← links)