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. 1707.00228
  4. Cited By
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem
  to Suboptimal Variants

Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants

2 July 2017
Pavel Surynek
Ariel Felner
Roni Stern
Eli Boyarski
    OT
ArXiv (abs)PDFHTML

Papers citing "Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants"

4 / 4 papers shown
Title
Graph-Based Multi-Robot Path Finding and Planning
Graph-Based Multi-Robot Path Finding and Planning
Hang Ma
AI4CE
70
31
0
22 Jun 2022
Loosely Synchronized Search for Multi-agent Path Finding with
  Asynchronous Actions
Loosely Synchronized Search for Multi-agent Path Finding with Asynchronous Actions
Z. Ren
Sivakumar Rathinam
Howie Choset
52
13
0
08 Mar 2021
Subdimensional Expansion for Multi-objective Multi-agent Path Finding
Subdimensional Expansion for Multi-objective Multi-agent Path Finding
Z. Ren
Sivakumar Rathinam
Howie Choset
62
24
0
02 Feb 2021
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
Jiaoyang Li
Wheeler Ruml
Sven Koenig
112
173
0
03 Oct 2020
1