Better Upper Bounds for Searching on a Line with Byzantine Robots.
Xiaoming SunYuan SunJialin ZhangPublished in: Complexity and Approximation (2020)
Keyphrases
- upper bound
- lower bound
- fault tolerant
- mobile robot
- upper and lower bounds
- cooperative
- lower and upper bounds
- branch and bound algorithm
- tactile sensing
- tight bounds
- multi robot
- robotic systems
- branch and bound
- line segments
- worst case
- efficiently computable
- upper bounding
- generalization error
- autonomous robots
- sample complexity
- human robot interaction
- robot soccer
- np hard
- search and rescue
- genetic algorithm