You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Treat every straight segment as a node in the GTSP as in
Bochkarev, Stanislav, and Stephen L. Smith. "On minimizing turns in robot coverage path planning." 2016 IEEE International Conference on Automation Science and Engineering (CASE). IEEE, 2016.
or
Lewis, Jeremy S., et al. "Semi-boustrophedon coverage with a dubins vehicle." 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2017.
This may be computationally more elaborate but would fix the overlapping segments at the border between cells and find even shorter coverage paths.
The text was updated successfully, but these errors were encountered:
Treat every straight segment as a node in the GTSP as in
or
This may be computationally more elaborate but would fix the overlapping segments at the border between cells and find even shorter coverage paths.
The text was updated successfully, but these errors were encountered: