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
- 2025
[j63]Zhongqiang Ren
, Carlos Hernández, Maxim Likhachev, Ariel Felner, Sven Koenig, Oren Salzman, Sivakumar Rathinam, Howie Choset:
EMOA*: A framework for search-based multi-objective path planning. Artif. Intell. 339: 104260 (2025)- [j62]Thomy Phan, Timy Phan, Sven Koenig:
Generative Curricula for Multi-Agent Path Finding via Unsupervised and Reinforcement Learning. J. Artif. Intell. Res. 82: 2471-2534 (2025) - [c292]Thomy Phan, Benran Zhang, Shao-Hung Chan, Sven Koenig:
Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic. AAAI 2025: 23286-23294 - [c291]Thomy Phan, Shao-Hung Chan, Sven Koenig:
Counterfactual Online Learning for Open-Loop Monte-Carlo Planning. AAAI 2025: 26651-26658 - [i59]Yimin Tang, Zhenghong Yu, Yi Zheng, T. K. Satish Kumar, Jiaoyang Li, Sven Koenig:
Enhancing Lifelong Multi-Agent Path Finding with Cache Mechanism. CoRR abs/2501.02803 (2025) - [i58]Jinhao Liang, Jacob K. Christopher, Sven Koenig, Ferdinando Fioretto:
Simultaneous Multi-Robot Motion Planning with Projected Diffusion Models. CoRR abs/2502.03607 (2025) - [i57]Weizhe Chen, Sven Koenig, Bistra Dilkina:
Iterative Deepening Sampling for Large Language Models. CoRR abs/2502.05449 (2025) - [i56]Christopher Leet, Aidan Sciortino, Sven Koenig:
Jointly Assigning Processes to Machines and Generating Plans for Autonomous Mobile Robots in a Smart Factory. CoRR abs/2502.21101 (2025) - [i55]Yimin Tang, Xiao Xiong, Jingyi Xi, Jiaoyang Li, Erdem Biyik, Sven Koenig:
RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks. CoRR abs/2503.02992 (2025) - [i54]Yimin Tang, Zhenghong Yu, Jiaoyang Li, Sven Koenig:
Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds. CoRR abs/2503.03779 (2025) - 2024
- [c290]Thomy Phan, Taoan Huang, Bistra Dilkina, Sven Koenig:
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search. AAAI 2024: 17514-17522 - [c289]Thomy Phan, Joseph Driscoll, Justin Romberg, Sven Koenig:
Confidence-Based Curriculum Learning for Multi-Agent Path Finding. AAMAS 2024: 1558-1566 - [c288]Shao-Hung Chan, Zhe Chen, Dian-Lun Lin, Yue Zhang, Daniel Harabor, Sven Koenig, Tsung-Wei Huang, Thomy Phan:
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search. AAMAS 2024: 2183-2185 - [c287]Jingyao Ren, Eric Ewing, T. K. Satish Kumar, Sven Koenig, Nora Ayanian:
Map Connectivity and Empirical Hardness of Grid-based Multi-Agent Pathfinding Problem. ICAPS 2024: 484-488 - [c286]Fangji Wang, Han Zhang, Sven Koenig, Jiaoyang Li:
Efficient Approximate Search for Multi-Objective Multi-Agent Path Finding. ICAPS 2024: 613-622 - [c285]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths. ICAPS 2024: 680-688 - [c284]Lukas Heuer, Luigi Palmieri, Anna Mannucci, Sven Koenig, Martin Magnusson:
Benchmarking Multi-Robot Coordination in Realistic, Unstructured Human-Shared Environments. ICRA 2024: 14541-14547 - [c283]Pavel Surynek, Yi Zheng, Erik Kline, Sven Koenig, T. K. Satish Kumar:
Virtual Network Embedding as Boolean Satisfiability. ICTAI 2024: 387-395 - [c282]Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Theoretical Study on Multi-objective Heuristic Search. IJCAI 2024: 7021-7028 - [c281]Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
Rapidly Computing Approximate Graph Convex Hulls via FastMap. LOD (2) 2024: 323-338 - [c280]Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
Solving Facility Location Problems via FastMap and Locality Sensitive Hashing. SOCS 2024: 46-54 - [c279]Yimin Tang, Sven Koenig, Jiaoyang Li:
ITA-ECBS: A Bounded-Suboptimal Algorithm for Combined Target-Assignment and Path-Finding Problem. SOCS 2024: 134-142 - [c278]Han Zhang, Oren Salzman, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
A-A*pex: Efficient Anytime Approximate Multi-Objective Search. SOCS 2024: 179-187 - [c277]Carlos Hernández Ulloa, Han Zhang, Sven Koenig, Ariel Felner, Oren Salzman:
Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations. SOCS 2024: 208-212 - [c276]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig:
Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures. SOCS 2024: 228-232 - [c275]Grigorios Mouratidis, Bernhard Nebel, Sven Koenig:
Fools Rush in Where Angels Fear to Tread in Multi-Goal CBS. SOCS 2024: 243-251 - [i53]Weizhe Chen, Sven Koenig, Bistra Dilkina:
Why Solving Multi-agent Path Finding with Large Language Model has not Succeeded Yet. CoRR abs/2401.03630 (2024) - [i52]Thomy Phan, Joseph Driscoll, Justin Romberg, Sven Koenig:
Confidence-Based Curriculum Learning for Multi-Agent Path Finding. CoRR abs/2401.05860 (2024) - [i51]Shao-Hung Chan, Zhe Chen, Dian-Lun Lin, Yue Zhang, Daniel Harabor, Tsung-Wei Huang, Sven Koenig, Thomy Phan:
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search. CoRR abs/2402.01961 (2024) - [i50]Yimin Tang, Zhenghong Yu, Yi Zheng, T. K. Satish Kumar, Jiaoyang Li, Sven Koenig:
Caching-Augmented Lifelong Multi-Agent Path Finding. CoRR abs/2403.13421 (2024) - [i49]Weizhe Chen, Sven Koenig, Bistra Dilkina:
MARL-LNS: Cooperative Multi-agent Reinforcement Learning via Large Neighborhoods Search. CoRR abs/2404.03101 (2024) - [i48]Weizhe Chen, Zhihan Wang, Jiaoyang Li, Sven Koenig, Bistra Dilkina:
No Panacea in Planning: Algorithm Selection for Suboptimal Multi-Agent Path Finding. CoRR abs/2404.03554 (2024) - [i47]Yimin Tang, Sven Koenig, Jiaoyang Li:
ITA-ECBS: A Bounded-Suboptimal Algorithm for the Combined Target-Assignment and Path-Finding Problem. CoRR abs/2404.05223 (2024) - [i46]Weizhe Chen, Sven Koenig, Bistra Dilkina:
RePrompt: Planning by Automatic Prompt Engineering for Large Language Models Agents. CoRR abs/2406.11132 (2024) - [i45]Thomy Phan, Benran Zhang, Shao-Hung Chan, Sven Koenig:
Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic. CoRR abs/2408.02960 (2024) - [i44]Jinhao Liang, Jacob K. Christopher, Sven Koenig, Ferdinando Fioretto:
Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models. CoRR abs/2412.17993 (2024) - 2023
- [j61]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) - [j60]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) - [j59]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) - [j58]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. Auton. Robots 47(8): 1537-1558 (2023) - [j57]Sumedh Pendurkar, Taoan Huang, Brendan Juba, Jiapeng Zhang, Sven Koenig, Guni Sharon:
The (Un)Scalability of Informed Heuristic Function Estimation in NP-Hard Search Problems. Trans. Mach. Learn. Res. 2023 (2023) - [c274]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 - [c273]Shuwei Wang, Vadim Bulitko, Taoan Huang, Sven Koenig, Roni Stern:
Synthesizing Priority Planning Formulae for Multi-Agent Pathfinding. AIIDE 2023: 360-369 - [c272]Cheng Ge, Han Zhang, Jiaoyang Li, Sven Koenig:
Cost Splitting for Multi-Objective Conflict-Based Search. ICAPS 2023: 128-137 - [c271]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 - [c270]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 - [c269]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 - [c268]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 - [c267]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 - [c266]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 - [c265]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 - [c264]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 - [c263]Christopher Leet, Chanwook Oh, Michele Lora, Sven Koenig, Pierluigi Nuzzo:
Task Assignment, Scheduling, and Motion Planning for Automated Warehouses for Million Product Workloads. IROS 2023: 7362-7369 - [c262]Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
A FastMap-Based Framework for Efficiently Computing Top-K Projected Centrality. LOD (1) 2023: 158-173 - [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, Prague, Czech Republic, July 8-13, 2023. AAAI Press 2023 [contents] - [i43]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) - [i42]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) - [i41]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) - [i40]Thomy Phan, Taoan Huang, Bistra Dilkina, Sven Koenig:
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search. CoRR abs/2312.16767 (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 O. 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-99 - [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]Jiaoyang Li, Ariel Felner, Sven Koenig, T. K. Satish Kumar:
Using FastMap to Solve Graph Problems in a Euclidean Space. ICAPS 2019: 273-278 - [c193]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 - [c192]Minghua Liu, Hang Ma, Jiaoyang Li, Sven Koenig:
Task and Path Planning for Multi-Agent Pickup and Delivery. AAMAS 2019: 1152-1160 - [c191]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 - [c190]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 - [c189]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 - [c188]Daniel Damir Harabor, Tansel Uras, Peter J. Stuckey, Sven Koenig:
Regarding Jump Point Search and Subgoal Graphs. IJCAI 2019: 1241-1248 - [c187]Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig:
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. SOCS 2019: 44-51 - [c186]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-158 - [c185]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 - [c184]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 - [c183]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 - [c182]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 - [c181]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 - [c180]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 R. 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) - [c179]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 - [c178]Zhi Wang, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
The Factored Shortest Path Problem and Its Applications in Robotics. ICAPS 2018: 527-531 - [c177]Liron Cohen, Sven Koenig, T. K. Satish Kumar, Glenn Wagner, Howie Choset, David M. Chan, Nathan R. Sturtevant:
Rapid Randomized Restarts for Multi-Agent Path Finding: Preliminary Results. AAMAS 2018: 1909-1911 - [c176]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 - [c175]Devon Sigurdson, Vadim Bulitko, William Yeoh, Carlos Hernández, Sven Koenig:
Multi-Agent Pathfinding with Real-Time Heuristic Search. CIG 2018: 1-8 - [c174]Hong Xu, Sven Koenig, T. K. Satish Kumar:
Towards Effective Deep Learning for Constraint Satisfaction Problems. CP 2018: 588-597 - [c173]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 - [c172]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 - [c171]Eric Heiden, Luigi Palmieri, Sven Koenig, Kai Oliver Arras, Gaurav S. Sukhatme:
Gradient-Informed Path Smoothing for Wheeled Mobile Robots. ICRA 2018: 1710-1717 - [c170]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines. IJCAI 2018: 417-423 - [c169]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 - [c168]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 - [c167]Tansel Uras, Sven Koenig:
Understanding Subgoal Graphs by Augmenting Contraction Hierarchies. IJCAI 2018: 1506-1513 - [c166]Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar:
The FastMap Algorithm for Shortest Path Computations. ISAIM 2018 - [c165]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 - [c164]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 - [c163]Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems. ISAIM 2018 - [c162]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 - [c161]Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph. PRIMA 2018: 106-122 - [c160]Tansel Uras, Sven Koenig:
Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs. SOCS 2018: 106-114 - [c159]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 - [c158]Liron Cohen, Glenn Wagner, David M. Chan, Howie Choset, Nathan R. 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) - [c157]Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Delay Probabilities. AAAI 2017: 3605-3612 - [c156]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 - [c155]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 - [c154]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 - [c153]Hong Xu, Sven Koenig, T. K. Satish Kumar:
A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP. CP 2017: 630-638 - [c152]Hong Xu, T. K. Satish Kumar, Sven Koenig:
The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP. CPAIOR 2017: 387-402 - [c151]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 - [c150]Tansel Uras, Sven Koenig:
Feasibility Study: Subgoal Graphs on State Lattices. SOCS 2017: 100-108 - [c149]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-174 - [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]Liron Cohen, T. K. Satish Kumar, Shiva Jahangiri, Aliyah Arunasalam, Tansel Uras, Sven Koenig:
The FastMap Algorithm for Shortest Path Computations. CoRR abs/1706.02792 (2017) - [i8]Liron Cohen, Glenn Wagner, T. K. Satish Kumar, Howie Choset, Sven Koenig:
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. CoRR abs/1706.02794 (2017) - [i7]Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments. CoRR abs/1710.01447 (2017) - [i6]Hang Ma, Sven Koenig:
AI Buzzwords Explained: Multi-Agent Path Finding (MAPF). CoRR abs/1710.03774 (2017) - 2016
- [j34]Ron Alterovitz, Sven Koenig, Maxim Likhachev:
Robot Planning in the Real World: Research Challenges and Opportunities. AI Mag. 37(2): 76-84 (2016) - [c148]Hang Ma, Craig A. Tovey, Guni Sharon, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem. AAAI 2016: 3166-3173 - [c147]Robert Morris, Corina S. Pasareanu, Kasper Søe Luckow, Waqar Malik, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Planning, Scheduling and Monitoring for Airport Surface Operations. AAAI Workshop: Planning for Hybrid Systems 2016 - [c146]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig:
Multi-Agent Path Finding with Kinematic Constraints. ICAPS 2016: 477-485 - [c145]Hang Ma, Sven Koenig:
Optimal Target Assignment and Path Finding for Teams of Agents. AAMAS 2016: 1144-1152 - [c144]Trevor Cai, David Y. Zhang, T. K. Satish Kumar, Sven Koenig, Nora Ayanian:
Local Search on Trees and a Framework for Automated Construction Using Multiple Identical Robots: (Extended Abstract). AAMAS 2016: 1301-1302 - [c143]Hong Xu, T. K. Satish Kumar, Sven Koenig:
A New Solver for the Minimum Weighted Vertex Cover Problem. CPAIOR 2016: 392-405 - [c142]Luigi Palmieri, Sven Koenig, Kai Oliver Arras:
RRT-based nonholonomic motion planning using any-angle path biasing. ICRA 2016: 2775-2781 - [c141]Hong Xu, T. K. Satish Kumar, Dylan Johnke, Nora Ayanian, Sven Koenig:
SAGL: A New Heuristic for Multi-Robot Routing with Complex Tasks. ICTAI 2016: 530-535 - [c140]Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian, Sven Koenig:
Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding. IJCAI 2016: 3067-3074 - [c139]Liron Cohen, Sven Koenig:
Bounded Suboptimal Multi-Agent Path Finding Using Highways. IJCAI 2016: 3978-3979 - [c138]Wolfgang Hönig, T. K. Satish Kumar, Hang Ma, Sven Koenig, Nora Ayanian:
Formation change for robot groups in occluded environments. IROS 2016: 4836-4842 - [e5]Blai Bonet, Sven Koenig, Benjamin Kuipers, Illah R. Nourbakhsh, Stuart Russell, Moshe Y. Vardi, Toby Walsh:
AI, Ethics, and Society, Papers from the 2016 AAAI Workshop, Phoenix, Arizona, USA, February 13, 2016. AAAI Technical Report WS-16-02, AAAI Press 2016 [contents] - [i5]Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Delay Probabilities. CoRR abs/1612.05309 (2016) - [i4]Hang Ma, Sven Koenig:
Optimal Target Assignment and Path Finding for Teams of Agents. CoRR abs/1612.05693 (2016) - 2015
- [j33]Carlos Hernández, Tansel Uras, Sven Koenig, Jorge A. Baier, Xiaoxun Sun, Pedro Meseguer:
Reusing cost-minimal paths for goal-directed navigation in partially known terrains. Auton. Agents Multi Agent Syst. 29(5): 850-895 (2015) - [j32]Robert Morris, Blai Bonet, Marc Cavazza, Marie desJardins, Ariel Felner, Nick Hawes, Brad Knox, Sven Koenig, George Dimitri Konidaris, Jérôme Lang, Carlos Linares López, Daniele Magazzeni, Amy McGovern, Sriraam Natarajan, Nathan R. Sturtevant, Michael Thielscher, William Yeoh, Sebastian Sardiña, Kiri Wagstaff:
A Summary of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AI Mag. 36(3): 99-106 (2015) - [j31]Masabumi Furuhata, Kenny Daniel, Sven Koenig, Fernando Ordóñez, Maged M. Dessouky, Marc-Etienne Brunet, Liron Cohen, Xiaoqing Wang:
Online Cost-Sharing Mechanism Design for Demand-Responsive Transport Systems. IEEE Trans. Intell. Transp. Syst. 16(2): 692-707 (2015) - [c137]James P. Bailey, Craig A. Tovey, Tansel Uras, Sven Koenig, Alex Nash:
Path Planning on Grids: The Effect of Vertex Placement on Path Length. AIIDE 2015: 108-114 - [c136]Tansel Uras, Sven Koenig:
Speeding-Up Any-Angle Path-Planning on Grids. ICAPS 2015: 234-238 - [c135]Zachary Suffern, Craig A. Tovey, Sven Koenig:
Towards Completely Decentralized Mustering for StarCraft. AAMAS 2015: 1757-1758 - [c134]Lars Glaesser, Sven Koenig:
ESD test at component level. EMC Compo 2015: 152-156 - [c133]Liron Cohen, Tansel Uras, Sven Koenig:
Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path Finding. SOCS 2015: 2-8 - [c132]Tansel Uras, Sven Koenig:
An Empirical Comparison of Any-Angle Path-Planning Algorithms. SOCS 2015: 206-210 - [c131]Nathan R. Sturtevant, Jason M. Traish, James R. Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin:
The Grid-Based Path Planning Competition: 2014 Entries and Results. SOCS 2015: 241-250 - [c130]William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig:
Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems. WI-IAT (2) 2015: 257-264 - [e4]Blai Bonet, Sven Koenig:
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA. AAAI Press 2015, ISBN 978-1-57735-698-1 [contents] - 2014
- [c129]Tansel Uras, Sven Koenig:
Identifying Hierarchies for Fast Optimal Search. AAAI 2014: 878-884 - [c128]T. K. Satish Kumar, Duc Thien Nguyen, William Yeoh, Sven Koenig:
A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints. AAAI 2014: 2308-2314 - [c127]Marcello Cirillo, Federico Pecora, Henrik Andreasson, Tansel Uras, Sven Koenig:
Integrated Motion Planning and Coordination for Industrial Vehicles. ICAPS 2014 - [c126]T. K. Satish Kumar, Sangmook Johnny Jung, Sven Koenig:
A Tree-Based Algorithm for Construction Robots. ICAPS 2014 - [c125]Mike Phillips, Maxim Likhachev, Sven Koenig:
PA*SE: Parallel A* for Slow Expansions. ICAPS 2014 - [c124]Masabumi Furuhata, Liron Cohen, Sven Koenig, Maged M. Dessouky, Fernando Ordóñez:
Characterizing online cost-sharing mechanisms fordemand responsive transport systems. AAMAS 2014: 1491-1492 - [c123]Marcello Cirillo, Tansel Uras, Sven Koenig:
A lattice-based approach to multi-robot motion planning for non-holonomic vehicles. IROS 2014: 232-239 - [c122]Sven Koenig, Alexander Reinefeld:
Invited Talks. SOCS 2014 - [c121]Tansel Uras, Sven Koenig:
Identifying Hierarchies for Fast Optimal Search. SOCS 2014: 211-212 - [i3]William Yeoh, Ariel Felner, Sven Koenig:
BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm. CoRR abs/1401.3490 (2014) - [i2]Kenny Daniel, Alex Nash, Sven Koenig, Ariel Felner:
Theta*: Any-Angle Path Planning on Grids. CoRR abs/1401.3843 (2014) - 2013
- [j30]Alex Nash, Sven Koenig:
Any-Angle Path Planning. AI Mag. 34(4): 9- (2013) - [c120]T. K. Satish Kumar, Marcello Cirillo, Sven Koenig:
Simple Temporal Problems with Taboo Regions. AAAI 2013: 548-554 - [c119]Tansel Uras, Sven Koenig, Carlos Hernández:
Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids. ICAPS 2013 - [c118]T. K. Satish Kumar, Marcello Cirillo, Sven Koenig:
On the Traveling Salesman Problem with Simple Temporal Constraints. SARA 2013 - [c117]T. K. Satish Kumar, Liron Cohen, Sven Koenig:
Incorrect Lower Bounds for Path Consistency and More. SARA 2013 - [c116]T. K. Satish Kumar, Liron Cohen, Sven Koenig:
Submodular Constraints and Planar Constraint Networks: New Results. SARA 2013 - 2012
- [j29]Sven Koenig:
Making Good Decisions Quickly. IEEE Intell. Informatics Bull. 13(1): 14-20 (2012) - [c115]Carlos Hernández, Jorge A. Baier, Tansel Uras, Sven Koenig:
Time-bounded adaptive A. AAMAS 2012: 997-1006 - [c114]Xiaoxun Sun, Tansel Uras, Sven Koenig, William Yeoh:
Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search. ICAPS 2012 - [c113]Carlos Hernández, Jorge A. Baier, Tansel Uras, Sven Koenig:
Position Paper: Incremental Search Algorithms Considered Poorly Understood. SOCS 2012: 159-161 - [c112]Carlos Hernández, Jorge A. Baier, Tansel Uras, Sven Koenig:
Paper Summary: Time-Bounded Adaptive A. SOCS 2012: 184-185 - [c111]Tansel Uras, Sven Koenig, Carlos Hernández:
Subgoal Graphs for Eight-Neighbor Gridworlds. SOCS 2012: 213-214 - [i1]Yaxin Liu, Sven Koenig:
Existence and Finiteness Conditions for Risk-Sensitive Planning: Results and Conjectures. CoRR abs/1207.1391 (2012) - 2011
- [j28]Richard B. Borie, Craig A. Tovey, Sven Koenig:
Algorithms and complexity results for graph-based pursuit evasion. Auton. Robots 31(4): 317-332 (2011) - [c110]Carlos Hernández, Xiaoxun Sun, Sven Koenig, Pedro Meseguer:
Tree Adaptive A. AAMAS 2011: 123-130 - [c109]William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig:
Incremental DCOP search algorithms for solving dynamic DCOPs. AAMAS 2011: 1069-1070 - [c108]Xiaoming Zheng, Sven Koenig:
Generalized Reaction Functions for Solving Complex-Task Allocation Problems. IJCAI 2011: 478-483 - 2010
- [j27]William Yeoh, Ariel Felner, Sven Koenig:
BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm. J. Artif. Intell. Res. 38: 85-133 (2010) - [j26]Kenny Daniel, Alex Nash, Sven Koenig, Ariel Felner:
Theta*: Any-Angle Path Planning on Grids. J. Artif. Intell. Res. 39: 533-579 (2010) - [j25]Craig A. Tovey, Sven Koenig:
Localization: Approximation and Performance Bounds to Minimize Travel Distance. IEEE Trans. Robotics 26(2): 320-330 (2010) - [j24]Xiaoming Zheng, Sven Koenig, David Kempe, Sonal Jain:
Multirobot Forest Coverage for Weighted and Unweighted Terrain. IEEE Trans. Robotics 26(6): 1018-1031 (2010) - [c107]Alex Nash, Sven Koenig, Craig A. Tovey:
Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D. AAAI 2010: 147-154 - [c106]Xiaoming Zheng, Sven Koenig:
Sequential Incremental-Value Auctions. AAAI 2010: 941-946 - [c105]Sven Koenig, Pinar Keskinocak, Craig A. Tovey:
Progress on Agent Coordination with Cooperative Auctions. AAAI 2010: 1713-1717 - [c104]Xiaoming Zheng, Sven Koenig:
Market-Based Algorithms for Allocating Complex Tasks. Abstraction, Reformulation, and Approximation 2010 - [c103]Daniel Wong, Darren Earl, Fred Zyda, Sven Koenig:
Teaching Robotics and Computer Science with Pinball Machines. AAAI Spring Symposium: Educational Robotics and Beyond 2010 - [c102]Xiaoxun Sun, William Yeoh, Sven Koenig:
Moving target D* Lite. AAMAS 2010: 67-74 - [c101]Xiaoxun Sun, William Yeoh, Sven Koenig:
Generalized Fringe-Retrieving A*: faster moving target search on state lattices. AAMAS 2010: 1081-1088 - [c100]Kenny Daniel, Richard B. Borie, Sven Koenig, Craig A. Tovey:
ESP: pursuit evasion on series-parallel graphs. AAMAS 2010: 1519-1520 - [c99]Sven Koenig:
Open Problem: Analyzing Ant Robot Coverage. COLT 2010: 312-313 - [c98]Daniel Wong, Ryan Zink, Sven Koenig:
Teaching Artificial Intelligence and Robotics Via Games. EAAI 2010: 1917-1918 - [c97]Todd W. Neller, John DeNero, Dan Klein, Sven Koenig, William Yeoh, Xiaoming Zheng, Kenny Daniel, Alex Nash, Zachary Dodds, Giuseppe Carenini, David Poole, Christopher Brooks:
Model AI Assignments. EAAI 2010: 1919-1921 - [c96]Daniel Wong, Darren Earl, Fred Zyda, Ryan Zink, Sven Koenig, Allen Pan, Selby Shlosberg, Jaspreet Singh, Nathan R. Sturtevant:
Implementing games on pinball machines. FDG 2010: 240-247 - [c95]Alex Nash, Sven Koenig, Craig A. Tovey:
Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D. SOCS 2010: 153-154
2000 – 2009
- 2009
- [j23]Sven Koenig, Xiaoxun Sun:
Comparing real-time and incremental heuristic search for real-time situated agents. Auton. Agents Multi Agent Syst. 18(3): 313-341 (2009) - [j22]Razvan C. Bunescu, Vitor R. Carvalho, Jan Chomicki, Vincent Conitzer, Michael T. Cox, Virginia Dignum, Zachary Dodds, Mark Dredze, David Furcy, Evgeniy Gabrilovich, Mehmet H. Göker, Hans W. Guesgen, Haym Hirsh, Dietmar Jannach, Ulrich Junker, Wolfgang Ketter, Alfred Kobsa, Sven Koenig, Tessa A. Lau, Lundy Lewis, Eric T. Matson, Ted Metzler, Rada Mihalcea, Bamshad Mobasher, Joelle Pineau, Pascal Poupart, Anita Raja, Wheeler Ruml, Norman M. Sadeh, Guy Shani, Daniel G. Shapiro, Sarabjot Singh Anand, Matthew E. Taylor, Kiri Wagstaff, Trey Smith, William E. Walsh, Rong Zhou:
AAAI 2008 Workshop Reports. AI Mag. 30(1): 108-118 (2009) - [j21]Sven Koenig, Joseph S. B. Mitchell, Apurva Mudgal, Craig A. Tovey:
A Near-Tight Approximation Algorithm for the Robot Localization Problem. SIAM J. Comput. 39(2): 461-490 (2009) - [c94]Carlos Hernández, Pedro Meseguer, Xiaoxun Sun, Sven Koenig:
Path-Adaptive A* for Incremental Heuristic Search in Unknown Terrain. ICAPS 2009 - [c93]William Yeoh, Pradeep Varakantham, Sven Koenig:
Caching schemes for DCOP search algorithms. AAMAS (1) 2009: 609-616 - [c92]Xiaoxun Sun, William Yeoh, Sven Koenig:
Dynamic fringe-saving A*. AAMAS (2) 2009: 891-898 - [c91]Xiaoxun Sun, William Yeoh, Po-An Chen, Sven Koenig:
Simple optimization techniques for A*-based search. AAMAS (2) 2009: 931-936 - [c90]Kenny Daniel, Sven Koenig:
Fast winner determination for agent coordination with SBB auctions. AAMAS (2) 2009: 1197-1198 - [c89]Ali Ekici, Pinar Keskinocak, Sven Koenig:
Multi-robot routing with linear decreasing rewards over time. ICRA 2009: 958-963 - [c88]Richard B. Borie, Craig A. Tovey, Sven Koenig:
Algorithms and Complexity Results for Pursuit-Evasion Problems. IJCAI 2009: 59-66 - [c87]William Yeoh, Xiaoxun Sun, Sven Koenig:
Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms. IJCAI 2009: 354-360 - [c86]Xiaoming Zheng, Sven Koenig:
K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems. IJCAI 2009: 373-379 - [c85]Xiaoxun Sun, William Yeoh, Sven Koenig:
Efficient Incremental Search for Moving Target Search. IJCAI 2009: 615-620 - [c84]Alex Nash, Sven Koenig, Maxim Likhachev:
Incremental Phi*: Incremental Any-Angle Path Planning on Grids. IJCAI 2009: 1824-1830 - [c83]Xiaoming Zheng, Sven Koenig:
Negotiation with reaction functions for solving complex task allocation problems. IROS 2009: 4811-4816 - 2008
- [c82]Sven Koenig, Xiaoming Zheng, Craig A. Tovey, Richard B. Borie, Philip Kilby, Vangelis Markakis, Pinar Keskinocak:
Agent Coordination with Regret Clearing. AAAI 2008: 101-107 - [c81]John Paul Kelly, Adi Botea, Sven Koenig:
Offline Planning with Hierarchical Task Networks in Video Games. AIIDE 2008 - [c80]Yaxin Liu, Sven Koenig:
An exact algorithm for solving MDPs under risk-sensitive planning objectives with one-switch utility functions. AAMAS (1) 2008: 453-460 - [c79]Xiaoxun Sun, Sven Koenig, William Yeoh:
Generalized Adaptive A*. AAMAS (1) 2008: 469-476 - [c78]Xiaoming Zheng, Sven Koenig:
Reaction functions for task allocation to cooperative agents. AAMAS (2) 2008: 559-566 - [c77]William Yeoh, Ariel Felner, Sven Koenig:
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm. AAMAS (2) 2008: 591-598 - [c76]William Yeoh, Sven Koenig, Xiaoxun Sun:
Trading off solution cost for smaller runtime in DCOP search algorithms. AAMAS (3) 2008: 1445-1448 - [c75]William Yeoh, Ariel Felner, Sven Koenig:
IDB-ADOPT: A Depth-First Search DCOP Algorithm. CSCLP 2008: 132-146 - 2007
- [c74]Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, Sven Koenig:
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. AAAI 2007: 1007-1012 - [c73]Alex Nash, Kenny Daniel, Sven Koenig, Ariel Felner:
Theta*: Any-Angle Path Planning on Grids. AAAI 2007: 1177-1183 - [c72]Sven Koenig, Maxim Likhachev, Xiaoxun Sun:
Speeding up moving-target search. AAMAS 2007: 188 - [c71]Sven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz Sungur:
Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control. IJCAI 2007: 1359-1365 - [c70]Xiaoxun Sun, Sven Koenig:
The Fringe-Saving A* Search Algorithm - A Feasibility Study. IJCAI 2007: 2391-2397 - [c69]Janusz Marecki, Sven Koenig, Milind Tambe:
A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources. IJCAI 2007: 2536-2541 - [c68]Justin Melvin, Pinar Keskinocak, Sven Koenig, Craig A. Tovey, Banu Yuksel Ozkaya:
Multi-robot routing with rewards and disjoint time windows. IROS 2007: 2332-2337 - [c67]Xiaoming Zheng, Sven Koenig:
Robot coverage of terrain with non-uniform traversability. IROS 2007: 3757-3764 - 2006
- [j20]Sven Koenig, Sarit Kraus, Munindar P. Singh, Michael J. Wooldridge:
Report on the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems. AI Mag. 27(1): 103-107 (2006) - [j19]Wolfgang Achtner, Esma Aïmeur, Sarabjot Singh Anand, Douglas E. Appelt, Naveen Ashish, Tiffany Barnes, Joseph E. Beck, M. Bernardine Dias, Prashant Doshi, Chris Drummond, William Elazmeh, Ariel Felner, Dayne Freitag, Hector Geffner, Christopher W. Geib, Richard Goodwin, Robert C. Holte, Frank Hutter, Fair Isaac, Nathalie Japkowicz, Gal A. Kaminka, Sven Koenig, Michail G. Lagoudakis, David B. Leake, Lundy Lewis, Hugo Liu, Ted Metzler, Rada Mihalcea, Bamshad Mobasher, Pascal Poupart, David V. Pynadath, Thomas Roth-Berghofer, Wheeler Ruml, Stefan Schulz, Sven Schwarz, Stephanie Seneff, Amit P. Sheth, Ron Sun, Michael Thielscher, Afzal Upal, Jason D. Williams, Steve J. Young, Dmitry Zelenko:
Reports on the Twenty-First National Conference on Artificial Intelligence (AAAI-06) Workshop Program. AI Mag. 27(4): 92-102 (2006) - [j18]Oliver Brock, Sven Koenig, Nicholas Roy, Gaurav S. Sukhatme:
Editorial: Special Issue on Robotics: Science and Systems 2005. Int. J. Robotics Res. 25(12): 1163 (2006) - [c66]Yaxin Liu, Sven Koenig:
Functional Value Iteration for Decision-Theoretic Planning with General Utility Functions. AAAI 2006: 1186-1193 - [c65]Sven Koenig, Craig A. Tovey, Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Adam Meyerson, Sonal Jain:
The Power of Sequential Single-Item Auctions for Agent Coordination. AAAI 2006: 1625-1629 - [c64]Maxim Likhachev, Sven Koenig:
Incremental Heuristic Search in Games: The Quest for Speed. AIIDE 2006: 118-120 - [c63]Sven Koenig, Maxim Likhachev:
A New Principle for Incremental Heuristic Search: Theoretical Results. ICAPS 2006: 402-405 - [c62]Yaxin Liu, Sven Koenig:
Probabilistic Planning with Nonlinear Utility Functions. ICAPS 2006: 410-413 - [c61]Sven Koenig, Maxim Likhachev:
Real-time adaptive A*. AAMAS 2006: 281-288 - [c60]Xiaoming Zheng, Sven Koenig, Craig A. Tovey:
Improving Sequential Single-Item Auctions. IROS 2006: 2238-2244 - [c59]Sven Koenig:
Search for Robot Navigation under Incomplete Information. AI&M 2006 - [c58]Sven Koenig, Apurva Mudgal, Craig A. Tovey:
A near-tight approximation lower bound and algorithm for the kidnapped robot problem. SODA 2006: 133-142 - 2005
- [j17]Apurva Mudgal, Craig A. Tovey, Sam Greenberg, Sven Koenig:
Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic. SIAM J. Discret. Math. 19(2): 431-447 (2005) - [j16]Sven Koenig, Maxim Likhachev:
Fast replanning for navigation in unknown terrain. IEEE Trans. Robotics 21(3): 354-363 (2005) - [c57]Yaxin Liu, Sven Koenig:
Risk-Sensitive Planning with One-Switch Utility Functions: Value Iteration. AAAI 2005: 993-999 - [c56]Maxim Likhachev, Sven Koenig:
A Generalized Framework for Lifelong Planning A* Search. ICAPS 2005: 99-108 - [c55]Syed Muhammad Ali, Sven Koenig, Milind Tambe:
Preprocessing techniques for accelerating the DCOP algorithm ADOPT. AAMAS 2005: 1041-1048 - [c54]Sven Koenig, Maxim Likhachev:
Adaptive A. AAMAS 2005: 1311-1312 - [c53]David Furcy, Sven Koenig:
Limited Discrepancy Beam Search. IJCAI 2005: 125-131 - [c52]David Furcy, Sven Koenig:
Scaling up WA* with Commitment and Diversity. IJCAI 2005: 1521-1522 - [c51]Xiaoming Zheng, Sonal Jain, Sven Koenig, David Kempe:
Multi-robot forest coverage. IROS 2005: 3852-3857 - [c50]Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Sven Koenig, Craig A. Tovey, Adam Meyerson, Sonal Jain:
Auction-Based Multi-Robot Routing. Robotics: Science and Systems 2005: 343-350 - [c49]Yaxin Liu, Sven Koenig:
Existence and Finiteness Conditions for Risk-Sensitive Planning: Results and Conjectures. UAI 2005: 354-363 - [e3]Frank Dignum, Virginia Dignum, Sven Koenig, Sarit Kraus, Munindar P. Singh, Michael J. Wooldridge:
4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), July 25-29, 2005, Utrecht, The Netherlands. ACM 2005, ISBN 1-59593-094-9 [contents] - 2004
- [j15]Sven Koenig, Maxim Likhachev, David Furcy:
Lifelong Planning A. Artif. Intell. 155(1-2): 93-146 (2004) - [j14]Sven Koenig, Maxim Likhachev, Yaxin Liu, David Furcy:
Incremental Heuristic Search in AI. AI Mag. 25(2): 99-112 (2004) - [j13]Shlomo Zilberstein, Jana Koehler, Sven Koenig:
The Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04). AI Mag. 25(4): 101-104 (2004) - [j12]Jonas Svennebring, Sven Koenig:
Building Terrain-Covering Ant Robots: A Feasibility Study. Auton. Robots 16(3): 313-332 (2004) - [c48]Sven Koenig:
A Comparison of Fast Search Methods for Real-Time Situated Agents. AAMAS 2004: 864-871 - [c47]Syed Muhammad Ali, Sven Koenig, Milind Tambe:
Preprocessing Techniques for Distributed Constraint Optimization. CP 2004: 706-710 - [c46]Michail G. Lagoudakis, Marc Berhault, Sven Koenig, Pinar Keskinocak, Anton J. Kleywegt:
Simple auctions with performance guarantees for multi-robot task allocation. IROS 2004: 698-705 - [c45]Ananth Ranganathan, Sven Koenig:
PDRRTs: integrating graph-based and cell-based planning. IROS 2004: 2799-2806 - [c44]Apurva Mudgal, Craig A. Tovey, Sven Koenig:
Analysis of Greedy Robot-Navigation Methods. AI&M 2004 - [e2]Shlomo Zilberstein, Jana Koehler, Sven Koenig:
Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), June 3-7 2004, Whistler, British Columbia, Canada. AAAI 2004, ISBN 1-57735-200-9 [contents] - 2003
- [j11]Sven Koenig, Craig A. Tovey, Yury V. Smirnov:
Performance bounds for planning in unknown terrain. Artif. Intell. 147(1-2): 253-279 (2003) - [j10]Sven Koenig, Robert C. Holte:
The Fifth Symposium on Abstraction, Reformulation, and Approximation (SARA-2002). AI Mag. 24(1): 99-100 (2003) - [c43]Yaxin Liu, Richard Goodwin, Sven Koenig:
Risk-averse auction agents. AAMAS 2003: 353-360 - [c42]Jonas Svennebring, Sven Koenig:
Trail-Laying Robots for Robust Terrain Coverage. ICRA 2003: 75-82 - [c41]Craig A. Tovey, Sam Greenberg, Sven Koenig:
Improved analysis of D. ICRA 2003: 3371-3378 - [c40]Ananth Ranganathan, Sven Koenig:
A reactive robot architecture with planning on demand. IROS 2003: 1462-1468 - [c39]Marc Berhault, H. Huang, Pinar Keskinocak, Sven Koenig, Wedad Elmaghraby, Paul M. Griffin, Anton J. Kleywegt:
Robot exploration with combinatorial auctions. IROS 2003: 1957-1962 - [c38]Craig A. Tovey, Sven Koenig:
Improved analysis of greedy mapping. IROS 2003: 3251-3257 - 2002
- [j9]Sven Koenig, Yaxin Liu:
The interaction of representations and planning objectives for decision-theoretic planning tasks. J. Exp. Theor. Artif. Intell. 14(4): 303-326 (2002) - [c37]Sven Koenig, Maxim Likhachev:
D*Lite. AAAI/IAAI 2002: 476-483 - [c36]Yaxin Liu, Sven Koenig, David Furcy:
Speeding Up the Calculation of Heuristics for Heuristic Search-Based Planning. AAAI/IAAI 2002: 484-491 - [c35]Sven Koenig, David Furcy, Colin Bauer:
Heuristic Search-Based Replanning. AIPS 2002: 294-301 - [c34]Jonas Svennebring, Sven Koenig:
Towards Building Terrain-Covering Ant Robots. Ant Algorithms 2002: 202-215 - [c33]Sven Koenig, Maxim Likhachev:
Improved Fast Replanning for Robot Navigation in Unknown Terrain. ICRA 2002: 968-975 - [c32]Maxim Likhachev, Sven Koenig:
Incremental replanning for mapping. IROS 2002: 667-672 - [c31]Maxim Likhachev, Sven Koenig:
Speeding up the Parti-Game Algorithm. NIPS 2002: 1563-1570 - [e1]Sven Koenig, Robert C. Holte:
Abstraction, Reformulation and Approximation, 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings. Lecture Notes in Computer Science 2371, Springer 2002, ISBN 3-540-43941-2 [contents] - 2001
- [j8]Sven Koenig:
Minimax real-time heuristic search. Artif. Intell. 129(1-2): 165-197 (2001) - [j7]Sven Koenig:
Agent-Centered Search. AI Mag. 22(4): 109-132 (2001) - [j6]Sven Koenig, Boleslaw K. Szymanski, Yaxin Liu:
Efficient and inefficient ant coverage methods. Ann. Math. Artif. Intell. 31(1-4): 41-76 (2001) - [c30]Sven Koenig, Yaxin Liu:
Terrain coverage with ant robots: a simulation study. Agents 2001: 600-607 - [c29]Maxim Likhachev, Sven Koenig:
Lifelong Planning for Mobile Robots. Advances in Plan-Based Control of Robotic Agents 2001: 140-156 - [c28]Amin Atrash, Sven Koenig:
Probabilistic Planning for Behavior-Based Robots. FLAIRS 2001: 531-535 - [c27]Sven Koenig, Craig A. Tovey, William Halliburton:
Greedy Mapping of Terrain. ICRA 2001: 3594-3599 - [c26]Craig A. Tovey, Sven Koenig:
Greedy localization. IROS 2001: 427-432 - [c25]Sven Koenig, Maxim Likhachev:
Incremental A*. NIPS 2001: 1539-1546 - 2000
- [j5]David J. Musliner, Barney Pell, Wolff Dobson, Kai Goebel, Gautam Biswas, Sheila A. McIlraith, Giuseppina C. Gini, Sven Koenig, Shlomo Zilberstein, Weixiong Zhang:
Reports on the AAAI Spring Symposia (March 1999). AI Mag. 21(2): 79-84 (2000) - [j4]Sven Koenig:
'From Animals to Animats 5': Proceedings of the Fifth International Conference on Simulation of Adaptive Behavior. Artif. Life 6(3): 255-258 (2000) - [j3]Reid G. Simmons, Joaquín Lopez Fernández, Richard Goodwin, Sven Koenig, Joseph O'Sullivan:
Lessons learned from Xavier. IEEE Robotics Autom. Mag. 7(2): 33-39 (2000) - [c24]Craig A. Tovey, Sven Koenig:
Gridworlds as Testbeds for Planning with Incomplete Information. AAAI/IAAI 2000: 819-824 - [c23]David Furcy, Sven Koenig:
Speeding up the Convergence of Real-Time Search. AAAI/IAAI 2000: 891-897 - [c22]Sven Koenig, Yaxin Liu:
Representations of Decision-Theoretic Planning Tasks. AIPS 2000: 187-195 - [c21]Sven Koenig:
Planning-Task Transformations for Soft Deadlines. ATAL 2000: 305-319
1990 – 1999
- 1999
- [c20]Sven Koenig, Boleslaw K. Szymanski:
Value-Update Rules for Real-Time Search. AAAI/IAAI 1999: 718-724 - [c19]Sven Koenig, Yaxin Liu:
Sensor Planning with Non-linear Utility Functions. ECP 1999: 265-277 - 1998
- [c18]Sven Koenig, Reid G. Simmons:
Solving Robot Navigation Problems with Initial Pose Uncertainty Using Real-Time Heuristic Search. AIPS 1998: 145-153 - [c17]Sven Koenig:
Exploring Unknown Environments with Real-Time Search or Reinforcement Learning. NIPS 1998: 1003-1009 - 1997
- [j2]Reid G. Simmons, Richard Goodwin, Karen Zita Haigh, Sven Koenig, Joseph O'Sullivan, Manuela M. Veloso:
Xavier: experience with a layered robot architecture. SIGART Bull. 8(1-4): 22-33 (1997) - [c16]Reid G. Simmons, Richard Goodwin, Karen Zita Haigh, Sven Koenig, Joseph O'Sullivan:
A Layered Architecture for Office Delivery Robots. Agents 1997: 245-252 - [c15]Sven Koenig, Yury V. Smirnov:
Sensor-based planning with the freespace assumption. ICRA 1997: 3540-3545 - 1996
- [j1]Sven Koenig, Reid G. Simmons:
The Effect of Representation and Knowledge on Goal-Directed Exploration with Reinforcement-Learning Algorithms. Mach. Learn. 22(1-3): 227-250 (1996) - [c14]Sven Koenig, Reid G. Simmons:
Easy and Hard Testbeds for Real-Time Search Algorithms. AAAI/IAAI, Vol. 1 1996: 279-285 - [c13]Yury V. Smirnov, Sven Koenig, Manuela M. Veloso, Reid G. Simmons:
Efficient Goal-Directed Exploration. AAAI/IAAI, Vol. 1 1996: 292-297 - [c12]Reid G. Simmons, Sebastian Thrun, Greg Armstrong, Richard Goodwin, Karen Zita Haigh, Sven Koenig, Shyjan Mahamud, Daniel Nikovski, Joseph O'Sullivan:
Amelia. AAAI/IAAI, Vol. 2 1996: 1358 - [c11]Sven Koenig:
Agent-Centered Search: Situated Search with Small Look-Ahead. AAAI/IAAI, Vol. 2 1996: 1365 - [c10]Sven Koenig, Yury V. Smirnov:
Graph Learning with a Nearest Neighbor Approach. COLT 1996: 19-28 - [c9]Sven Koenig, Reid G. Simmons:
Passive Distance Learning for Robot Navigation. ICML 1996: 266-274 - [c8]Sven Koenig, Reid G. Simmons:
Unsupervised learning of probabilistic models for robot navigation. ICRA 1996: 2301-2308 - 1995
- [c7]Reid G. Simmons, Sven Koenig:
Probabilistic Robot Navigation in Partially Observable Environments. IJCAI 1995: 1080-1087 - [c6]Sven Koenig, Reid G. Simmons:
Real-Time Search in Non-Deterministic Domains. IJCAI 1995: 1660-1669 - [c5]Reid G. Simmons, Eric Krotkov, Lonnie Chrisman, Fábio Gagliardi Cozman, Richard Goodwin, Martial Hebert, Lalitesh Katragadda, Sven Koenig, Gita Krishnaswamy, Yoshikazu Shinoda, William Whittaker, Paul R. Klarer:
Experience with rover navigation for lunar-like terrains. IROS (1) 1995: 441-446 - [c4]Sven Koenig, Richard Goodwin, Reid G. Simmons:
Robot Navigation with Markov Models: A Framework for Path Planning and Learning with Limited Computational Resources. Reasoning with Uncertainty in Robotics 1995: 322-337 - 1994
- [c3]Sven Koenig, Reid G. Simmons:
How to Make Probabilistic Planners Risk-sensitive (Without Altering Anything). AIPS 1994: 293-298 - [c2]Sven Koenig, Reid G. Simmons:
Risk-Sensitive Planning with Probabilistic Decision Graphs. KR 1994: 363-373 - 1993
- [c1]Sven Koenig, Reid G. Simmons:
Complexity Analysis of Real-Time Reinforcement Learning. AAAI 1993: 99-107
Coauthor Index
[j63] [c285] [c282] [c278] [c277] [c276] [j60] [c269] [c264] [c261] [c260] [c259] [c254] [c244] [c241] [c239] [c234] [c223] [c219] [c215] [c211] [c210] [c203] [c200] [c198] [c194] [c189] [c186] [c184] [c182] [i23] [c179] [c176] [c170] [c168] [i19] [i18] [j32] [i3] [i2] [j27] [j26] [c77] [c75] [c73] [j19]
Daniel Harabor
aka: Daniel Damir Harabor
aka: Daniel Damir Harabor
Carlos Hernández 0003
aka: Carlos Hernández Ulloa
aka: Carlos Hernández Ulloa
[i59] [c287] [c285] [c283] [c281] [c280] [c276] [i50] [c269] [c268] [c266] [c262] [c260] [j55] [c254] [c253] [c251] [c248] [c245] [c241] [c238] [c235] [c232] [c228] [c224] [c222] [c216] [c215] [c214] [c213] [c212] [c209] [c208] [c206] [c205] [c200] [i30] [i29] [j43] [c198] [c196] [c195] [c194] [c191] [c190] [c187] [c186] [c182] [c180] [i23] [i22] [i21] [c179] [c178] [c177] [c176] [c174] [c173] [c172] [c170] [c169] [c168] [c166] [c165] [c164] [c163] [c162] [c161] [c159] [c158] [i20] [i19] [i18] [i17] [i16] [j35] [c157] [c156] [c155] [c154] [c153] [c152] [c151] [c149] [i12] [i11] [i10] [i9] [i8] [i7] [c148] [c147] [c146] [c144] [c143] [c141] [c140] [c138] [i5] [c128] [c126] [c120] [c118] [c117] [c116]
[i59] [i55] [i54] [c286] [c279] [i50] [i48] [i47] [j60] [j58] [c274] [c272] [c271] [c270] [i41] [j55] [c258] [c257] [c256] [c255] [c252] [c250] [c247] [c246] [c243] [c242] [c240] [c238] [i39] [i38] [i37] [i35] [i34] [j51] [c235] [c233] [c231] [c229] [c227] [c226] [c225] [c224] [i33] [i32] [c220] [c217] [c216] [c215] [c214] [c211] [c210] [c208] [c203] [c201] [c200] [i30] [i28] [i27] [c199] [c198] [c197] [c194] [c193] [c192] [c191] [c189] [c186] [c184] [c183] [c182] [c181] [i23] [c179] [c176] [c170] [i19] [i18] [i15] [c155] [i10]
[c268] [c247] [c246] [i38] [i37] [j51] [c231] [c225] [c222] [c217] [c215] [c201] [c200] [j44] [c199] [c198] [c197] [c196] [c193] [c192] [c191] [c189] [c186] [c184] [c183] [c182] [c181] [c180] [i23] [i21] [j40] [c179] [c176] [c170] [c168] [i20] [i19] [i18] [i16] [i15] [j36] [j35] [c157] [c156] [c155] [c151] [i12] [i11] [i10] [i7] [i6] [c148] [c147] [c146] [c145] [c138] [i5] [i4]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 00:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
