43 citations · 81 across the 16 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2024
Sample-and-Bound for Non-Convex Optimization
Yaoguang Zhai, Zhizhen Qin, Sicun Gao
Standard approaches for global optimization of non-convex functions, such as branch-and-bound, maintain partition trees to systematically prune the domain. The tree size grows expo…
cs.AI2023
Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality
Chenning Yu, Qingbiao Li, Sicun Gao +1
Conflict-Based Search is one of the most popular methods for multi-agent path finding. Though it is complete and optimal, it does not scale well. Recent works have been proposed to…