PPaperPicks

Sven Koenig

University of Southern California, Los Angeles, USA

19 papers at tracked venues · 10 at CORE A* · active 2024–2026

DBLP profile ↗ORCID 0000-0002-5458-094X ↗Google Scholar ↗Homepage ↗

Venues

AAAI ×9AAMAS ×3IROS ×3ICRA ×2ICML ×1IJCAI ×1

Frequent coauthors

Thomy Phan
DBLP profile ↗ORCID search ↗
×6
Shawn Skyler
DBLP profile ↗ORCID search ↗
×2
Jinhao Liang
DBLP profile ↗ORCID search ↗
×2
Yimin Tang
DBLP profile ↗ORCID search ↗
×2
Christopher Leet
DBLP profile ↗ORCID search ↗
×2
Oren Salzman
DBLP profile ↗ORCID search ↗
×1
Jingyao Ren
DBLP profile ↗ORCID search ↗
×1
Shao-Hung Chan
DBLP profile ↗ORCID search ↗
×1
Lukas Heuer
DBLP profile ↗ORCID search ↗
×1

Papers

  1. Deeper Treatment of the Bi-objective Search Framework
    AAAI 2026 ·
    Shawn Skyler
    DBLP profile ↗ORCID search ↗
  2. Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning
    AAAI 2026 ·
    Jinhao Liang
    DBLP profile ↗ORCID search ↗
  3. Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026
    AAAI 2026 · Sven Koenig
  4. Multi-Objective Search: Algorithms, Applications, and Emerging Directions
    AAAI 2026 ·
    Oren Salzman
    DBLP profile ↗ORCID search ↗
  5. Spatially Grouped Curriculum Learning for Multi-Agent Path Finding
    AAAI 2026 ·
    Thomy Phan
    DBLP profile ↗ORCID search ↗
  6. Truncated Counterfactual Learning for Anytime Multi-Agent Path Finding
    AAAI 2026 ·
    Thomy Phan
    DBLP profile ↗ORCID search ↗
  7. Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds
    IROS 2025 ·
    Yimin Tang
    DBLP profile ↗ORCID search ↗
  8. An Anytime, Scalable and Complete Algorithm for Embedding a Manufacturing Procedure in a Smart Factory
    IROS 2025 ·
    Christopher Leet
    DBLP profile ↗ORCID search ↗
  9. Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic
    AAAI 2025 ·
    Thomy Phan
    DBLP profile ↗ORCID search ↗
  10. Counterfactual Online Learning for Open-Loop Monte-Carlo Planning
    AAAI 2025 ·
    Thomy Phan
    DBLP profile ↗ORCID search ↗
  11. Empirical Hardness in Multi-Agent Pathfinding: Research Challenges and Opportunities
    AAMAS 2025 ·
    Jingyao Ren
    DBLP profile ↗ORCID search ↗
  12. Jointly Assigning Processes to Machines and Generating Plans for Autonomous Mobile Robots in a Smart Factory
    ICRA 2025 ·
    Christopher Leet
    DBLP profile ↗ORCID search ↗
  13. RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks
    IROS 2025 ·
    Yimin Tang
    DBLP profile ↗ORCID search ↗
  14. Simultaneous Multi-Robot Motion Planning with Projected Diffusion Models
    ICML 2025 ·
    Jinhao Liang
    DBLP profile ↗ORCID search ↗
  15. Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search
    AAAI 2024 ·
    Thomy Phan
    DBLP profile ↗ORCID search ↗
  16. Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search
    AAMAS 2024 ·
    Shao-Hung Chan
    DBLP profile ↗ORCID search ↗
  17. Benchmarking Multi-Robot Coordination in Realistic, Unstructured Human-Shared Environments
    ICRA 2024 ·
    Lukas Heuer
    DBLP profile ↗ORCID search ↗
  18. Confidence-Based Curriculum Learning for Multi-Agent Path Finding
    AAMAS 2024 ·
    Thomy Phan
    DBLP profile ↗ORCID search ↗
  19. Theoretical Study on Multi-objective Heuristic Search
    IJCAI 2024 ·
    Shawn Skyler
    DBLP profile ↗ORCID search ↗