Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSven Koenig
Person information
- affiliation: University of Southern California, Los Angeles, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j59]Carlos Hernández
, William Yeoh, Jorge A. Baier, Han Zhang, Luis Suazo, Sven Koenig, Oren Salzman:
Simple and efficient bi-objective search algorithms via fast dominance checks. Artif. Intell. 314: 103807 (2023)- [j58]Dor Atzmon, Ariel Felner, Jiaoyang Li, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Conflict-tolerant and conflict-free multi-agent meeting. Artif. Intell. 322: 103950 (2023) - [j57]Sanmay Das, Nicholas Mattei, John P. Dickerson, Sven Koenig, Louise A. Dennis, Larry R. Medsker, Ziyu Yao, Anuj Karpatne, Alan Tsang, Matt Luckcuck:
SIGAI Annual Report: July 1 2022 - August 30 2023. AI Matters 9(3): 4-9 (2023) - [c271]Jiaoyang Li, The Anh Hoang, Eugene Lin, Hai L. Vu, Sven Koenig:
Intersection Coordination with Priority-Based Search for Autonomous Vehicles. AAAI 2023: 11578-11585 - [c270]Cheng Ge, Han Zhang, Jiaoyang Li, Sven Koenig:
Cost Splitting for Multi-Objective Conflict-Based Search. ICAPS 2023: 128-137 - [c269]Taoan Huang, Vikas Shivashankar, Michael Caldara, Joseph W. Durham, Jiaoyang Li, Bistra Dilkina, Sven Koenig:
Deadline-Aware Multi-Agent Tour Planning. ICAPS 2023: 189-197 - [c268]Zhongqiang Ren, Jiaoyang Li, Han Zhang, Sven Koenig, Sivakumar Rathinam, Howie Choset:
Binary Branching Multi-Objective Conflict-Based Search for Multi-Agent Path Finding. ICAPS 2023: 361-369 - [c267]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig:
Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies. ICAPS 2023: 452-461 - [c266]Yi Zheng, Hang Ma, Sven Koenig, Erik Kline, T. K. Satish Kumar:
Priority-Based Search for the Virtual Network Embedding Problem. ICAPS 2023: 472-480 - [c265]Christopher Leet, Chanwook Oh, Michele Lora, Sven Koenig, Pierluigi Nuzzo:
Co-Design of Topology, Scheduling, and Path Planning in Automated Warehouses. DATE 2023: 1-6 - [c264]Yi Zheng, Srivatsan Ravi, Erik Kline, Lincoln Thurlow, Sven Koenig, T. K. Satish Kumar:
Improved Conflict-Based Search for the Virtual Network Embedding Problem. ICCCN 2023: 1-10 - [c263]Simon Schaefer, Luigi Palmieri, Lukas Heuer, Rüdiger Dillmann, Sven Koenig, Alexander Kleiner:
A Benchmark for Multi-Robot Planning in Realistic, Complex and Cluttered Environments. ICRA 2023: 9231-9237 - [c262]Oren Salzman, Ariel Felner, Carlos Hernández, Han Zhang, Shao-Hung Chan, Sven Koenig:
Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities. IJCAI 2023: 6759-6768 - [c261]Shao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig:
Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding. SOCS 2023: 11-19 - [c260]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernández Ulloa, Sven Koenig:
Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics. SOCS 2023: 101-109 - [c259]Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. SOCS 2023: 183-184 - [e8]Sven Koenig, Roni Stern, Mauro Vallati:
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, July 8-13, 2023, Prague, Czech Republic. AAAI Press 2023 [contents] - [i42]Christopher Leet, Chanwook Oh, Michele Lora, Sven Koenig, Pierluigi Nuzzo:
Co-Design of Topology, Scheduling, and Path Planning in Automated Warehouses. CoRR abs/2303.01448 (2023) - [i41]John P. Dickerson, Bistra Dilkina, Yu Ding, Swati Gupta, Pascal Van Hentenryck, Sven Koenig, Ramayya Krishnan, Radhika Kulkarni, Catherine Gill, Haley Griffin, Maddy Hunter, Ann Schwartz:
Artificial Intelligence/Operations Research Workshop 2 Report Out. CoRR abs/2304.04677 (2023) - [i40]Hejia Zhang, Shao-Hung Chan, Jie Zhong, Jiaoyang Li, Peter Kolapo, Sven Koenig, Zach Agioutantis, Steven Schafrik, Stefanos Nikolaidis:
Multi-Robot Geometric Task-and-Motion Planning for Collaborative Manipulation Tasks. CoRR abs/2310.08802 (2023) - 2022
- [j56]Michael Fisher, Sven Koenig, Marija Slavkovik:
AI Journal Special Issue on Ethics for Autonomous Systems. Artif. Intell. 305: 103677 (2022) - [j55]Han Zhang, Jiaoyang Li, Pavel Surynek, T. K. Satish Kumar, Sven Koenig:
Multi-agent path finding with mutex propagation. Artif. Intell. 311: 103766 (2022) - [j54]Sanmay Das, Nicholas Mattei, John P. Dickerson, Sven Koenig, Louise A. Dennis, Larry R. Medsker, Ziyu Yao, Anuj Karpatne, Alan Tsang, Matt Luckcuck:
SIGAI Annual Report: July 1 2021 - June 30 2022. AI Matters 8(3): 4-7 (2022) - [j53]Jihee Han, Sven Koenig:
A multiple surrounding point set approach using Theta* algorithm on eight-neighbor grid graphs. Inf. Sci. 582: 618-632 (2022) - [c258]Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. AAAI 2022: 9313-9322 - [c257]Taoan Huang, Jiaoyang Li, Sven Koenig, Bistra Dilkina:
Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search. AAAI 2022: 9368-9376 - [c256]Christopher Leet, Jiaoyang Li, Sven Koenig:
Shard Systems: Scalable, Robust and Persistent Multi-Agent Path Finding with Performance Guarantees. AAAI 2022: 9386-9395 - [c255]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search. AAAI 2022: 10256-10265 - [c254]Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
A*pex: Efficient Approximate Multi-Objective Search on Graphs. ICAPS 2022: 394-403 - [c253]Yi Zheng, Srivatsan Ravi, Erik Kline, Sven Koenig, T. K. Satish Kumar:
Conflict-Based Search for the Virtual Network Embedding Problem. ICAPS 2022: 423-433 - [c252]Han Zhang, Jingkai Chen, Jiaoyang Li, Brian C. Williams, Sven Koenig:
Multi-Agent Path Finding for Precedence-Constrained Goal Sequences. AAMAS 2022: 1464-1472 - [c251]Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar:
FastPivot: An Algorithm for Inverse Problems. CASE 2022: 505-511 - [c250]Hejia Zhang, Shao-Hung Chan, Jie Zhong, Jiaoyang Li, Sven Koenig, Stefanos Nikolaidis:
A MIP-Based Approach for Multi-Robot Geometric Task-and-Motion Planning. CASE 2022: 2102-2109 - [c249]Ken Nakagaki, Jordan L. Tappa, Yi Zheng, Jack Forman, Joanne Leong, Sven Koenig, Hiroshi Ishii:
(Dis)Appearables: A Concept and Method for Actuated Tangible UIs to Appear and Disappear based on Stages. CHI 2022: 506:1-506:13 - [c248]Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
A FastMap-Based Algorithm for Block Modeling. CPAIOR 2022: 232-248 - [c247]Xinyi Zhong, Jiaoyang Li, Sven Koenig, Hang Ma:
Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding. ICRA 2022: 10731-10737 - [c246]Qinghong Xu, Jiaoyang Li, Sven Koenig, Hang Ma:
Multi-Goal Multi-Agent Pickup and Delivery. IROS 2022: 9964-9971 - [c245]Omkar Thakoor, Ang Li, Sven Koenig, Srivatsan Ravi, Erik Kline, T. K. Satish Kumar:
The FastMap Pipeline for Facility Location Problems. PRIMA 2022: 417-434 - [c244]Eli Boyarski, Shao-Hung Chan, Dor Atzmon, Ariel Felner, Sven Koenig:
On Merging Agents in Multi-Agent Pathfinding Algorithms. SOCS 2022: 11-19 - [c243]Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Multi-Train Path Finding Revisited. SOCS 2022: 38-46 - [c242]Sumanth Varambally, Jiaoyang Li, Sven Koenig:
Which MAPF Model Works Best for Automated Warehousing? SOCS 2022: 190-198 - [c241]Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
Anytime Approximate Bi-Objective Search. SOCS 2022: 199-207 - [c240]Shuyang Zhang, Jiaoyang Li, Taoan Huang, Sven Koenig, Bistra Dilkina:
Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path Finding. SOCS 2022: 208-216 - [c239]Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Bounded-Cost Bi-Objective Heuristic Search. SOCS 2022: 239-243 - [c238]Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Mutex Propagation in Multi-Agent Path Finding for Large Agents. SOCS 2022: 249-253 - [c237]Sumedh Pendurkar, Taoan Huang, Sven Koenig, Guni Sharon:
A Discussion on the Scalability of Heuristic Approximators (Extended Abstract). SOCS 2022: 311-313 - [i39]Jingkai Chen, Jiaoyang Li, Yijiang Huang, Caelan Reed Garrett, Dawei Sun, Chuchu Fan, Andreas G. Hofmann, Caitlin Mueller, Sven Koenig, Brian C. Williams:
Cooperative Task and Motion Planning for Multi-Arm Assembly Systems. CoRR abs/2203.02475 (2022) - [i38]Xinyi Zhong, Jiaoyang Li, Sven Koenig, Hang Ma:
Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding. CoRR abs/2208.01222 (2022) - [i37]Qinghong Xu, Jiaoyang Li, Sven Koenig, Hang Ma:
Multi-Goal Multi-Agent Pickup and Delivery. CoRR abs/2208.01223 (2022) - [i36]Sumedh Pendurkar, Taoan Huang, Sven Koenig, Guni Sharon:
The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems. CoRR abs/2209.03393 (2022) - [i35]Hejia Zhang, Shao-Hung Chan, Jie Zhong, Jiaoyang Li, Sven Koenig, Stefanos Nikolaidis:
A MIP-Based Approach for Multi-Robot Geometric Task-and-Motion Planning. CoRR abs/2210.08005 (2022) - [i34]Cheng Ge, Han Zhang, Jiaoyang Li, Sven Koenig:
Cost Splitting for Multi-Objective Conflict-Based Search. CoRR abs/2211.12885 (2022) - 2021
- [j52]James P. Bailey, Alex Nash, Craig A. Tovey, Sven Koenig:
Path-length analysis for grid-based path planning. Artif. Intell. 301: 103560 (2021) - [j51]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Graeme Gange, Sven Koenig:
Pairwise symmetry reasoning for multi-agent path finding search. Artif. Intell. 301: 103574 (2021) - [j50]Sanmay Das, Nicholas Mattei, John P. Dickerson, Sven Koenig, Louise A. Dennis, Larry R. Medsker, Todd W. Neller, Iolanda Leite, Anuj Karpatne, Alan Tsang:
SIGAI annual report: July 1 2020 - June 30 2021. AI Matters 7(3): 5-11 (2021) - [j49]Gerald Steinbauer, Martin Kandlhofer, Tara Chklovski, Fredrik Heintz, Sven Koenig:
Education in Artificial Intelligence K-12. Künstliche Intell. 35(2): 127-129 (2021) - [j48]Gerald Steinbauer, Martin Kandlhofer, Tara Chklovski, Fredrik Heintz, Sven Koenig:
A Differentiated Discussion About AI Education K-12. Künstliche Intell. 35(2): 131-137 (2021) - [j47]Eric Heiden, Luigi Palmieri, Leonard Bruns, Kai Oliver Arras, Gaurav S. Sukhatme, Sven Koenig:
Bench-MR: A Motion Planning Benchmark for Wheeled Mobile Robots. IEEE Robotics Autom. Lett. 6(3): 4536-4543 (2021) - [c236]Taoan Huang, Sven Koenig, Bistra Dilkina:
Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search. AAAI 2021: 11246-11253 - [c235]Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. AAAI 2021: 11272-11281 - [c234]Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey, Sven Koenig:
f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search. AAAI 2021: 12241-12248 - [c233]Jiaoyang Li, Wheeler Ruml, Sven Koenig:
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding. AAAI 2021: 12353-12362 - [c232]Han Zhang, Neelesh Tiruviluamala, Sven Koenig, T. K. Satish Kumar:
Temporal Reasoning with Kinodynamic Networks. ICAPS 2021: 415-425 - [c231]Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. ICAPS 2021: 477-485 - [c230]Taoan Huang, Bistra Dilkina, Sven Koenig:
Learning Node-Selection Strategies in Bounded-Suboptimal Conflict-Based Search for Multi-Agent Path Finding. AAMAS 2021: 611-619 - [c229]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Anytime Multi-Agent Path Finding via Large Neighborhood Search. AAMAS 2021: 1581-1583 - [c228]Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar:
Hysteresis in Combinatorial Optimization Problems. FLAIRS 2021 - [c227]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Anytime Multi-Agent Path Finding via Large Neighborhood Search. IJCAI 2021: 4127-4135 - [c226]Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. SOCS 2021: 159-161 - [c225]Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. SOCS 2021: 179-181 - [c224]Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar, Sven Koenig:
A Hierarchical Approach to Multi-Agent Path Finding. SOCS 2021: 209-211 - [c223]Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Further Improved Heuristics For Conflict-Based Search. SOCS 2021: 213-215 - [i33]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search. CoRR abs/2103.07116 (2021) - [i32]Naveed Haghani, Jiaoyang Li, Sven Koenig, Gautam Kunapuli, Claudio Contardo, Amelia Regan, Julian Yarkony:
Multi-Robot Routing with Time Windows: A Column Generation Approach. CoRR abs/2103.08835 (2021) - 2020
- [j46]Sven Koenig:
What I Wish I Had Known Early in Graduate School but Didn't (and How To Prepare for a Good Job Afterward). AI Mag. 41(1): 90-100 (2020) - [j45]Sanmay Das, Nicholas Mattei, John P. Dickerson, Sven Koenig, Louise A. Dennis, Larry R. Medsker, Todd W. Neller, Iolanda Leite, Anuj Karpatne:
SIGAI annual report: July 1 2019 - June 30 2020. AI Matters 6(2): 5-9 (2020) - [c222]Ngai Meng Kou, Cheng Peng, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers. AAAI 2020: 9925-9932 - [c221]Sven Koenig, Tansel Uras, Liron Cohen:
Teaching Undergraduate Artificial Intelligence Classes: An Experiment with an Attendance Requirement. AAAI 2020: 13374-13380 - [c220]Todd W. Neller, Stephen Keeley, Michael Guerzhoy, Wolfgang Hönig, 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:
Model AI Assignments 2020. AAAI 2020: 13509-13511 - [c219]Dor Atzmon, Roni Stern, Ariel Felner, Nathan R. Sturtevant, Sven Koenig:
Probabilistic Robust Multi-Agent Path Finding. ICAPS 2020: 29-37 - [c218]Carlos Hernández Ulloa, William Yeoh, Jorge A. Baier, Han Zhang, Luis Suazo, Sven Koenig:
A Simple and Fast Bi-Objective Search Algorithm. ICAPS 2020: 143-151 - [c217]Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. ICAPS 2020: 193-201 - [c216]Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar:
Multi-Agent Path Finding with Mutex Propagation. ICAPS 2020: 323-332 - [c215]Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Moving Agents in Formation in Congested Environments. AAMAS 2020: 726-734 - [c214]Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. AAMAS 2020: 1898-1900 - [c213]Edward Lam, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
Exact Approaches to the Multi-agent Collective Construction Problem. CP 2020: 743-758 - [c212]Ang Li, Yuling Guan, Sven Koenig, Stephan Haas, T. K. Satish Kumar:
Generating the Top $K$ Solutions to Weighted CSPs: A Comparison of Different Approaches. ICTAI 2020: 1218-1223 - [c211]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Heuristic Search. IJCAI 2020: 4062-4068 - [c210]Eli Boyarski, Ariel Felner, Daniel Harabor, Peter J. Stuckey, Liron Cohen, Jiaoyang Li, Sven Koenig:
Iterative-Deepening Conflict-Based Search. IJCAI 2020: 4084-4090 - [c209]Hong Xu, Kexuan Sun, Sven Koenig, Itay Hen, T. K. Satish Kumar:
Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP. ISAIM 2020 - [c208]Pavel Surynek, Jiaoyang Li, Han Zhang, T. K. Satish Kumar, Sven Koenig:
Mutex Propagation for SAT-based Multi-agent Path Finding. PRIMA 2020: 248-258 - [c207]Gleb Belov, Wenbo Du, Maria Garcia de la Banda, Daniel Harabor, Sven Koenig, Xinrui Wei:
From Multi-Agent Pathfinding to 3D Pipe Routing. SOCS 2020: 11-19 - [c206]Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
Embedding Directed Graphs in Potential Fields Using FastMap-D. SOCS 2020: 48-56 - [c205]Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar:
Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP. SOCS 2020: 91-100 - [c204]Jihee Han, Tansel Uras, Sven Koenig:
Toward a String-Pulling Approach to Path Smoothing on Grid Graphs. SOCS 2020: 106-110 - [c203]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Search. SOCS 2020: 121-122 - [c202]Carlos Hernández Ulloa, William Yeoh, Jorge A. Baier, Luis Suazo, Han Zhang, Sven Koenig:
A Simple and Fast Bi-Objective Search Algorithm. SOCS 2020: 125-126 - [c201]Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. SOCS 2020: 129-130 - [c200]Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Moving Agents in Formation in Congested Environments. SOCS 2020: 131-132 - [i31]Eric Heiden, Luigi Palmieri, Kai Oliver Arras, Gaurav S. Sukhatme, Sven Koenig:
Experimental Comparison of Global Motion Planning Algorithms for Wheeled Mobile Robots. CoRR abs/2003.03543 (2020) - [i30]Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. CoRR abs/2005.07371 (2020) - [i29]Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
Embedding Directed Graphs in Potential Fields Using FastMap-D. CoRR abs/2006.03112 (2020) - [i28]Naveed Haghani, Jiaoyang Li, Sven Koenig, Gautam Kunapuli, Claudio Contardo, Julian Yarkony:
Integer Programming for Multi-Robot Planning: A Column Generation Approach. CoRR abs/2006.04856 (2020) - [i27]Jiaoyang Li, Wheeler Ruml, Sven Koenig:
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding. CoRR abs/2010.01367 (2020) - [i26]Taoan Huang, Bistra Dilkina, Sven Koenig:
Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search. CoRR abs/2012.06005 (2020)
2010 – 2019
- 2019
- [j44]Sven Koenig, Sanmay Das, Rosemary D. Paradis, John P. Dickerson, Yolanda Gil, Katherine Guo, Benjamin Kuipers, Iolanda Leite, Hang Ma, Nicholas Mattei, Amy McGovern, Larry R. Medsker, Todd W. Neller, Marion Neumann, Plamen Petrov, Michael Rovatsos, David G. Stork:
ACM SIGAI activity report. AI Matters 5(3): 6-11 (2019) - [j43]Guillaume Sartoretti, Justin Kerr, Yunfei Shi, Glenn Wagner, T. K. Satish Kumar, Sven Koenig, Howie Choset:
PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning. IEEE Robotics Autom. Lett. 4(3): 2378-2385 (2019) - [c199]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. AAAI 2019: 6087-6095 - [c198]Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. AAAI 2019: 7627-7634 - [c197]Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Searching with Consistent Prioritization for Multi-Agent Path Finding. AAAI 2019: 7643-7650 - [c196]Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery. AAAI 2019: 7651-7658 - [c195]Pavel Surynek, T. K. Satish Kumar, Sven Koenig:
Multi-agent Path Finding with Capacity Constraints. AI*IA 2019: 235-249 - [c194]