Home /Research /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

Year
2013
Citations
38

Keywords

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

Related papers

Browse all SWARM papers