Home › Publications

Publications

The following is a list of my peer-reviewed publications. I am still in the process of making them available for download here. In the meantime, most of them are available for download from other sources.

  1. Malcolm White, Kushal Sharma, Ang Li, T. K. Satish Kumar and Nori Nakata (2023). Classifying Seismograms Using the FastMap Algorithm and Support-Vector Machines. Nature Communications Engineering (NATURE-COMMSENG-2023).

  2. Kexin Zheng, Ang Li, Han Zhang and T. K. Satish Kumar (2023). FastMapSVM for Predicting CSP Satisfiability. Proceedings of the Twenty-Ninth International Conference on Principles and Practice of Constraint Programming (CP-2023).

  3. Ang Li, Peter Stuckey, Sven Koenig and T. K. Satish Kumar (2023). A FastMap-Based Framework for Efficiently Computing Top-K Projected Centrality. Proceedings of the Ninth International Conference on Machine Learning, Optimization, and Data Science (LOD-2023).

  4. Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernandez and Sven Koenig (2023). Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies. Proceedings of the First International Workshop on Search and Planning with Complex Objectives (WoSePCO-2023).

  5. Weizhao Jin, Erik Kline, T. K. Satish Kumar, Lincoln Thurlow and Srivatsan Ravi (2023). P3V: Privacy-Preserving Path Validation System for Multi-Authority Sliced Networks. Cryptology ePrint Archive, Paper 2023/053.

  6. Yi Zheng, Srivatsan Ravi, Erik Kline, Lincoln Thurlow, Sven Koenig and T. K. Satish Kumar (2023). Improved Conflict-Based Search for the Virtual Network Embedding Problem. Proceedings of the Thirty-Second International Conference on Computer Communications and Networks (ICCCN-2023).

  7. Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernandez and Sven Koenig (2023). Towards Effective Multi-Valued Heuristics for Bi-Objective Shortest-Path Algorithms via Differential Heuristics. Proceedings of the Sixteenth International Symposium on Combinatorial Search (SOCS-2023).

  8. Omkar Thakoor and T. K. Satish Kumar (2023). Dynamic FastMap: An Efficient Algorithm for Spatiotemporal Embedding of Dynamic Graphs. Proceedings of the Thirty-Sixth International FLAIRS Conference (FLAIRS-2023).

  9. Yi Zheng, Hang Ma, Sven Koenig, Erik Kline and T. K. Satish Kumar (2023). Priority-Based Search for the Virtual Network Embedding Problem. Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (ICAPS-2023).

  10. Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernandez and Sven Koenig (2023). Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies. Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (ICAPS-2023).

  11. Orazio Rillo (advised by T. K. Satish Kumar) (2022). The Minimum Weighted Vertex Cover Problem: A Substrate for the Weighted Constraint Satisfaction Problem. Master of Science Thesis, Department of Computer Science, Ecole Polytechnique Federale de Lausanne (EPFL), August 2022.

  12. Omkar Thakoor, Ang Li, Sven Koenig, Srivatsan Ravi, Erik Kline and T. K. Satish Kumar (2022). The FastMap Pipeline for Facility Location Problems. Proceedings of the Twenty-Fourth International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2022).

  13. Yuling Guan, Ang Li, Sven Koenig, Stephan Haas and T. K. Satish Kumar (2022). FastPivot: An Algorithm for Inverse Problems. Proceedings of the Eighteenth IEEE International Conference on Automation Science and Engineering (CASE-2022).

  14. Malcolm White, Kushal Sharma, Ang Li, T. K. Satish Kumar and Nori Nakata (2022). FastMapSVM: Classifying Complex Objects Using the FastMap Algorithm and Support-Vector Machines. https://arxiv.org/pdf/2204.05112v3.pdf.

  15. Han Zhang, Jiaoyang Li, Pavel Surynek, T. K. Satish Kumar and Sven Koenig (2022). Multi-Agent Path Finding with Mutex Propagation. Artificial Intelligence Journal (AIJ-2022).

  16. Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar and Sven Koenig (2022). Mutex Propagation in Multi-Agent Path Finding for Large Agents. Proceedings of the Fifteenth International Symposium on Combinatorial Search (SOCS-2022).

  17. Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernandez and Sven Koenig (2022). Anytime Approximate Bi-Objective Search. Proceedings of the Fifteenth International Symposium on Combinatorial Search (SOCS-2022).

  18. Chaithanya Basrur, Arambam Singh, Arunesh Sinha, Akshat Kumar and T. K. Satish Kumar (2022). Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data. Proceedings of the Twenty-Eighth International Conference on Principles and Practice of Constraint Programming (CP-2022).

  19. Yi Zheng, Srivatsan Ravi, Erik Kline, Sven Koenig and T. K. Satish Kumar (2022). Conflict-Based Search for the Virtual Network Embedding Problem. Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS-2022).

  20. Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernandez and Sven Koenig (2022). A*pex: Efficient Approximate Multi-Objective Search on Graphs. Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS-2022).

  21. Malcolm White, Kushal Sharma, Ang Li, T. K. Satish Kumar and Nori Nakata (2022). FastMapSVM: Classifying Seismograms Using the FastMap Algorithm and Support-Vector Machines. Seismological Research Letters 93(2B).

  22. Ang Li, Peter Stuckey, Sven Koenig and T. K. Satish Kumar (2022). A FastMap-Based Algorithm for Block Modeling. Proceedings of the Nineteenth International Conference on the Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR-2022).

  23. Monjoy Saha, Sagar Amin, Ashish Sharma, T. K. Satish Kumar and Rajiv Kalia (2022). AI-Driven Quantification of Ground Glass Opacities in Lungs of Covid-19 Patients Using 3D Computed Tomography Imaging. PLOS ONE Open Access Journal 17(3).

  24. Shannon Sweitzer and T. K. Satish Kumar (2021). Differential Programming via OR Methods. Proceedings of the Twenty-Seventh International Conference on Principles and Practice of Constraint Programming (CP-2021).

  25. Yuan Shi, Ang Li, T. K. Satish Kumar and Craig Knoblock (2021). Building Survivable Software Systems by Automatically Adapting to Sensor Changes. Special Issue Article on Advances in Aerial, Space, and Underwater Robotics in Journal of Applied Sciences (JAS-2021).

  26. Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar and Sven Koenig (2021). A Hierarchical Approach to Multi-Agent Path Finding. Proceedings of the ICAPS-2021 Hierarchical Planning Workshop (HPlan-2021).

  27. Monjoy Saha, Sagar Amin, Ashish Sharma, T. K. Satish Kumar and Rajiv Kalia (2021). AI-Driven Quantification of Ground Glass Opacities in Lungs of Covid-19 Patients Using 3D Computed Tomography Imaging. medRxiv/2021/260109.

  28. Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar and Sven Koenig (2021). A Hierarchical Approach to Multi-Agent Path Finding. Proceedings of the Fourteenth International Symposium on Combinatorial Search (SOCS-2021).

  29. Yuling Guan, Ang Li, Sven Koenig, Stephan Haas and T. K. Satish Kumar (2021). Hysteresis in Combinatorial Optimization Problems. Proceedings of the Thirty-Fourth International FLAIRS Conference (FLAIRS-2021).

  30. Han Zhang, Neelesh Tiruviluamala, Sven Koenig and T. K. Satish Kumar (2021). Temporal Reasoning with Kinodynamic Networks. Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling (ICAPS-2021).

  31. Thayne Walker, Nathan Sturtevant, Han Zhang, Jiaoyang Li, Ariel Felner and T. K. Satish Kumar (2021). Conflict-Based Increasing Cost Search. Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling (ICAPS-2021).

  32. Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph Durham, T. K. Satish Kumar and Sven Koenig (2021). Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI-2021).

  33. Connor Powers, Lindsay Bassman, Yifan Geng, Rajiv Kalia, T. K. Satish Kumar, Thomas Linker, Kuang Liu, Aiichiro Nakano, Pankaj Rajak and Priya Vashishta (2020). Denoising Autoencoders for High-Qubit Quantum Dynamics Simulations on Quantum Computers. Proceedings of the NeurIPS-2020 Workshop on Machine Learning and the Physical Sciences.

  34. Pavel Surynek, Jiaoyang Li, Han Zhang, T. K. Satish Kumar and Sven Koenig (2020). Mutex Propagation for SAT-Based Multi-Agent Path Finding. Proceedings of the Twenty-Third International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2020).

  35. Lindsay Bassman, Sahil Gulania, Connor Powers, Rongpeng Li, Thomas Linker, Kuang Liu, T. K. Satish Kumar, Rajiv Kalia, Aiichiro Nakano and Priya Vashishta (2020). Domain-Specific Compilers for Dynamic Simulations of Quantum Materials on Quantum Computers. Special Issue Article in Journal of Quantum Science and Technology (QST-2020).

  36. Edward Lam, Peter Stuckey, Sven Koenig and T. K. Satish Kumar (2020). Exact Approaches to the Multi-Agent Collective Construction Problem. Proceedings of the Twenty-Sixth International Conference on Principles and Practice of Constraint Programming (CP-2020).

  37. Ang Li, Yuling Guan, Sven Koenig, Stephan Haas and T. K. Satish Kumar (2020). Generating the Top K Solutions to Weighted CSPs: A Comparison of Different Approaches. Proceedings of the Thirty-Second International Conference on Tools with Artificial Intelligence (ICTAI-2020).

  38. Edward Lam, Peter Stuckey, Sven Koenig and T. K. Satish Kumar (2020). Exact Approaches to the Multi-Agent Collective Construction Problem. Proceedings of the Fourth International Workshop on Multi-Agent Path Finding (WoMAPF-2020).

  39. Sriram Gopalakrishnan, Liron Cohen, Sven Koenig and T. K. Satish Kumar (2020). Embedding Directed Graphs in Potential Fields Using FastMap-D. Proceedings of the Thirteenth International Symposium on Combinatorial Search (SOCS-2020).

  40. Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar and Sven Koenig (2020). Moving Agents in Formation in Congested Environments. Proceedings of the Thirteenth International Symposium on Combinatorial Search (SOCS-2020).

  41. [Best Paper Honorable Mention Award] Hong Xu, Kexuan Sun, Sven Koenig and T. K. Satish Kumar (2020). Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP. Proceedings of the Thirteenth International Symposium on Combinatorial Search (SOCS-2020).

  42. [Best Student Paper Award] Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig and T. K. Satish Kumar (2020). Multi-Agent Path Finding with Mutex Propagation. Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (ICAPS-2020).

  43. Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar and Sven Koenig (2020). Moving Agents in Formation in Congested Environments. Proceedings of the Nineteenth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2020).

  44. Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph Durham, T. K. Satish Kumar and Sven Koenig (2020). Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. Proceedings of the Nineteenth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2020).

  45. Yuling Guan, Ang Li, Sven Koenig, Stephan Haas and T. K. Satish Kumar (2020). A Combinatorial Perspective on Ising Model Hysteresis. American Physical Society, March Meeting (APS-2020).

  46. Hong Xu, Kexuan Sun, Sven Koenig, Itay Hen and T. K. Satish Kumar (2020). Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP. Proceedings of the Sixteenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2020).

  47. Ngai Meng Kou, Cheng Peng, Hang Ma, T. K. Satish Kumar and Sven Koenig (2020). Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers. Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-2020).

  48. Manling Li, Ying Lin, Ananya Subburathinam, Spencer Whitehead, Xiaoman Pan, Di Lu, Qingyun Wang, Tongtao Zhang, Lifu Huang, Heng Ji, Alireza Zareian, Hassan Akbari, Brian Chen, Bo Wu, Emily Allaway, Shih-Fu Chang, Kathleen McKeown, Yixiang Yao, Jennifer Chen, Eric Berquist, Kexuan Sun, Xujun Peng, Ryan Gabbard, Marjorie Freedman, Pedro Szekely, T. K. Satish Kumar, Arka Sadhu, Ram Nevatia, Miguel Rodriguez, Yifan Wang, Yang Bai, Ali Sadeghian and Daisy Zhe Wang (2019). GAIA at SM-KBP 2019 – A Multi-Media Multi-Lingual Knowledge Extraction and Hypothesis Generation System. Proceedings of the 2019 Text Analysis Conference (TAC-2019).

  49. Pavel Surynek, T. K. Satish Kumar and Sven Koenig (2019). Multi-Agent Path Finding with Capacity Constraints. Proceedings of the Eighteenth International Conference of the Italian Association for Artificial Intelligence (AIIA-2019).

  50. Ka Wa Yip, Hong Xu, Sven Koenig and T. K. Satish Kumar (2019). Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. In Nike Dattani’s open source book on Quadratization in Discrete Optimization and Quantum Mechanics.

  51. Liron Cohen, Tansel Uras, T. K. Satish Kumar and Sven Koenig (2019). Optimal and Bounded Suboptimal Multi-Agent Motion Planning. Proceedings of the Third International Workshop on Multi-Agent Path Finding (WoMAPF-2019).

  52. Hang Ma, Wolfgang Hoenig, T. K. Satish Kumar, Nora Ayanian and Sven Koenig (2019). Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery. Proceedings of the Third International Workshop on Multi-Agent Path Finding (WoMAPF-2019).

  53. Guillaume Sartoretti, Justin Kerr, Yunfei Shi, Glenn Wagner, T. K. Satish Kumar, Sven Koenig and Howie Choset (2019). PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning. Proceedings of the Third International Workshop on Multi-Agent Path Finding (WoMAPF-2019).

  54. Liron Cohen, Tansel Uras, T. K. Satish Kumar and Sven Koenig (2019). Optimal and Bounded Suboptimal Multi-Agent Motion Planning. Proceedings of the Twelfth International Symposium on Combinatorial Search (SOCS-2019).

  55. Roni Stern, Nathan Sturtevant, Dor Atzmon, Thayne Walker, Jiaoyang Li, Liron Cohen, Hang Ma, T. K. Satish Kumar, Ariel Felner and Sven Koenig (2019). Multi-Agent Path Finding: Definitions, Variants and Benchmarks. Proceedings of the Twelfth International Symposium on Combinatorial Search (SOCS-2019).

  56. Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar and Sven Koenig (2019). Multi-Agent Path Finding for Large Agents. Proceedings of the Twelfth International Symposium on Combinatorial Search (SOCS-2019).

  57. Hang Ma, Wolfgang Hoenig, T. K. Satish Kumar, Nora Ayanian and Sven Koenig (2019). Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery. Proceedings of the Twelfth International Symposium on Combinatorial Search (SOCS-2019).

  58. Jiaoyang Li, Ariel Felner, Sven Koenig and T. K. Satish Kumar (2019). Solving Graph Problems in a Euclidean Space Using FastMap. Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling (ICAPS-2019).

  59. Guillaume Sartoretti, Justin Kerr, Yunfei Shi, Glenn Wagner, T. K. Satish Kumar, Sven Koenig and Howie Choset (2019). PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning. IEEE Robotics and Automation Letters (RA-L-2019).

  60. Ka Wa Yip, Hong Xu, Sven Koenig and T. K. Satish Kumar (2019). Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. Proceedings of the Sixteenth International Conference on the Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR-2019).

  61. Yuan Shi, T. K. Satish Kumar and Craig Knoblock (2019). Automatic Adaptation to Sensor Replacements. Proceedings of the Thirty-Second International FLAIRS Conference (FLAIRS-2019).

  62. Kexuan Sun, Krishna Maddali, Shriraj Salian and T. K. Satish Kumar (2019). Top K Hypotheses Selection on a Knowledge Graph. Proceedings of the Thirty-Second International FLAIRS Conference (FLAIRS-2019).

  63. Jiangxing Wang, Jiaoyang Li, Hang Ma, Sven Koenig and T. K. Satish Kumar (2019). A New Constraint Satisfaction Perspective on Multi-Agent Path Finding: Preliminary Results. Proceedings of the Eighteenth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2019).

  64. Hong Xu (advised by T. K. Satish Kumar) (2019). Exploiting Structure in the Boolean Weighted Constraint Satisfaction Problem: A Constraint Composite Graph-Based Approach. Ph.D. Thesis, Department of Physics and Astronomy, University of Southern California, January 2019.

  65. Guillaume Sartoretti, Justin Kerr, Yunfei Shi, Glenn Wagner, T. K. Satish Kumar, Sven Koenig and Howie Choset (2019). PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning. Proceedings of the IEEE International Conference on Robotics and Automation (ICRA-2019).

  66. Hang Ma, Wolfgang Hoenig, T. K. Satish Kumar, Nora Ayanian and Sven Koenig (2019). Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-2019).

  67. Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar and Sven Koenig (2019). Multi-Agent Path Finding for Large Agents. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-2019).

  68. Avi Pfeffer, Curt Wu, Gerald Fry, Kenneth Lu, Stephen Marotta, Mike Reposa, Yuan Shi, T. K. Satish Kumar, Craig Knoblock, David Parker, Irfan Muhammad and Chris Novakovic (2019). Software Adaptation for an Unmanned Undersea Vehicle. IEEE Software, Building Long-Lived Adaptive Systems, 2019.

  69. Tongtao Zhang, Ananya Subburathinam, Ge Shi, Lifu Huang, Di Lu, Xiaoman Pan, Manling Li, Boliang Zhang, Qingyun Wang, Spencer Whitehead, Heng Ji, Alireza Zareian, Hassan Akbari, Brian Chen, Ruiqi Zhong, Steven Shao, Emily Allaway, Shih-Fu Chang, Kathleen McKeown, Dongyu Li, Xin Huang, Kexuan Sun, Xujun Peng, Ryan Gabbard, Marjorie Freedman, Mayank Kejriwal, Ram Nevatia, Pedro Szekely, T. K. Satish Kumar, Ali Sadeghian, Giacomo Bergami, Sourav Dutta, Miguel Rodriguez and Daisy Wang (2018). GAIA – A Multi-Media Multi-Lingual Knowledge Extraction and Hypothesis Generation System. Proceedings of the 2018 Text Analysis Conference (TAC-2018).

  70. Ferdinando Fioretto, Hong Xu, Sven Koenig and T. K. Satish Kumar (2018). Solving Multi-Agent Constraint Optimization Problems on the Constraint Composite Graph. Proceedings of the Twenty-First International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2018).

  71. Guillaume Sartoretti, Yue Wu, William Paivine, T. K. Satish Kumar, Sven Koenig and Howie Choset (2018). Distributed Reinforcement Learning for Multi-Robot Decentralized Collective Construction. Proceedings of the Fourteenth International Symposium on Distributed Autonomous Robotic Systems (DARS-2018).

  72. Yuan Shi, T. K. Satish Kumar and Craig Knoblock (2018). Constraint-Based Learning for Sensor Failure Detection and Adaptation. Proceedings of the Thirtieth International Conference on Tools with Artificial Intelligence (ICTAI-2018).

  73. Hong Xu, Sven Koenig and T. K. Satish Kumar (2018). Towards Effective Deep Learning for Constraint Satisfaction Problems. Proceedings of the Twenty-Fourth International Conference on Principles and Practice of Constraint Programming (CP-2018).

  74. Hong Xu, Cheng Cheng, Sven Koenig and T. K. Satish Kumar (2018). Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems. Proceedings of the Eleventh International Symposium on Combinatorial Search (SOCS-2018).

  75. Ferdinando Fioretto, Hong Xu, Sven Koenig and T. K. Satish Kumar (2018). Solving Multi-Agent Constraint Optimization Problems on the Constraint Composite Graph. Proceedings of the AAMAS-2018 International Workshop on Optimization in Multi-Agent Systems (OPTMAS-2018).

  76. Liron Cohen, Glenn Wagner, David Chan, Howie Choset, Nathan Sturtevant, Sven Koenig and T. K. Satish Kumar (2018). Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. Proceedings of the Eleventh International Symposium on Combinatorial Search (SOCS-2018).

  77. Liron Cohen, Matias Greco, Hang Ma, Carlos Hernandez, Ariel Felner, T. K. Satish Kumar and Sven Koenig (2018). Anytime Focal Search with Applications. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-2018).

  78. Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig and T. K. Satish Kumar (2018). The FastMap Algorithm for Shortest Path Computations. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-2018).

  79. Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar and Sven Koenig (2018). Multi-Agent Path Finding with Deadlines. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-2018).

  80. Wolfgang Hoenig, James Preiss, T. K. Satish Kumar, Gaurav Sukhatme and Nora Ayanian (2018). Trajectory Planning for Quadrotor Swarms. IEEE Transactions on Robotics (T-RO-2018).

  81. Nitin Kamra, T. K. Satish Kumar and Nora Ayanian (2018). Combinatorial Problems in Multi-Robot Battery Exchange Systems. IEEE Transactions on Automation Science and Engineering (TASE-2018).

  82. Hong Xu, Kexuan Sun, Sven Koenig and T. K. Satish Kumar (2018). A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. Proceedings of the Fifteenth International Conference on the Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR-2018).

  83. Zhi Wang, Liron Cohen, Sven Koenig and T. K. Satish Kumar (2018). The Factored Shortest Path Problem and Its Applications in Robotics. Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS-2018).

  84. Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K. Satish Kumar and Sven Koenig (2018). Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding. Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS-2018).

  85. Liron Cohen, Sven Koenig, T. K. Satish Kumar, Glenn Wagner, Howie Choset, David Chan and Nathan Sturtevant (2018). Rapid Randomized Restarts for Multi-Agent Path Finding Solvers: Preliminary Results. Proceedings of the Seventeenth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2018).

  86. Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar and Sven Koenig (2018). Multi-Agent Path Finding with Deadlines: Preliminary Results. Proceedings of the Seventeenth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2018).

  87. T. K. Satish Kumar, Hong Xu, Zheng Tang, Anoop Kumar, Craig Rogers and Craig Knoblock (2018). Alert Generation in Execution Monitoring Using Resource Envelopes. Proceedings of the Thirty-First International FLAIRS Conference (FLAIRS-2018).

  88. T. K. Satish Kumar, Zhi Wang, Anoop Kumar, Craig Rogers and Craig Knoblock (2018). Load Scheduling of Simple Temporal Networks Under Dynamic Resource Pricing. Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-2018).

  89. Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig and T. K. Satish Kumar (2018). The FastMap Algorithm for Shortest Path Computations. Proceedings of the Fifteenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2018).

  90. Masaru Nakajima, Hong Xu, Sven Koenig and T. K. Satish Kumar (2018). Towards Understanding the Min-Sum Message Passing Algorithm for the Minimum Weighted Vertex Cover Problem: An Analytical Approach. Proceedings of the Fifteenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2018).

  91. Ferdinando Fioretto, Hong Xu, Sven Koenig and T. K. Satish Kumar (2018). Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems. Proceedings of the Fifteenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2018).

  92. T. K. Satish Kumar, Zhi Wang, Anoop Kumar, Craig Rogers and Craig Knoblock (2018). On the Linear Programming Duals of Temporal Reasoning Problems. Proceedings of the Fifteenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2018).

  93. Hong Xu, Kexuan Sun, Sven Koenig and T. K. Satish Kumar (2018). A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. Proceedings of the Fifteenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2018).

  94. Hong Xu, Xin-Zeng Wu, Cheng Cheng, Sven Koenig and T. K. Satish Kumar (2018). The Buss Reduction for the k-Weighted Vertex Cover Problem. Proceedings of the Fifteenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2018).

  95. Therese Anders, Hong Xu, Cheng Cheng and T. K. Satish Kumar (2017). Measuring Territorial Control in Civil Wars Using Hidden Markov Models: A Data Informatics-Based Approach. Proceedings of the NIPS-2017 Workshop on Machine Learning for the Developing World.

  96. T. K. Satish Kumar, Hong Xu, Zheng Tang, Anoop Kumar, Craig Rogers and Craig Knoblock (2017). A Distributed Logical Filter for Connected Row Convex Constraints. Proceedings of the Twenty-Ninth International Conference on Tools with Artificial Intelligence (ICTAI-2017).

  97. Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar and Sven Koenig (2017). Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments. Proceedings of the Thirteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE-2017).

  98. Hong Xu, Sven Koenig and T. K. Satish Kumar (2017). A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP. Proceedings of the Twenty-Third International Conference on Principles and Practice of Constraint Programming (CP-2017).

  99. Hang Ma, Wolfgang Hoenig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian and Sven Koenig (2017). Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems. IEEE Intelligent Systems, 2017.

  100. Hong Xu, T. K. Satish Kumar and Sven Koenig (2017). Min-Max Message Passing and Local Consistency in Constraint Networks. Proceedings of the Thirtieth Australasian Joint Conference on Artificial Intelligence (AI-2017).

  101. Hong Xu, T. K. Satish Kumar and Sven Koenig (2017). A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. Proceedings of the Tenth International Symposium on Combinatorial Search (SOCS-2017).

  102. Sven Koenig and T. K. Satish Kumar (2017). A Case for Collaborative Construction as Testbed for Cooperative Multi-Agent Planning. Proceedings of the ICAPS-2017 Scheduling and Planning Applications Workshop (SPARK-2017).

  103. Wolfgang Hoenig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian and Sven Koenig (2017). Summary: Multi-Agent Path Finding with Kinematic Constraints. Proceedings of the IJCAI-2017 Sister Conference Best Paper Track.

  104. Hang Ma, Jiaoyang Li, T. K. Satish Kumar and Sven Koenig (2017). Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. Proceedings of the Sixteenth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2017).

  105. Hong Xu, T. K. Satish Kumar and Sven Koenig (2017). The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP. Proceedings of the Fourteenth International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR-2017).

  106. Hang Ma, T. K. Satish Kumar and Sven Koenig (2017). Multi-Agent Path Finding with Delay Probabilities. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-2017).

  107. Hong Xu, T. K. Satish Kumar, Dylan Johnke, Nora Ayanian and Sven Koenig (2016). SAGL: A New Heuristic for Multi-Robot Routing with Complex Tasks. Proceedings of the Twenty-Eighth International Conference on Tools with Artificial Intelligence (ICTAI-2016).

  108. Wolfgang Hoenig, T. K. Satish Kumar, Hang Ma, Sven Koenig and Nora Ayanian (2016). Formation Change for Robot Groups in Occluded Environments. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS-2016).

  109. Wolfgang Hoenig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian and Sven Koenig (2016). Multi-Agent Path Finding with Kinematic Constraints. Proceedings of the IJCAI-2016 Workshop on Multi-Agent Path Finding.

  110. Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hoenig, T. K. Satish Kumar, Tansel Uras, Hong Xu, Craig Tovey and Guni Sharon (2016). Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios. Proceedings of the IJCAI-2016 Workshop on Multi-Agent Path Finding.

  111. Hang Ma, Craig Tovey, Guni Sharon, T. K. Satish Kumar and Sven Koenig (2016). Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem. Proceedings of the IJCAI-2016 Workshop on Multi-Agent Path Finding.

  112. Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian and Sven Koenig (2016). Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding. Proceedings of the Ninth International Symposium on Combinatorial Search (SOCS-2016).

  113. Tathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar and Subbarao Kambhampati (2016). Compliant Conditions for Polynomial Time Approximation of Operator Counts. Proceedings of the Ninth International Symposium on Combinatorial Search (SOCS-2016).

  114. Hang Ma, Craig Tovey, Guni Sharon, T. K. Satish Kumar and Sven Koenig (2016). Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem. Proceedings of the Ninth International Symposium on Combinatorial Search (SOCS-2016).

  115. Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian and Sven Koenig (2016). Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding. Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-2016).

  116. Wolfgang Hoenig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Sven Koenig and Nora Ayanian (2016). Path Planning with Kinematic Constraints for Robot Groups. Proceedings of the 2016 Southern California Robotics Symposium (SCR-2016).

  117. [Best Robotics Paper Award] Wolfgang Hoenig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian and Sven Koenig (2016). Multi-Agent Path Finding with Kinematic Constraints. Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS-2016).

  118. Trevor Cai, David Zhang, T. K. Satish Kumar, Sven Koenig and Nora Ayanian (2016). Local Search on Trees and a Framework for Automated Construction Using Multiple Identical Robots. Proceedings of the Fifteenth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2016).

  119. Hong Xu, T. K. Satish Kumar and Sven Koenig (2016). A New Solver for the Minimum Weighted Vertex Cover Problem. Proceedings of the Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR-2016).

  120. T. K. Satish Kumar (2016). Kernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems. Proceedings of the Fourteenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2016).

  121. Robert Morris, Corina Pasareanu, Kasper Luckow, Waqar Malik, Hang Ma, T. K. Satish Kumar and Sven Koenig (2016). Planning, Scheduling and Monitoring for Airport Surface Operations. Proceedings of the AAAI-2016 Workshop on Planning for Hybrid Systems (PlanHS-2016).

  122. Hang Ma, Craig Tovey, Guni Sharon, T. K. Satish Kumar and Sven Koenig (2016). Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI-2016).

  123. T. K. Satish Kumar, Duc Thien Nguyen, William Yeoh and Sven Koenig (2014). A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints. Proceedings of the AAMAS-2014 International Joint Workshop on Optimization in Multi-Agent Systems and Distributed Constraint Reasoning (OPTMAS-DCR-2014).

  124. T. K. Satish Kumar, Duc Thien Nguyen, William Yeoh and Sven Koenig (2014). A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints. Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI-2014).

  125. T. K. Satish Kumar, Sangmook Jung and Sven Koenig (2014). A Tree-Based Algorithm for Construction Robots. Proceedings of the AAAI-2014 Workshop on Artificial Intelligence and Robotics (AIRob-2014).

  126. T. K. Satish Kumar, Sangmook Jung and Sven Koenig (2014). A Tree-Based Algorithm for Construction Robots. Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS-2014).

  127. T. K. Satish Kumar, Marcello Cirillo and Sven Koenig (2013). Simple Temporal Problems with Taboo Regions. Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI-2013).

  128. T. K. Satish Kumar, Marcello Cirillo and Sven Koenig (2013). On the Traveling Salesman Problem with Simple Temporal Constraints. Proceedings of the Planning and Robotics Workshop at ICAPS-2013.

  129. T. K. Satish Kumar, Marcello Cirillo and Sven Koenig (2013). On the Traveling Salesman Problem with Simple Temporal Constraints. Proceedings of the Tenth International Symposium on Abstraction, Reformulation and Approximation (SARA-2013).

  130. T. K. Satish Kumar, Liron Cohen and Sven Koenig (2013). Submodular Constraints and Planar Constraint Networks: New Results. Proceedings of the Tenth International Symposium on Abstraction, Reformulation and Approximation (SARA-2013).

  131. T. K. Satish Kumar, Liron Cohen and Sven Koenig (2013). Incorrect Lower Bounds for Path-Consistency and More. Proceedings of the Tenth International Symposium on Abstraction, Reformulation and Approximation (SARA-2013).

  132. T. K. Satish Kumar (2008). A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems. Proceedings of the Fourteenth International Conference on Principles and Practice of Constraint Programming (CP-2008).

  133. Blaine Nelson and T. K. Satish Kumar (2008). CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem. Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS-2008).

  134. T. K. Satish Kumar (2008). Lifting Techniques for Weighted Constraint Satisfaction Problems. Proceedings of the Tenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2008).

  135. T. K. Satish Kumar (2007). Fast (Incremental) Algorithms for Useful Classes of Simple Temporal Problems with Preferences. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-2007).

  136. T. K. Satish Kumar (2006). Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints. Proceedings of the Twenty-First AAAI National Conference on Artificial Intelligence (AAAI-2006).

  137. T. K. Satish Kumar (2006). Tractable Classes of Metric Temporal Problems with Domain Rules. Proceedings of the Twenty-First AAAI National Conference on Artificial Intelligence (AAAI-2006).

  138. T. K. Satish Kumar and Stuart Russell (2006). On Some Tractable Cases of Logical Filtering. Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS-2006).

  139. T. K. Satish Kumar (2005). Contributions to Algorithmic Techniques in Automated Reasoning about Physical Systems. Ph.D. Thesis, Computer Science Department, Stanford University, March 2005.

  140. T. K. Satish Kumar (2005). On the Tractability of Smooth Constraint Satisfaction Problems. Proceedings of the Second International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR-2005).

  141. [Best Student Paper Award] T. K. Satish Kumar (2005). On the Tractability of Restricted Disjunctive Temporal Problems. Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS-2005).

  142. T. K. Satish Kumar (2004). Differential Anti-Chain Algorithms for the Generalized Resource-Envelope Problem. Planning and Scheduling: Frontiers in Artificial Intelligence and Applications. Vol. 117, IOS Press, L. Castillo, D. Borrajo, M. A. Salido & A. Oddi Editors.

  143. T. K. Satish Kumar (2004). Differential Anti-Chain Algorithms for the Generalized Resource-Envelope Problem. Proceedings of the ECAI-2004 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems.

  144. T. K. Satish Kumar (2004). On Geometric CSPs with (Near)-Linear Domains and Max-Distance Constraints. Proceedings of the ECAI-2004 Workshop on Modeling and Solving Problems with Constraints.

  145. T. K. Satish Kumar (2004). A Polynomial-Time Algorithm for Simple Temporal Problems with Piecewise Constant Domain Preference Functions. Proceedings of the Nineteenth AAAI National Conference on Artificial Intelligence (AAAI-2004).

  146. T. K. Satish Kumar (2004). On Disjunctive Representations of Distributions and Randomization. Proceedings of the Twenty-Fourth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (AI-2004).

  147. T. K. Satish Kumar (2003). Incremental Computation of Resource-Envelopes in Producer-Consumer Models. Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP-2003).

  148. T. K. Satish Kumar (2002). SAT-Based Algorithms for Bayesian Network Inference. Proceedings of the Twenty-Second SGAI International Conference on Knowledge Based Systems and Applied Artificial Intelligence (ES-2002).

  149. T. K. Satish Kumar (2002). An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection. Proceedings of the Fifth International Symposium on Abstraction, Reformulation and Approximation (SARA-2002).

  150. T. K. Satish Kumar and Richard Dearden (2002). The Oracular Constraints Method. Proceedings of the Fifth International Symposium on Abstraction, Reformulation and Approximation (SARA-2002).

  151. T. K. Satish Kumar (2002). HCBFS: Combining Structure-Based and TMS-Based Approaches in Model-Based Diagnosis. Proceedings of the Thirteenth International Workshop on Principles of Diagnosis (DX-2002).

  152. T. K. Satish Kumar (2002). A Model Counting Characterization of Diagnoses. Proceedings of the Thirteenth International Workshop on Principles of Diagnosis (DX-2002).

  153. T. K. Satish Kumar (2001). QCBFS: Leveraging Qualitative Knowledge in Simulation-Based Diagnosis. Proceedings of the Fifteenth International Workshop on Qualitative Reasoning (QR-2001).

  154. T. K. Satish Kumar (2001). Fair-Coverage Monte Carlo Generation of Monotonic Functions within Envelopes. Proceedings of the Fifteenth International Workshop on Qualitative Reasoning (QR-2001).

  155. T. K. Satish Kumar (2000). A Compositional Approach to Causality. Proceedings of the Fourth International Symposium on Abstraction, Reformulation and Approximation (SARA-2000).

  156. T. K. Satish Kumar (2000). Reinterpretation of Causal Order Graphs Towards Effective Explanation Generation Using Compositional Modeling. Proceedings of the Fourteenth International Workshop on Qualitative Reasoning (QR-2000).