GitHub - NESTLab/mrpcp: Optimal solution for persistence coverage problem

NESTLab / mrpcp Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

Optimal solution for persistence coverage problem

2 stars 0 forks Branches Tags Activity

Notifications

Name	Name	Last commit message	Last commit date
Latest commit History 29 Commits
README.md	README.md
main.m	main.m
map.m	map.m

Repository files navigation

MILP formulation of Multi-Robot Long-Term Persistent Coverage Problem

Linear Constraints

Same as the constraints in the paper, except for Equation 13:

$\sum_{j\in N \backslash{i}} (p_{ji}^k - p_{ij}^k) = 0 \hspace{0.5in} \forall i \in D \backslash Bk, k\in K$

Reference:

D. Mitchell, M. Corah, N. Chakraborty, K. Sycara and N. Michael, "Multi-robot long-term persistent coverage with fuel constrained robots," 2015 IEEE International Conference on Robotics and Automation (ICRA), Seattle, WA, 2015, pp. 1093-1099

About

Optimal solution for persistence coverage problem

persistence routing milp multi-robot swarm-robotics

Custom properties

Report repository

Releases

No releases published

Packages

No packages published

Languages

MATLAB 100.0%