Research map / Graph learning / Graph algorithms and clustering
Near-Optimal Edge Evaluation in Explicit Generalized Binomial Graphs
Sanjiban Choudhury, Shervin Javdani, Siddhartha Srinivasa, Sebastian Scherer
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use Bernoulli Subregion Edge Cutting to choose edge evaluations using priors and expected marginal gain | Candidate-path edge evaluation · 2D Geometric Planning, Forest | normalized evaluation cost: Bernoulli Subregion Edge Cutting: (1.90, 2.46); Set Cover: (3.53, 5.07) | Improved |
| Use Bernoulli Subregion Edge Cutting rather than MaxTally | Synthetic Generalized Binomial Graph · 100 paths | normalized evaluation cost: Bernoulli Subregion Edge Cutting: (1.27, 1.50); MaxTally: (0.68, 1.50) | Hurt |
| Use Bernoulli Subregion Edge Cutting rather than MaxTally | Synthetic Generalized Binomial Graph · 1000 paths | normalized evaluation cost: Bernoulli Subregion Edge Cutting: (0.31, 0.63); MaxTally: (0.63, 1.18) | Improved |
| Constrain candidate tests to the most probable region (ablation) | Bernoulli Subregion Edge Cutting · Synthetic Bernoulli Test, 100 regions | normalized evaluation cost: unconstrained: (1.42, 2.36); MaxProbReg: (0.00, 0.00) | Improved |
| Constrain candidate tests to the most probable region (ablation) | Bernoulli Subregion Edge Cutting · 2D Geometric Planning, Forest | normalized evaluation cost: unconstrained: (1.90, 2.46); MaxProbReg: (0.00, 0.00) | Improved |
| Constrain candidate tests to the most probable region (ablation) | Bernoulli Subregion Edge Cutting · Non-holonomic Path Planning, Forest | normalized evaluation cost: unconstrained: (1.54, 2.46); MaxProbReg: (0.00, 0.00) | Improved |
| Constrain candidate tests to the most probable region (ablation) | Bernoulli Subregion Edge Cutting · 7D Arm Planning, Table | normalized evaluation cost: unconstrained: (0.32, 0.67); MaxProbReg: (0.00, 0.00) | Improved |
Closest papers by meaning
- Large-Scale Multi-Robot Coverage Path Planning via Local Search (AAAI 2024 · similarity 0.84)
- Heterogeneous Multi-Robot Graph Coverage with Proximity and Movement Constraints (AAAI 2025 · similarity 0.84)
- PDPO: Parametric Density Path Optimization (NeurIPS 2025 · similarity 0.83)
- Multi-Robot Motion Planning with Diffusion Models (ICLR 2025 · similarity 0.83)
- BaB-ND: Long-Horizon Motion Planning with Branch-and-Bound and Neural Dynamics (ICLR 2025 · similarity 0.83)
- Inapproximability of Optimal Multi-Agent Pathfinding Problems (AAAI 2025 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
