首页 /研究 /Filling Arbitrary Connected Areas by Silent Robots with Minimum Visibility Range
OTHER

Filling Arbitrary Connected Areas by Silent Robots with Minimum Visibility Range

Attila Hideg, Tamás Lukovszki, Bertalan Forstner

发表年份
2019
引用次数
11

关键词

RobotComputer scienceVisibilityRange (aeronautics)Visibility graphGraphCombinatoricsDiscrete mathematicsAlgorithmTheoretical computer science

相关论文

查看 OTHER 分类全部论文