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. 2303.00745
  4. Cited By
Coordination of Multiple Robots along Given Paths with Bounded Junction
  Complexity

Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity

1 March 2023
Mikkel Abrahamsen
Tzvika Geft
Dan Halperin
Barak Ugav
ArXivPDFHTML

Papers citing "Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity"

2 / 2 papers shown
Title
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids
Tzvika Geft
24
3
0
25 May 2023
Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and
  Planning Algorithms
Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms
Jingjin Yu
Daniela Rus
LRM
51
61
0
23 May 2012
1