Average case constant factor time and distance optimal multi-robot path planning in well-connected environments.

Published in: Auton. Robots (2020)

Keyphrases

average case
constant factor
worst case
robot path planning
approximation algorithms
lower bound
worst case analysis
upper bound
np hard
greedy algorithm
sample complexity
vc dimension
uniform distribution
online algorithms
computational complexity
path planning
special case
data sets
active learning