.png){kind=icon}
.png){kind=icon}
Return
Distributed Multi-Agent Coverage Path Planning Over Graphs With Relaxed Priority Rule
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2024.3408165.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the distributed coverage path planning problem over graphs with relaxed priority rule considering heterogeneity of the agents involved. Since the underlying problem is NP-hard, its convex relaxation is formulated to give an approximated optimal path. It is shown that the convex relaxation problem is of the form of a distributed optimization with coupled constraints. A fully parallel distributed (offline) algorithm is proposed to find an approximated optimal path of each agent under synchronous protocol. Since the algorithm is fully parallel, the time per iteration of each agent is significantly reduced. The theoretical results are demonstrated by an application to monitor and collect data in important areas of a large field. Finally, two numerical examples are provided in order to demonstrate the efficacy of the proposed method and its advantages.
Keywords:
Costs
Optimization
Robots
Vectors
Path planning
Task analysis
Approximation algorithms
Distributed coverage path planning
multi-agent systems
graphs
relaxed priority rule
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W
