Optimal Multirobot Coverage Path Planning: Ideal-Shaped Spanning Tree
The present paper attempts to find the optimal coverage path for multiple robots in a given area including obstacles. For single robot coverage path planning (CPP) problem, an improved ant colony optimization (ACO) algorithm is proposed to construct the best spanning tree and then obtain the optimal...
Main Authors: | Chunqing Gao, Yingxin Kou, Zhanwu Li, An Xu, You Li, Yizhe Chang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2018-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2018/3436429 |
Similar Items
-
Mathematical Modeling and Intelligent Algorithm for Multirobot Path Planning
by: Jason Gu, et al.
Published: (2017-01-01) -
Dynamic Node Allocation-Based Multirobot Path Planning
by: Wenbo Zhao, et al.
Published: (2021-01-01) -
Subdimensional Expansion: A Framework for Computationally Tractable Multirobot Path Planning
by: Wagner, Glenn
Published: (2015) -
A Modified Pareto Ant Colony Optimization Approach to Solve Biobjective Weapon-Target Assignment Problem
by: You Li, et al.
Published: (2017-01-01) -
Multi-Objective Weapon Target Assignment Based on D-NSGA-III-A
by: Chunqing Gao, et al.
Published: (2019-01-01)