| 2026 | AAAI | Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning. | Jinhao Liang, Sven Koenig, Ferdinando Fioretto |
| 2026 | AAAI | Truncated Counterfactual Learning for Anytime Multi-Agent Path Finding. | Thomy Phan, Shao-Hung Chan, Sven Koenig |
| 2026 | AAAI | Spatially Grouped Curriculum Learning for Multi-Agent Path Finding. | Thomy Phan, Sven Koenig |
| 2026 | AAAI | Multi-Objective Search: Algorithms, Applications, and Emerging Directions. | Oren Salzman, Carlos Hernndez Ulloa, Ariel Felner, Sven Koenig |
| 2026 | AAAI | Deeper Treatment of the Bi-objective Search Framework. | Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Carlos Hernndez Ulloa, Sven Koenig |
| 2026 | KI | Prioritizing Conflicts in Conflict-Based Search with Disjoint Splitting. | Grigorios Mouratidis, Bernhard Nebel, Sven Koenig |
| 2025 | AAAI | Counterfactual Online Learning for Open-Loop Monte-Carlo Planning. | Thomy Phan, Shao-Hung Chan, Sven Koenig |
| 2025 | AAAI | Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic. | Thomy Phan, Benran Zhang, Shao-Hung Chan, Sven Koenig |
| 2025 | ICML | Simultaneous Multi-Robot Motion Planning with Projected Diffusion Models. | Jinhao Liang, Jacob K. Christopher, Sven Koenig, Ferdinando Fioretto |
| 2025 | ICRA | Jointly Assigning Processes to Machines and Generating Plans for Autonomous Mobile Robots in a Smart Factory. | Christopher Leet, Aidan Sciortino, Sven Koenig |
| 2025 | IROS | An Anytime, Scalable and Complete Algorithm for Embedding a Manufacturing Procedure in a Smart Factory. | Christopher Leet, Aidan Sciortino, Sven Koenig |
| 2025 | IROS | RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks. | Yimin Tang, Xiao Xiong, Jingyi Xi, Jiaoyang Li, Erdem Biyik, Sven Koenig |
| 2025 | IROS | Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds. | Yimin Tang, Zhenghong Yu, Jiaoyang Li, Sven Koenig |
| 2025 | SoCS | New Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding. | Shao-Hung Chan, Thomy Phan, Jiaoyang Li, Sven Koenig |
| 2025 | SoCS | A Preprocessing Framework for Efficient Approximate Bi-Objective Shortest-Path Computation in the Presence of Correlated Objectives. | Yaron Halle, Ariel Felner, Sven Koenig, Oren Salzman |
| 2025 | SoCS | You May Split but You Might Work It Out Later: First Steps Toward Merging Nodes in MAPF (Extended Abstract). | Grigorios Mouratidis, Bernhard Nebel, Sven Koenig |
| 2025 | SoCS | RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks (Extended Abstract). | Yimin Tang, Xiao Xiong, Jingyi Xi, Jiaoyang Li, Erdem Biyik, Sven Koenig |
| 2024 | AAAI | Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search. | Thomy Phan, Taoan Huang, Bistra Dilkina, Sven Koenig |
| 2024 | ICAPS | Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths. | Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Sven Koenig |
| 2024 | ICAPS | Map Connectivity and Empirical Hardness of Grid-based Multi-Agent Pathfinding Problem. | Jingyao Ren, Eric Ewing, T. K. Satish Kumar, Sven Koenig, Nora Ayanian |
| 2024 | ICAPS | Efficient Approximate Search for Multi-Objective Multi-Agent Path Finding. | Fangji Wang, Han Zhang, Sven Koenig, Jiaoyang Li |
| 2024 | IJCAI | Theoretical Study on Multi-objective Heuristic Search. | Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernndez Ulloa |
| 2024 | ICRA | Benchmarking Multi-Robot Coordination in Realistic, Unstructured Human-Shared Environments. | Lukas Heuer, Luigi Palmieri, Anna Mannucci, Sven Koenig, Martin Magnusson |
| 2024 | ICTAI | Virtual Network Embedding as Boolean Satisfiability. | Pavel Surynek, Yi Zheng, Erik Kline, Sven Koenig, T. K. Satish Kumar |
| 2024 | SoCS | Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures. | Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernndez Ulloa, Sven Koenig |
| 2024 | SoCS | A-A*pex: Efficient Anytime Approximate Multi-Objective Search. | Han Zhang, Oren Salzman, Ariel Felner, Carlos Hernndez Ulloa, Sven Koenig |
| 2024 | SoCS | Solving Facility Location Problems via FastMap and Locality Sensitive Hashing. | Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar |
| 2024 | SoCS | Fools Rush in Where Angels Fear to Tread in Multi-Goal CBS. | Grigorios Mouratidis, Bernhard Nebel, Sven Koenig |
| 2024 | SoCS | ITA-ECBS: A Bounded-Suboptimal Algorithm for Combined Target-Assignment and Path-Finding Problem. | Yimin Tang, Sven Koenig, Jiaoyang Li |
| 2024 | SoCS | Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations. | Carlos Hernndez Ulloa, Han Zhang, Sven Koenig, Ariel Felner, Oren Salzman |
| 2023 | AAAI | Intersection Coordination with Priority-Based Search for Autonomous Vehicles. | Jiaoyang Li, The Anh Hoang, Eugene Lin, Hai L. Vu, Sven Koenig |
| 2023 | DATE | Co-Design of Topology, Scheduling, and Path Planning in Automated Warehouses. | Christopher Leet, Chanwook Oh, Michele Lora, Sven Koenig, Pierluigi Nuzzo |
| 2023 | ICCCN | Improved Conflict-Based Search for the Virtual Network Embedding Problem. | Yi Zheng, Srivatsan Ravi, Erik Kline, Lincoln Thurlow, Sven Koenig, T. K. Satish Kumar |
| 2023 | IJCAI | Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities. | Oren Salzman, Ariel Felner, Carlos Hernndez, Han Zhang, Shao-Hung Chan, Sven Koenig |
| 2023 | IROS | Task Assignment, Scheduling, and Motion Planning for Automated Warehouses for Million Product Workloads. | Christopher Leet, Chanwook Oh, Michele Lora, Sven Koenig, Pierluigi Nuzzo |
| 2023 | ICRA | A Benchmark for Multi-Robot Planning in Realistic, Complex and Cluttered Environments. | Simon Schaefer, Luigi Palmieri, Lukas Heuer, Rdiger Dillmann, Sven Koenig, Alexander Kleiner |
| 2023 | SoCS | Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding. | Shao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig |
| 2023 | SoCS | Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. | Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernndez Ulloa |
| 2023 | SoCS | Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics. | Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernndez Ulloa, Sven Koenig |
| 2022 | AAAI | MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search. | Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig |
| 2022 | AAAI | Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. | Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig |
| 2022 | AAAI | Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search. | Taoan Huang, Jiaoyang Li, Sven Koenig, Bistra Dilkina |
| 2022 | AAAI | Shard Systems: Scalable, Robust and Persistent Multi-Agent Path Finding with Performance Guarantees. | Christopher Leet, Jiaoyang Li, Sven Koenig |
| 2022 | CHI | (Dis)Appearables: A Concept and Method for Actuated Tangible UIs to Appear and Disappear based on Stages. | Ken Nakagaki, Jordan L. Tappa, Yi Zheng, Jack Forman, Joanne Leong, Sven Koenig, Hiroshi Ishii |
| 2022 | CPAIOR | A FastMap-Based Algorithm for Block Modeling. | Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar |
| 2022 | IROS | Multi-Goal Multi-Agent Pickup and Delivery. | Qinghong Xu, Jiaoyang Li, Sven Koenig, Hang Ma |
| 2022 | ICRA | Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding. | Xinyi Zhong, Jiaoyang Li, Sven Koenig, Hang Ma |
| 2022 | PRIMA | The FastMap Pipeline for Facility Location Problems. | Omkar Thakoor, Ang Li, Sven Koenig, Srivatsan Ravi, Erik Kline, T. K. Satish Kumar |
| 2022 | SoCS | On Merging Agents in Multi-Agent Pathfinding Algorithms. | Eli Boyarski, Shao-Hung Chan, Dor Atzmon, Ariel Felner, Sven Koenig |
| 2022 | SoCS | Multi-Train Path Finding Revisited. | Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig |
| 2022 | SoCS | A Discussion on the Scalability of Heuristic Approximators (Extended Abstract). | Sumedh Pendurkar, Taoan Huang, Sven Koenig, Guni Sharon |
| 2022 | SoCS | Bounded-Cost Bi-Objective Heuristic Search. | Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernndez Ulloa |
| 2022 | SoCS | Which MAPF Model Works Best for Automated Warehousing? | Sumanth Varambally, Jiaoyang Li, Sven Koenig |
| 2022 | SoCS | Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path Finding. | Shuyang Zhang, Jiaoyang Li, Taoan Huang, Sven Koenig, Bistra Dilkina |
| 2022 | SoCS | Mutex Propagation in Multi-Agent Path Finding for Large Agents. | Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig |
| 2022 | SoCS | Anytime Approximate Bi-Objective Search. | Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernndez Ulloa, Sven Koenig |
| 2021 | AAAI | EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding. | Jiaoyang Li, Wheeler Ruml, Sven Koenig |
| 2021 | AAAI | Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. | Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig |
| 2021 | AAAI | f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search. | Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey, Sven Koenig |
| 2021 | AAAI | Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search. | Taoan Huang, Sven Koenig, Bistra Dilkina |
| 2021 | FlAIRS | Hysteresis in Combinatorial Optimization Problems. | Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar |
| 2021 | IJCAI | Anytime Multi-Agent Path Finding via Large Neighborhood Search. | Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig |
| 2021 | SoCS | Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. | Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig |
| 2021 | SoCS | Further Improved Heuristics For Conflict-Based Search. | Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig |
| 2021 | SoCS | ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. | Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig |
| 2021 | SoCS | A Hierarchical Approach to Multi-Agent Path Finding. | Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar, Sven Koenig |
| 2020 | AAAI | Teaching Undergraduate Artificial Intelligence Classes: An Experiment with an Attendance Requirement. | Sven Koenig, Tansel Uras, Liron Cohen |
| 2020 | AAAI | Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers. | Ngai Meng Kou, Cheng Peng, Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2020 | AAAI | Model AI Assignments 2020. | Todd W. Neller, Stephen Keeley, Michael Guerzhoy, Wolfgang Hnig, Jiaoyang Li, Sven Koenig, Ameet Soni, Krista Thomason, Lisa Zhang, Bibin Sebastian, Cinjon Resnick, Avital Oliver, Surya Bhupatiraju, Kumar Krishna Agrawal, James Allingham, Sejong Yoon, Jonathan Chen, Tom Larsen, Marion Neumann, Narges Norouzi, Ryan Hausen, Matthew Evett |
| 2020 | CP | Exact Approaches to the Multi-agent Collective Construction Problem. | Edward Lam, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar |
| 2020 | IJCAI | Multi-Directional Heuristic Search. | Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig |
| 2020 | IJCAI | Iterative-Deepening Conflict-Based Search. | Eli Boyarski, Ariel Felner, Daniel Harabor, Peter J. Stuckey, Liron Cohen, Jiaoyang Li, Sven Koenig |
| 2020 | ISAIM | Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP. | Hong Xu, Kexuan Sun, Sven Koenig, Itay Hen, T. K. Satish Kumar |
| 2020 | ICTAI | Generating the Top $K$ Solutions to Weighted CSPs: A Comparison of Different Approaches. | Ang Li, Yuling Guan, Sven Koenig, Stephan Haas, T. K. Satish Kumar |
| 2020 | PRIMA | Mutex Propagation for SAT-based Multi-agent Path Finding. | Pavel Surynek, Jiaoyang Li, Han Zhang, T. K. Satish Kumar, Sven Koenig |
| 2020 | SoCS | Moving Agents in Formation in Congested Environments. | Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig |
| 2020 | SoCS | New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. | Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig |
| 2020 | SoCS | Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP. | Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar |
| 2020 | SoCS | Multi-Directional Search. | Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig |
| 2020 | SoCS | From Multi-Agent Pathfinding to 3D Pipe Routing. | Gleb Belov, Wenbo Du, Maria Garcia de la Banda, Daniel Harabor, Sven Koenig, Xinrui Wei |
| 2020 | SoCS | Embedding Directed Graphs in Potential Fields Using FastMap-D. | Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar |
| 2020 | SoCS | Toward a String-Pulling Approach to Path Smoothing on Grid Graphs. | Jihee Han, Tansel Uras, Sven Koenig |
| 2020 | SoCS | A Simple and Fast Bi-Objective Search Algorithm. | Carlos Hernndez Ulloa, William Yeoh, Jorge A. Baier, Luis Suazo, Han Zhang, Sven Koenig |
| 2019 | AAAI | Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery. | Hang Ma, Wolfgang Hnig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig |
| 2019 | AAAI | Searching with Consistent Prioritization for Multi-Agent Path Finding. | Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig |
| 2019 | AAAI | Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. | Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig |
| 2019 | AAAI | Multi-Agent Path Finding for Large Agents. | Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2019 | CPAIOR | Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. | Ka-Wa Yip, Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2019 | IJCAI | Regarding Jump Point Search and Subgoal Graphs. | Daniel Damir Harabor, Tansel Uras, Peter J. Stuckey, Sven Koenig |
| 2019 | IJCAI | Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search. | Jiaoyang Li, Ariel Felner, Eli Boyarski, Hang Ma, Sven Koenig |
| 2019 | SoCS | Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery. | Hang Ma, Wolfgang Hnig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig |
| 2019 | SoCS | Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding. | Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig |
| 2019 | SoCS | Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. | Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig |
| 2019 | SoCS | Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results. | Jiaoyang Li, Eli Boyarski, Ariel Felner, Hang Ma, Sven Koenig |
| 2019 | SoCS | Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. | Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig |
| 2019 | SoCS | Multi-Agent Path Finding for Large Agents. | Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2019 | SoCS | Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. | Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Bartk, Eli Boyarski |
| 2019 | SoCS | A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results. | Carlos Hernndez Ulloa, Jorge A. Baier, William Yeoh, Vadim Bulitko, Sven Koenig |
| 2018 | CP | Towards Effective Deep Learning for Constraint Satisfaction Problems. | Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2018 | CPAIOR | A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. | Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar |
| 2018 | IJCAI | Multi-Agent Path Finding with Deadlines. | Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig |
| 2018 | IJCAI | Anytime Focal Search with Applications. | Liron Cohen, Matias Greco, Hang Ma, Carlos Hernndez, Ariel Felner, T. K. Satish Kumar, Sven Koenig |
| 2018 | IJCAI | The FastMap Algorithm for Shortest Path Computations. | Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar |
| 2018 | IJCAI | Understanding Subgoal Graphs by Augmenting Contraction Hierarchies. | Tansel Uras, Sven Koenig |
| 2018 | ICRA | Gradient-Informed Path Smoothing for Wheeled Mobile Robots. | Eric Heiden, Luigi Palmieri, Sven Koenig, Kai Oliver Arras, Gaurav S. Sukhatme |
| 2018 | ISAIM | The FastMap Algorithm for Shortest Path Computations. | Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar |
| 2018 | ISAIM | A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. | Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar |
| 2018 | ISAIM | The Buss Reduction for the k-Weighted Vertex Cover Problem. | Hong Xu, Xin-Zeng Wu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar |
| 2018 | ISAIM | Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems. | Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2018 | ISAIM | Towards Understanding the Min-Sum Message Passing Algorithm for the Minimum Weighted Vertex Cover Problem: An Analytical Approach. | Masaru Nakajima, Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2018 | PRIMA | Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph. | Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2018 | SoCS | Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. | Liron Cohen, Glenn Wagner, David M. Chan, Howie Choset, Nathan R. Sturtevant, Sven Koenig, T. K. Satish Kumar |
| 2018 | SoCS | Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs. | Tansel Uras, Sven Koenig |
| 2018 | SoCS | Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems. | Hong Xu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar |
| 2017 | AAAI | Multi-Agent Path Finding with Delay Probabilities. | Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2017 | CP | A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP. | Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2017 | CPAIOR | The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP. | Hong Xu, T. K. Satish Kumar, Sven Koenig |
| 2017 | IJCAI | Summary: Multi-Agent Path Finding with Kinematic Constraints. | Wolfgang Hnig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig |
| 2017 | SoCS | Feasibility Study: Subgoal Graphs on State Lattices. | Tansel Uras, Sven Koenig |
| 2017 | SoCS | A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. | Hong Xu, T. K. Satish Kumar, Sven Koenig |
| 2016 | AAAI | Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem. | Hang Ma, Craig A. Tovey, Guni Sharon, T. K. Satish Kumar, Sven Koenig |
| 2016 | AAAI | Planning, Scheduling and Monitoring for Airport Surface Operations. | Robert Morris, Corina S. Pasareanu, Kasper Se Luckow, Waqar Malik, Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2016 | CPAIOR | A New Solver for the Minimum Weighted Vertex Cover Problem. | Hong Xu, T. K. Satish Kumar, Sven Koenig |
| 2016 | IJCAI | Bounded Suboptimal Multi-Agent Path Finding Using Highways. | Liron Cohen, Sven Koenig |
| 2016 | IJCAI | Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding. | Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian, Sven Koenig |
| 2016 | ICRA | RRT-based nonholonomic motion planning using any-angle path biasing. | Luigi Palmieri, Sven Koenig, Kai Oliver Arras |
| 2016 | IROS | Formation change for robot groups in occluded environments. | Wolfgang Hnig, T. K. Satish Kumar, Hang Ma, Sven Koenig, Nora Ayanian |
| 2016 | ICTAI | SAGL: A New Heuristic for Multi-Robot Routing with Complex Tasks. | Hong Xu, T. K. Satish Kumar, Dylan Johnke, Nora Ayanian, Sven Koenig |
| 2015 | SoCS | Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path Finding. | Liron Cohen, Tansel Uras, Sven Koenig |
| 2015 | SoCS | The Grid-Based Path Planning Competition: 2014 Entries and Results. | Nathan R. Sturtevant, Jason M. Traish, James R. Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin |
| 2015 | SoCS | An Empirical Comparison of Any-Angle Path-Planning Algorithms. | Tansel Uras, Sven Koenig |
| 2014 | AAAI | A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints. | T. K. Satish Kumar, Duc Thien Nguyen, William Yeoh, Sven Koenig |
| 2014 | AAAI | Identifying Hierarchies for Fast Optimal Search. | Tansel Uras, Sven Koenig |
| 2014 | IROS | A lattice-based approach to multi-robot motion planning for non-holonomic vehicles. | Marcello Cirillo, Tansel Uras, Sven Koenig |
| 2014 | SoCS | Invited Talks. | Sven Koenig, Alexander Reinefeld |
| 2014 | SoCS | Identifying Hierarchies for Fast Optimal Search. | Tansel Uras, Sven Koenig |
| 2013 | AAAI | Simple Temporal Problems with Taboo Regions. | T. K. Satish Kumar, Marcello Cirillo, Sven Koenig |
| 2012 | AAMAS | Time-bounded adaptive A. | Carlos Hernndez, Jorge A. Baier, Tansel Uras, Sven Koenig |
| 2012 | SoCS | Position Paper: Incremental Search Algorithms Considered Poorly Understood. | Carlos Hernndez, Jorge A. Baier, Tansel Uras, Sven Koenig |
| 2012 | SoCS | Paper Summary: Time-Bounded Adaptive A. | Carlos Hernndez, Jorge A. Baier, Tansel Uras, Sven Koenig |
| 2012 | SoCS | Subgoal Graphs for Eight-Neighbor Gridworlds. | Tansel Uras, Sven Koenig, Carlos Hernndez |
| 2011 | IJCAI | Generalized Reaction Functions for Solving Complex-Task Allocation Problems. | Xiaoming Zheng, Sven Koenig |
| 2010 | AAAI | Progress on Agent Coordination with Cooperative Auctions. | Sven Koenig, Pinar Keskinocak, Craig A. Tovey |
| 2010 | AAAI | Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D. | Alex Nash, Sven Koenig, Craig A. Tovey |
| 2010 | AAAI | Sequential Incremental-Value Auctions. | Xiaoming Zheng, Sven Koenig |
| 2010 | AAAI | Market-Based Algorithms for Allocating Complex Tasks. | Xiaoming Zheng, Sven Koenig |
| 2010 | COLT | Open Problem: Analyzing Ant Robot Coverage. | Sven Koenig |
| 2010 | FDG | Implementing games on pinball machines. | Daniel Wong, Darren Earl, Fred Zyda, Ryan Zink, Sven Koenig, Allen Pan, Selby Shlosberg, Jaspreet Singh, Nathan R. Sturtevant |
| 2010 | SoCS | Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D. | Alex Nash, Sven Koenig, Craig A. Tovey |
| 2009 | IJCAI | Algorithms and Complexity Results for Pursuit-Evasion Problems. | Richard B. Borie, Craig A. Tovey, Sven Koenig |
| 2009 | IJCAI | Incremental Phi*: Incremental Any-Angle Path Planning on Grids. | Alex Nash, Sven Koenig, Maxim Likhachev |
| 2009 | IJCAI | Efficient Incremental Search for Moving Target Search. | Xiaoxun Sun, William Yeoh, Sven Koenig |
| 2009 | IJCAI | Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms. | William Yeoh, Xiaoxun Sun, Sven Koenig |
| 2009 | IJCAI | K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems. | Xiaoming Zheng, Sven Koenig |
| 2009 | ICRA | Multi-robot routing with linear decreasing rewards over time. | Ali Ekici, Pinar Keskinocak, Sven Koenig |
| 2009 | IROS | Negotiation with reaction functions for solving complex task allocation problems. | Xiaoming Zheng, Sven Koenig |
| 2008 | AAAI | Agent Coordination with Regret Clearing. | Sven Koenig, Xiaoming Zheng, Craig A. Tovey, Richard B. Borie, Philip Kilby, Vangelis Markakis, Pinar Keskinocak |
| 2007 | AAAI | Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. | Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, Sven Koenig |
| 2007 | AAAI | Theta*: Any-Angle Path Planning on Grids. | Alex Nash, Kenny Daniel, Sven Koenig, Ariel Felner |
| 2007 | IJCAI | Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control. | Sven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz Sungur |
| 2007 | IJCAI | A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources. | Janusz Marecki, Sven Koenig, Milind Tambe |
| 2007 | IJCAI | The Fringe-Saving A* Search Algorithm - A Feasibility Study. | Xiaoxun Sun, Sven Koenig |
| 2007 | IROS | Multi-robot routing with rewards and disjoint time windows. | Justin Melvin, Pinar Keskinocak, Sven Koenig, Craig A. Tovey, Banu Yuksel Ozkaya |
| 2007 | IROS | Robot coverage of terrain with non-uniform traversability. | Xiaoming Zheng, Sven Koenig |
| 2006 | AAAI | The Power of Sequential Single-Item Auctions for Agent Coordination. | Sven Koenig, Craig A. Tovey, Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Adam Meyerson, Sonal Jain |
| 2006 | AAAI | Functional Value Iteration for Decision-Theoretic Planning with General Utility Functions. | Yaxin Liu, Sven Koenig |
| 2006 | IROS | Improving Sequential Single-Item Auctions. | Xiaoming Zheng, Sven Koenig, Craig A. Tovey |
| 2006 | ISAIM | Search for Robot Navigation under Incomplete Information. | Sven Koenig |
| 2006 | SODA | A near-tight approximation lower bound and algorithm for the kidnapped robot problem. | Sven Koenig, Apurva Mudgal, Craig A. Tovey |
| 2005 | AAAI | Risk-Sensitive Planning with One-Switch Utility Functions: Value Iteration. | Yaxin Liu, Sven Koenig |
| 2005 | IJCAI | Limited Discrepancy Beam Search. | David Furcy, Sven Koenig |
| 2005 | IJCAI | Scaling up WA* with Commitment and Diversity. | David Furcy, Sven Koenig |
| 2005 | IROS | Multi-robot forest coverage. | Xiaoming Zheng, Sonal Jain, Sven Koenig, David Kempe |
| 2005 | UAI | Existence and Finiteness Conditions for Risk-Sensitive Planning: Results and Conjectures. | Yaxin Liu, Sven Koenig |
| 2004 | CP | Preprocessing Techniques for Distributed Constraint Optimization. | Syed Muhammad Ali, Sven Koenig, Milind Tambe |
| 2004 | IROS | Simple auctions with performance guarantees for multi-robot task allocation. | Michail G. Lagoudakis, Marc Berhault, Sven Koenig, Pinar Keskinocak, Anton J. Kleywegt |
| 2004 | IROS | PDRRTs: integrating graph-based and cell-based planning. | Ananth Ranganathan, Sven Koenig |
| 2004 | ISAIM | Analysis of Greedy Robot-Navigation Methods. | Apurva Mudgal, Craig A. Tovey, Sven Koenig |
| 2003 | IROS | Robot exploration with combinatorial auctions. | Marc Berhault, H. Huang, Pinar Keskinocak, Sven Koenig, Wedad Elmaghraby, Paul M. Griffin, Anton J. Kleywegt |
| 2003 | IROS | A reactive robot architecture with planning on demand. | Ananth Ranganathan, Sven Koenig |
| 2003 | IROS | Improved analysis of greedy mapping. | Craig A. Tovey, Sven Koenig |
| 2003 | ICRA | Trail-Laying Robots for Robust Terrain Coverage. | Jonas Svennebring, Sven Koenig |
| 2003 | ICRA | Improved analysis of D. | Craig A. Tovey, Sam Greenberg, Sven Koenig |
| 2002 | AAAI | D*Lite. | Sven Koenig, Maxim Likhachev |
| 2002 | AAAI | Speeding Up the Calculation of Heuristics for Heuristic Search-Based Planning. | Yaxin Liu, Sven Koenig, David Furcy |
| 2002 | ICRA | Improved Fast Replanning for Robot Navigation in Unknown Terrain. | Sven Koenig, Maxim Likhachev |
| 2002 | IROS | Incremental replanning for mapping. | Maxim Likhachev, Sven Koenig |
| 2001 | FlAIRS | Probabilistic Planning for Behavior-Based Robots. | Amin Atrash, Sven Koenig |
| 2001 | ICRA | Greedy Mapping of Terrain. | Sven Koenig, Craig A. Tovey, William Halliburton |
| 2001 | IROS | Greedy localization. | Craig A. Tovey, Sven Koenig |
| 2000 | AAAI | Speeding up the Convergence of Real-Time Search. | David Furcy, Sven Koenig |
| 2000 | AAAI | Gridworlds as Testbeds for Planning with Incomplete Information. | Craig A. Tovey, Sven Koenig |
| 1999 | AAAI | Value-Update Rules for Real-Time Search. | Sven Koenig, Boleslaw K. Szymanski |
| 1997 | ICRA | Sensor-based planning with the freespace assumption. | Sven Koenig, Yury V. Smirnov |
| 1996 | AAAI | Agent-Centered Search: Situated Search with Small Look-Ahead. | Sven Koenig |
| 1996 | AAAI | Easy and Hard Testbeds for Real-Time Search Algorithms. | Sven Koenig, Reid G. Simmons |
| 1996 | AAAI | Amelia. | Reid G. Simmons, Sebastian Thrun, Greg Armstrong, Richard Goodwin, Karen Zita Haigh, Sven Koenig, Shyjan Mahamud, Daniel Nikovski, Joseph O'Sullivan |
| 1996 | AAAI | Efficient Goal-Directed Exploration. | Yury V. Smirnov, Sven Koenig, Manuela M. Veloso, Reid G. Simmons |
| 1996 | COLT | Graph Learning with a Nearest Neighbor Approach. | Sven Koenig, Yury V. Smirnov |
| 1996 | ICML | Passive Distance Learning for Robot Navigation. | Sven Koenig, Reid G. Simmons |
| 1996 | ICRA | Unsupervised learning of probabilistic models for robot navigation. | Sven Koenig, Reid G. Simmons |
| 1995 | IJCAI | Real-Time Search in Non-Deterministic Domains. | Sven Koenig, Reid G. Simmons |
| 1995 | IJCAI | Probabilistic Robot Navigation in Partially Observable Environments. | Reid G. Simmons, Sven Koenig |
| 1995 | IROS | Experience with rover navigation for lunar-like terrains. | Reid G. Simmons, Eric Krotkov, Lonnie Chrisman, Fbio Gagliardi Cozman, Richard Goodwin, Martial Hebert, Lalitesh Katragadda, Sven Koenig, Gita Krishnaswamy, Yoshikazu Shinoda, William Whittaker, Paul R. Klarer |
| 1994 | KR | Risk-Sensitive Planning with Probabilistic Decision Graphs. | Sven Koenig, Reid G. Simmons |
| 1993 | AAAI | Complexity Analysis of Real-Time Reinforcement Learning. | Sven Koenig, Reid G. Simmons |