ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2109.08185
  4. Cited By
Optimal Partitioning of Non-Convex Environments for Minimum Turn
  Coverage Planning
v1v2v3 (latest)

Optimal Partitioning of Non-Convex Environments for Minimum Turn Coverage Planning

16 September 2021
Megnath Ramesh
Frank Imeson
B. Fidan
Stephen L. Smith
ArXiv (abs)PDFHTML

Papers citing "Optimal Partitioning of Non-Convex Environments for Minimum Turn Coverage Planning"

2 / 2 papers shown
Title
Large-Scale Multirobot Coverage Path Planning on Grids With Path Deconfliction
Large-Scale Multirobot Coverage Path Planning on Grids With Path Deconfliction
Jingtao Tang
Zining Mao
Hang Ma
111
1
0
03 Nov 2024
TMSTC*: A Turn-minimizing Algorithm For Multi-robot Coverage Path
  Planning
TMSTC*: A Turn-minimizing Algorithm For Multi-robot Coverage Path Planning
Junjie Lu
Bi Zeng
Jing Tang
Tin Lun Lam
55
6
0
05 Dec 2022
1