Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDSven Koenig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 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) - [c234]Taoan Huang, Sven Koenig, Bistra Dilkina:
Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search. AAAI 2021: 11246-11253 - [c233]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 - [c232]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 - [c231]Jiaoyang Li, Wheeler Ruml, Sven Koenig:
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding. AAAI 2021: 12353-12362 - [c230]Han Zhang, Neelesh Tiruviluamala, Sven Koenig, T. K. Satish Kumar:
Temporal Reasoning with Kinodynamic Networks. ICAPS 2021: 415-425 - [c229]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 - [c228]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 - [c227]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Anytime Multi-Agent Path Finding via Large Neighborhood Search. AAMAS 2021: 1581-1583 - [c226]Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar:
Hysteresis in Combinatorial Optimization Problems. FLAIRS Conference 2021 - [c225]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Anytime Multi-Agent Path Finding via Large Neighborhood Search. IJCAI 2021: 4127-4135 - [c224]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 - [c223]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 - [c222]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 - [c221]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) - [c220]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 - [c219]Sven Koenig, Tansel Uras, Liron Cohen:
Teaching Undergraduate Artificial Intelligence Classes: An Experiment with an Attendance Requirement. AAAI 2020: 13374-13380 - [c218]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 - [c217]Dor Atzmon, Roni Stern, Ariel Felner, Nathan R. Sturtevant, Sven Koenig:
Probabilistic Robust Multi-Agent Path Finding. ICAPS 2020: 29-37 - [c216]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 - [c215]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 - [c214]Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar:
Multi-Agent Path Finding with Mutex Propagation. ICAPS 2020: 323-332 - [c213]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 - [c212]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 - [c211]Edward Lam, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
Exact Approaches to the Multi-agent Collective Construction Problem. CP 2020: 743-758 - [c210]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 - [c209]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan Sturtevant, Sven Koenig:
Multi-Directional Heuristic Search. IJCAI 2020: 4062-4068 - [c208]Eli Boyarski, Ariel Felner, Daniel Harabor, Peter J. Stuckey, Liron Cohen, Jiaoyang Li, Sven Koenig:
Iterative-Deepening Conflict-Based Search. IJCAI 2020: 4084-4090 - [c207]Hong Xu, Kexuan Sun, Sven Koenig, Itay Hen, T. K. Satish Kumar:
Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP. ISAIM 2020 - [c206]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 - [c205]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 - [c204]Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
Embedding Directed Graphs in Potential Fields Using FastMap-D. SOCS 2020: 48-56 - [c203]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 - [c202]Jihee Han, Tansel Uras, Sven Koenig:
Toward a String-Pulling Approach to Path Smoothing on Grid Graphs. SOCS 2020: 106-110 - [c201]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan Sturtevant, Sven Koenig:
Multi-Directional Search. SOCS 2020: 121-122 - [c200]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 - [c199]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 - [c198]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) - [c197]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 - [c196]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 - [c195]Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Searching with Consistent Prioritization for Multi-Agent Path Finding. AAAI 2019: 7643-7650 - [c194]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 - [c193]Pavel Surynek, T. K. Satish Kumar, Sven Koenig:
Multi-agent Path Finding with Capacity Constraints. AI*IA 2019: 235-249 - [c192]Jiaoyang Li, Ariel Felner, Sven Koenig, T. K. Satish Kumar:
Using FastMap to Solve Graph Problems in a Euclidean Space. ICAPS 2019: 273-278 - [c191]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search. ICAPS 2019: 279-283 - [c190]Minghua Liu, Hang Ma, Jiaoyang Li, Sven Koenig:
Task and Path Planning for Multi-Agent Pickup and Delivery. AAMAS 2019: 1152-1160 - [c189]Jiangxing Wang, Jiaoyang Li, Hang Ma, Sven Koenig, T. K. Satish Kumar:
A New Constraint Satisfaction Perspective on Multi-Agent Path Finding: Preliminary Results. AAMAS 2019: 2253-2255 - [c188]Ka Wa Yip, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. CPAIOR 2019: 643-660 - [c187]Jiaoyang Li, Ariel Felner, Eli Boyarski, Hang Ma, Sven Koenig:
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search. IJCAI 2019: 442-449 - [c186]Daniel Damir Harabor, Tansel Uras, Peter J. Stuckey, Sven Koenig:
Regarding Jump Point Search and Subgoal Graphs. IJCAI 2019: 1241-1248 - [c185]Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig:
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. SOCS 2019: 44-51 - [c184]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 Barták, Eli Boyarski:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. SOCS 2019: 151-159 - [c183]Carlos Hernández Ulloa, Jorge A. Baier, William Yeoh, Vadim Bulitko, Sven Koenig:
A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results. SOCS 2019: 178-179 - [c182]Jiaoyang Li, Eli Boyarski, Ariel Felner, Hang Ma, Sven Koenig:
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results. SOCS 2019: 182-183 - [c181]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. SOCS 2019: 184-185 - [c180]Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. SOCS 2019: 186-187 - [c179]Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding. SOCS 2019: 188-189 - [c178]Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery. SOCS 2019: 190-191 - [i25]Gleb Belov, Liron Cohen, Maria Garcia de la Banda, Daniel Harabor, Sven Koenig, Xinrui Wei:
Position Paper: From Multi-Agent Pathfinding to Pipe Routing. CoRR abs/1905.08412 (2019) - [i24]Devon Sigurdson, Vadim Bulitko, Sven Koenig, Carlos Hernández, William Yeoh:
Automatic Algorithm Selection In Multi-agent Pathfinding. CoRR abs/1906.03992 (2019) - [i23]Roni Stern, Nathan Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, Roman Barták:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. CoRR abs/1906.08291 (2019) - [i22]Pavel Surynek, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Capacity Constraints. CoRR abs/1907.12648 (2019) - [i21]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. CoRR abs/1912.00253 (2019) - 2018
- [j42]Eric Eaton, Sven Koenig, Claudia Schulz, Francesco Maurelli, John S. Y. Lee, Joshua Eckroth, Mark Crowley, Richard G. Freedman, Rogelio Enrique Cardona-Rivera, Tiago Machado, Tom Williams:
Blue sky ideas in artificial intelligence education from the EAAI 2017 new and future AI educator program. AI Matters 3(4): 23-31 (2018) - [j41]Maria L. Gini, Noa Agmon, Fausto Giunchiglia, Sven Koenig, Kevin Leyton-Brown:
Artificial intelligence in 2027. AI Matters 4(1): 10-20 (2018) - [j40]Sven Koenig, Sanmay Das, Rosemary D. Paradis, John P. Dickerson, Yolanda Gil, Katherine Guo, Benjamin Kuipers, Hang Ma, Nicholas Mattei, Amy McGovern, Larry R. Medsker, Todd W. Neller, Plamen Petrov, Michael Rovatsos, David G. Stork:
ACM SIGAI activity report. AI Matters 4(3): 7-11 (2018) - [j39]Sven Koenig, Sanmay Das, Rosemary D. Paradis, Michael Rovatsos, Nicholas Mattei:
Call for proposals: artificial intelligence activities fund. AI Matters 4(4): 5-6 (2018) - [c177]Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding. ICAPS 2018: 83-87 - [c176]Zhi Wang, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
The Factored Shortest Path Problem and Its Applications in Robotics. ICAPS 2018: 527-531 - [c175]Liron Cohen, Sven Koenig, T. K. Satish Kumar, Glenn Wagner, Howie Choset, David M. Chan, Nathan Sturtevant:
Rapid Randomized Restarts for Multi-Agent Path Finding: Preliminary Results. AAMAS 2018: 1909-1911 - [c174]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines: Preliminary Results. AAMAS 2018: 2004-2006 - [c173]Devon Sigurdson, Vadim Bulitko, William Yeoh, Carlos Hernández, Sven Koenig:
Multi-Agent Pathfinding with Real-Time Heuristic Search. CIG 2018: 1-8 - [c172]Hong Xu, Sven Koenig, T. K. Satish Kumar:
Towards Effective Deep Learning for Constraint Satisfaction Problems. CP 2018: 588-597 - [c171]Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar:
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. CPAIOR 2018: 567-584 - [c170]Guillaume Sartoretti, Yue Wu, William Paivine, T. K. Satish Kumar, Sven Koenig, Howie Choset:
Distributed Reinforcement Learning for Multi-robot Decentralized Collective Construction. DARS 2018: 35-49 - [c169]Eric Heiden, Luigi Palmieri, Sven Koenig, Kai Oliver Arras, Gaurav S. Sukhatme:
Gradient-Informed Path Smoothing for Wheeled Mobile Robots. ICRA 2018: 1710-1717 - [c168]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines. IJCAI 2018: 417-423 - [c167]Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar:
The FastMap Algorithm for Shortest Path Computations. IJCAI 2018: 1427-1433 - [c166]Liron Cohen, Matias Greco, Hang Ma, Carlos Hernández, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Anytime Focal Search with Applications. IJCAI 2018: 1434-1441 - [c165]Tansel Uras, Sven Koenig:
Understanding Subgoal Graphs by Augmenting Contraction Hierarchies. IJCAI 2018: 1506-1513 - [c164]Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar:
The FastMap Algorithm for Shortest Path Computations. ISAIM 2018 - [c163]Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar:
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. ISAIM 2018 - [c162]Hong Xu, Xin-Zeng Wu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar:
The Buss Reduction for the k-Weighted Vertex Cover Problem. ISAIM 2018 - [c161]Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems. ISAIM 2018 - [c160]Masaru Nakajima, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Towards Understanding the Min-Sum Message Passing Algorithm for the Minimum Weighted Vertex Cover Problem: An Analytical Approach. ISAIM 2018 - [c159]Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph. PRIMA 2018: 106-122 - [c158]Tansel Uras, Sven Koenig:
Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs. SOCS 2018: 106-114 - [c157]Hong Xu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar:
Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems. SOCS 2018: 115-123 - [c156]Liron Cohen, Glenn Wagner, David M. Chan, Howie Choset, Nathan Sturtevant, Sven Koenig, T. K. Satish Kumar:
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. SOCS 2018: 148-152 - [e7]Mathijs de Weerdt, Sven Koenig, Gabriele Röger, Matthijs T. J. Spaan:
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, Delft, The Netherlands, June 24-29, 2018. AAAI Press 2018, ISBN 978-1-57735-797-1 [contents] - [e6]Elisabeth André, Sven Koenig, Mehdi Dastani, Gita Sukthankar:
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, July 10-15, 2018. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM 2018 [contents] - [i20]Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems. CoRR abs/1804.00038 (2018) - [i19]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines: Preliminary Results. CoRR abs/1805.04961 (2018) - [i18]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines. CoRR abs/1806.04216 (2018) - [i17]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. CoRR abs/1809.03531 (2018) - [i16]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. CoRR abs/1812.06355 (2018) - [i15]Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Searching with Consistent Prioritization for Multi-Agent Path Finding. CoRR abs/1812.06356 (2018) - 2017
- [j38]Emanuelle Burton, Judy Goldsmith, Sven Koenig, Benjamin Kuipers, Nicholas Mattei, Toby Walsh:
Ethical Considerations in Artificial Intelligence Courses. AI Mag. 38(2): 22-34 (2017) - [j37]Sven Koenig, Sanmay Das, Rosemary D. Paradis, Eric Eaton, Yolanda Gil, Katherine Guo, Bojun Huang, Albert Jiang, Benjamin Kuipers, Nicholas Mattei, Amy McGovern, Larry R. Medsker, Todd W. Neller, Plamen Petrov, Michael Rovatsos, David G. Stork:
ACM SIGAI activity report. AI Matters 3(3): 7-11 (2017) - [j36]Hang Ma, Sven Koenig:
AI buzzwords explained: multi-agent path finding (MAPF). AI Matters 3(3): 15-19 (2017) - [j35]Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Overview: A Hierarchical Framework for Plan Generation and Execution in Multirobot Systems. IEEE Intell. Syst. 32(6): 6-12 (2017) - [c155]Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Delay Probabilities. AAAI 2017: 3605-3612 - [c154]Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments. AIIDE 2017: 270-272 - [c153]Hang Ma, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. AAMAS 2017: 837-845 - [c152]Hong Xu, T. K. Satish Kumar, Sven Koenig:
Min-Max Message Passing and Local Consistency in Constraint Networks. Australasian Conference on Artificial Intelligence 2017: 340-352 - [c151]Hong Xu, Sven Koenig, T. K. Satish Kumar:
A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP. CP 2017: 630-638 - [c150]Hong Xu, T. K. Satish Kumar, Sven Koenig:
The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP. CPAIOR 2017: 387-402 - [c149]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig:
Summary: Multi-Agent Path Finding with Kinematic Constraints. IJCAI 2017: 4869-4873 - [c148]Tansel Uras, Sven Koenig:
Feasibility Study: Subgoal Graphs on State Lattices. SOCS 2017: 100-108 - [c147]Hong Xu, T. K. Satish Kumar, Sven Koenig:
A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. SOCS 2017: 173-175 - [i14]Emanuelle Burton, Judy Goldsmith, Sven Koenig, Benjamin Kuipers, Nicholas Mattei, Toby Walsh:
Ethical Considerations in Artificial Intelligence Courses. CoRR abs/1701.07769 (2017) - [i13]Eric Eaton, Sven Koenig, Claudia Schulz, Francesco Maurelli, John Lee, Joshua Eckroth, Mark Crowley, Richard G. Freedman, Rogelio Enrique Cardona-Rivera, Tiago Machado, Tom Williams:
Blue Sky Ideas in Artificial Intelligence Education from the EAAI 2017 New and Future AI Educator Program. CoRR abs/1702.00137 (2017) - [i12]Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hönig, T. K. Satish Kumar, Tansel Uras, Hong Xu, Craig A. Tovey, Guni Sharon:
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios. CoRR abs/1702.05515 (2017) - [i11]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Sven Koenig, Nora Ayanian:
Path Planning with Kinematic Constraints for Robot Groups. CoRR abs/1704.07538 (2017) - [i10]Hang Ma, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. CoRR abs/1705.10868 (2017) - [i9]