首页 /研究 /Time-efficient and complete coverage path planning based on flow networks for multi-robots
SWARM

Time-efficient and complete coverage path planning based on flow networks for multi-robots

Adiyabaatar Janchiv, Batsaikhan Dugarjav, Byungsoo Kim, Won Gu Lee, Soon‐Geul Lee

发表年份
2013
引用次数
38

关键词

Node (physics)Path (computing)Any-angle path planningComputer scienceMathematical optimizationMotion planningEnhanced Data Rates for GSM EvolutionPath lengthMinimum-cost flow problemFlow network

相关论文

查看 SWARM 分类全部论文