CB-GCS: Conflict-Based Search on the Graph of Convex Sets for Multi-Agent Motion Planning | NSF Public Access Repository

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Citation Details

This content will become publicly available on August 17, 2026

CB-GCS: Conflict-Based Search on the Graph of Convex Sets for Multi-Agent Motion Planning

Award ID(s):: 2120219

PAR ID:: 10640822

Author(s) / Creator(s):: Zhao, Shizhe ; Philip, Allen George ; Rathinam, Sivakumar ; Choset, Howie ; Ren, Zhongqiang

Publisher / Repository:: IEEE

Date Published:: 2025-08-17

Page Range / eLocation ID:: 2208 to 2214

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
This content will become publicly available on August 17, 2026
Conference Paper:
https://doi.org/10.1109/CASE58245.2025.11164133