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.

  • 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).

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

  • 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).

  • 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 Annual Symposium on Combinatorial Search (SOCS-2017).

  • 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).

  • 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.

  • 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).

  • 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).

  • 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).

  • 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).

  • 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).

  • 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.

  • 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).

  • 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). Also: Proceedings of the Ninth International Symposium on Combinatorial Search (SOCS-2016).

  • 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).

  • [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). Also: Proceedings of the IJCAI-2016 Workshop on Multi-Agent Path Finding.

  • 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).

  • 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).

  • 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).

  • 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).

  • 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). Also: Proceedings of the Eighth International Symposium on Combinatorial Search (SOCS-2016). Also: Proceedings of the IJCAI-2016 Workshop on Multi-Agent Path Finding.

  • 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). Also: Proceedings of the AAMAS-2014 International Joint Workshop on Optimization in Multi-Agent Systems and Distributed Constraint Reasoning (OPTMAS-DCR-2014).

  • 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). Also: Proceedings of the AAAI-2014 Workshop on Artificial Intelligence and Robotics (AIRob-2014).

  • 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).

  • 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). Also: Proceedings of the Planning and Robotics Workshop at ICAPS-2013.

  • 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).

  • 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).

  • 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).

  • 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).

  • 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).

  • 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).

  • 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).

  • 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).

  • 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).

  • 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.

  • 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).

  • [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).

  • 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. Also: Planning and Scheduling: Frontiers in Artificial Intelligence and Applications. Vol. 117, IOS Press, L. Castillo, D. Borrajo, M. A. Salido & A. Oddi Editors.

  • 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.

  • 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).

  • 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).

  • 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).

  • 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).

  • 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).

  • 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).

  • 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).

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

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

  • 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).

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

  • 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).