T. K. Satish Kumar

154 papers A* 35A 17B 33C 2Misc 15Journal 31Unranked 20
YearRankTypeTitle / Venue / Authors
2026 J jnl
An Integrated Approach to Multi-agent Scheduling with Bounded Objectives in an Urban Setting.
ACM Trans. Spatial Algorithms Syst.
Fandel Lin, Han Zhang, T. K. Satish Kumar, Craig A. Knoblock
2025 B conf
Efficient Privacy-Preserving Network Path Validation.
ICCCN
Weizhao Jin, Erik Kline, T. K. Satish Kumar, Lincoln Thurlow, Srivatsan Ravi
2025 A conf
Empirical Hardness in Multi-Agent Pathfinding: Research Challenges and Opportunities.
AAMAS
Jingyao Ren, Eric Ewing, T. K. Satish Kumar, Sven Koenig, Nora Ayanian
2025 J jnl
Empirical Hardness in Multi-Agent Pathfinding: Research Challenges and Opportunities.
CoRR
Jingyao Ren, Eric Ewing, T. K. Satish Kumar, Sven Koenig, Nora Ayanian
2025 J jnl
Enhancing Lifelong Multi-Agent Path Finding with Cache Mechanism.
CoRR
Yimin Tang, Zhenghong Yu, Yi Zheng, T. K. Satish Kumar, Jiaoyang Li, Sven Koenig
2024 — conf
An Integrated Approach to Multi-Agent Scheduling with Bounded Objectives.
SIGSPATIAL/GIS
Fandel Lin, Han Zhang, T. K. Satish Kumar, Craig A. Knoblock
2024 A* conf
Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths.
ICAPS
Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Sven Koenig
2024 J jnl
Caching-Augmented Lifelong Multi-Agent Path Finding.
CoRR
Yimin Tang, Zhenghong Yu, Yi Zheng, T. K. Satish Kumar, Jiaoyang Li, Sven Koenig
2024 Misc conf
Constraint Composite Graph-Based Weighted CSP Solvers: An Empirical Study.
FLAIRS
Orazio Rillo, T. K. Satish Kumar
2024 C conf
FastMapSVM/FastMapSVR for Predictive Tasks on CSPs, SAT, and Weighted CSPs.
ICMLA
Kexin Zheng, Ang Li, T. K. Satish Kumar
2024 A* conf
Map Connectivity and Empirical Hardness of Grid-based Multi-Agent Pathfinding Problem.
ICAPS
Jingyao Ren, Eric Ewing, T. K. Satish Kumar, Sven Koenig, Nora Ayanian
2024 — conf
Rapidly Computing Approximate Graph Convex Hulls via FastMap.
LOD (2)
Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar
2024 B conf
Solving Facility Location Problems via FastMap and Locality Sensitive Hashing.
SOCS
Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar
2024 B conf
Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures.
SOCS
Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig
2024 B conf
Virtual Network Embedding as Boolean Satisfiability.
ICTAI
Pavel Surynek, Yi Zheng, Erik Kline, Sven Koenig, T. K. Satish Kumar
2023 — conf
A FastMap-Based Framework for Efficiently Computing Top-K Projected Centrality.
LOD (1)
Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar
2023 C conf
A Study of Distance Functions in FastMapSVM for Classifying Seismograms.
ICMLA
Kushal Sharma, Ang Li, Malcolm C. A. White, T. K. Satish Kumar
2023 Misc conf
Dynamic FastMap: An Efficient Algorithm for Spatiotemporal Embedding of Dynamic Graphs.
FLAIRS
Omkar Thakoor, T. K. Satish Kumar
2023 A* conf
Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies.
ICAPS
Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig
2023 A conf
FastMapSVM for Predicting CSP Satisfiability.
CP
Kexin Zheng, Ang Li, Han Zhang, T. K. Satish Kumar
2023 B conf
Improved Conflict-Based Search for the Virtual Network Embedding Problem.
ICCCN
Yi Zheng, Srivatsan Ravi, Erik Kline, Lincoln Thurlow, Sven Koenig, T. K. Satish Kumar
2023 A* conf
Priority-Based Search for the Virtual Network Embedding Problem.
ICAPS
Yi Zheng, Hang Ma, Sven Koenig, Erik Kline, T. K. Satish Kumar
2023 B conf
Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics.
SOCS
Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernández Ulloa, Sven Koenig
2023 J jnl
ð'ƒ3ð'‰ : Privacy-Preserving Path Validation System for Multi-Authority Sliced Networks.
IACR Cryptol. ePrint Arch.
Weizhao Jin, Erik Kline, T. K. Satish Kumar, Lincoln Thurlow, Srivatsan Ravi
2022 B conf
A FastMap-Based Algorithm for Block Modeling.
CPAIOR
Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar
2022 A* conf
A*pex: Efficient Approximate Multi-Objective Search on Graphs.
ICAPS
Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig
2022 B conf
Anytime Approximate Bi-Objective Search.
SOCS
Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig
2022 A* conf
Conflict-Based Search for the Virtual Network Embedding Problem.
ICAPS
Yi Zheng, Srivatsan Ravi, Erik Kline, Sven Koenig, T. K. Satish Kumar
2022 J jnl
FastMapSVM: Classifying Complex Objects Using the FastMap Algorithm and Support-Vector Machines.
CoRR
Malcolm C. A. White, Kushal Sharma, Ang Li, T. K. Satish Kumar, Nori Nakata
2022 — conf
FastPivot: An Algorithm for Inverse Problems.
CASE
Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar
2022 J jnl
Multi-agent path finding with mutex propagation.
Artif. Intell.
Han Zhang, Jiaoyang Li, Pavel Surynek, T. K. Satish Kumar, Sven Koenig
2022 B conf
Mutex Propagation in Multi-Agent Path Finding for Large Agents.
SOCS
Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
2022 B conf
The FastMap Pipeline for Facility Location Problems.
PRIMA
Omkar Thakoor, Ang Li, Sven Koenig, Srivatsan Ravi, Erik Kline, T. K. Satish Kumar
2022 A conf
Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data.
CP
Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar
2021 B conf
A Hierarchical Approach to Multi-Agent Path Finding.
SOCS
Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar, Sven Koenig
2021 A* conf
Conflict-Based Increasing Cost Search.
ICAPS
Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, T. K. Satish Kumar
2021 A conf
Differential Programming via OR Methods.
CP
Shannon Sweitzer, T. K. Satish Kumar
2021 Misc conf
Hysteresis in Combinatorial Optimization Problems.
FLAIRS
Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar
2021 A* conf
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses.
AAAI
Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig
2021 A* conf
Temporal Reasoning with Kinodynamic Networks.
ICAPS
Han Zhang, Neelesh Tiruviluamala, Sven Koenig, T. K. Satish Kumar
2020 B conf
Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP.
SOCS
Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar
2020 B conf
Embedding Directed Graphs in Potential Fields Using FastMap-D.
SOCS
Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar
2020 J jnl
Embedding Directed Graphs in Potential Fields Using FastMap-D.
CoRR
Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar
2020 A conf
Exact Approaches to the Multi-agent Collective Construction Problem.
CP
Edward Lam, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar
2020 B conf
Generating the Top $K$ Solutions to Weighted CSPs: A Comparison of Different Approaches.
ICTAI
Ang Li, Yuling Guan, Sven Koenig, Stephan Haas, T. K. Satish Kumar
2020 Misc conf
Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP.
ISAIM
Hong Xu, Kexuan Sun, Sven Koenig, Itay Hen, T. K. Satish Kumar
2020 A* conf
Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers.
AAAI
Ngai Meng Kou, Cheng Peng, Hang Ma, T. K. Satish Kumar, Sven Koenig
2020 A conf
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses.
AAMAS
Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig
2020 J jnl
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses.
CoRR
Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig
2020 A conf
Moving Agents in Formation in Congested Environments.
AAMAS
Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig
2020 B conf
Moving Agents in Formation in Congested Environments.
SOCS
Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig
2020 A* conf
Multi-Agent Path Finding with Mutex Propagation.
ICAPS
Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar
2020 B conf
Mutex Propagation for SAT-based Multi-agent Path Finding.
PRIMA
Pavel Surynek, Jiaoyang Li, Han Zhang, T. K. Satish Kumar, Sven Koenig
2019 A conf
A New Constraint Satisfaction Perspective on Multi-Agent Path Finding: Preliminary Results.
AAMAS
Jiangxing Wang, Jiaoyang Li, Hang Ma, Sven Koenig, T. K. Satish Kumar
2019 Misc conf
Automatic Adaptation to Sensor Replacements.
FLAIRS
Yuan Shi, T. K. Satish Kumar, Craig A. Knoblock
2019 B conf
Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery.
SOCS
Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig
2019 — conf
GAIA at SM-KBP 2019 - A Multi-media Multi-lingual Knowledge Extraction and Hypothesis Generation System.
TAC
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 R. McKeown, Yixiang Yao, Jennifer Chen, Eric Berquist, Kexuan Sun, Xujun Peng, Ryan Gabbard, Marjorie Freedman, Pedro A. Szekely, T. K. Satish Kumar, Arka Sadhu, Ram Nevatia, Miguel E. Rodríguez, Yifan Wang, Yang Bai, Ali Sadeghian, Daisy Zhe Wang
2019 J jnl
Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers.
CoRR
Ngai Meng Kou, Cheng Peng, Hang Ma, T. K. Satish Kumar, Sven Koenig
2019 A* conf
Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery.
AAAI
Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig
2019 A* conf
Multi-Agent Path Finding for Large Agents.
AAAI
Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig
2019 B conf
Multi-Agent Path Finding for Large Agents.
SOCS
Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig
2019 J jnl
Multi-Agent Path Finding with Capacity Constraints.
CoRR
Pavel Surynek, T. K. Satish Kumar, Sven Koenig
2019 B conf
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks.
SOCS
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
2019 J jnl
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks.
CoRR
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
2019 — conf
Multi-agent Path Finding with Capacity Constraints.
AI*IA
Pavel Surynek, T. K. Satish Kumar, Sven Koenig
2019 B conf
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning.
SOCS
Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig
2019 J jnl
PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning.
IEEE Robotics Autom. Lett.
Guillaume Sartoretti, Justin Kerr, Yunfei Shi, Glenn Wagner, T. K. Satish Kumar, Sven Koenig, Howie Choset
2019 B conf
Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph.
CPAIOR
Ka-Wa Yip, Hong Xu, Sven Koenig, T. K. Satish Kumar
2019 J jnl
Software Adaptation for an Unmanned Undersea Vehicle.
IEEE Softw.
Avi Pfeffer, Curt Wu, Gerald Fry, Kenny Lu, Steve Marotta, Michael Reposa, Yuan Shi, T. K. Satish Kumar, Craig A. Knoblock, David Parker, Irfan Muhammad, Chris Novakovic
2019 Misc conf
Top K Hypotheses Selection on a Knowledge Graph.
FLAIRS
Kexuan Sun, Krishna Akhil Maddali, Shriraj Salian, T. K. Satish Kumar
2019 A* conf
Using FastMap to Solve Graph Problems in a Euclidean Space.
ICAPS
Jiaoyang Li, Ariel Felner, Sven Koenig, T. K. Satish Kumar
2018 B conf
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs.
CPAIOR
Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar
2018 Misc conf
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs.
ISAIM
Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar
2018 A* conf
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding.
ICAPS
Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K. Satish Kumar, Sven Koenig
2018 Misc conf
Alert Generation in Execution Monitoring Using Resource Envelopes.
FLAIRS
T. K. Satish Kumar, Hong Xu, Zheng Tang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock
2018 A* conf
Anytime Focal Search with Applications.
IJCAI
Liron Cohen, Matias Greco, Hang Ma, Carlos Hernández, Ariel Felner, T. K. Satish Kumar, Sven Koenig
2018 J jnl
Combinatorial Problems in Multirobot Battery Exchange Systems.
IEEE Trans Autom. Sci. Eng.
Nitin Kamra, T. K. Satish Kumar, Nora Ayanian
2018 Misc conf
Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems.
ISAIM
Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar
2018 B conf
Constraint-Based Learning for Sensor Failure Detection and Adaptation.
ICTAI
Yuan Shi, T. K. Satish Kumar, Craig A. Knoblock
2018 — conf
Distributed Reinforcement Learning for Multi-robot Decentralized Collective Construction.
DARS
Guillaume Sartoretti, Yue Wu, William Paivine, T. K. Satish Kumar, Sven Koenig, Howie Choset
2018 — conf
GAIA - A Multi-media Multi-lingual Knowledge Extraction and Hypothesis Generation System.
TAC
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 R. McKeown, Dongyu Li, Xin Huang, Kexuan Sun, Xujun Peng, Ryan Gabbard, Marjorie Freedman, Mayank Kejriwal, Ram Nevatia, Pedro A. Szekely, T. K. Satish Kumar, Ali Sadeghian, Giacomo Bergami, Sourav Dutta, Miguel E. Rodríguez, Daisy Zhe Wang
2018 J jnl
Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery.
CoRR
Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig
2018 A* conf
Load Scheduling of Simple Temporal Networks Under Dynamic Resource Pricing.
AAAI
T. K. Satish Kumar, Zhi Wang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock
2018 B conf
Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems.
SOCS
Hong Xu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar
2018 A* conf
Multi-Agent Path Finding with Deadlines.
IJCAI
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
2018 J jnl
Multi-Agent Path Finding with Deadlines.
CoRR
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
2018 A conf
Multi-Agent Path Finding with Deadlines: Preliminary Results.
AAMAS
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
2018 J jnl
Multi-Agent Path Finding with Deadlines: Preliminary Results.
CoRR
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
2018 Misc conf
On the Linear Programming Duals of Temporal Reasoning Problems.
ISAIM
T. K. Satish Kumar, Zhi Wang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock
2018 J jnl
Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems.
CoRR
Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig
2018 J jnl
PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning.
CoRR
Guillaume Sartoretti, Justin Kerr, Yunfei Shi, Glenn Wagner, T. K. Satish Kumar, Sven Koenig, Howie Choset
2018 B conf
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers.
SOCS
Liron Cohen, Glenn Wagner, David M. Chan, Howie Choset, Nathan R. Sturtevant, Sven Koenig, T. K. Satish Kumar
2018 A conf
Rapid Randomized Restarts for Multi-Agent Path Finding: Preliminary Results.
AAMAS
Liron Cohen, Sven Koenig, T. K. Satish Kumar, Glenn Wagner, Howie Choset, David M. Chan, Nathan R. Sturtevant
2018 B conf
Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph.
PRIMA
Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar
2018 Misc conf
The Buss Reduction for the k-Weighted Vertex Cover Problem.
ISAIM
Hong Xu, Xin-Zeng Wu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar
2018 A* conf
The Factored Shortest Path Problem and Its Applications in Robotics.
ICAPS
Zhi Wang, Liron Cohen, Sven Koenig, T. K. Satish Kumar
2018 A* conf
The FastMap Algorithm for Shortest Path Computations.
IJCAI
Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar
2018 Misc conf
The FastMap Algorithm for Shortest Path Computations.
ISAIM
Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar
2018 A conf
Towards Effective Deep Learning for Constraint Satisfaction Problems.
CP
Hong Xu, Sven Koenig, T. K. Satish Kumar
2018 Misc conf
Towards Understanding the Min-Sum Message Passing Algorithm for the Minimum Weighted Vertex Cover Problem: An Analytical Approach.
ISAIM
Masaru Nakajima, Hong Xu, Sven Koenig, T. K. Satish Kumar
2018 J jnl
Trajectory Planning for Quadrotor Swarms.
IEEE Trans. Robotics
Wolfgang Hönig, James A. Preiss, T. K. Satish Kumar, Gaurav S. Sukhatme, Nora Ayanian
2017 A conf
A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP.
CP
Hong Xu, Sven Koenig, T. K. Satish Kumar
2017 B conf
A Distributed Logical Filter for Connected Row Convex Constraints.
ICTAI
T. K. Satish Kumar, Hong Xu, Zheng Tang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock
2017 B conf
A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs.
SOCS
Hong Xu, T. K. Satish Kumar, Sven Koenig
2017 — conf
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments.
AIIDE
Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig
2017 J jnl
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments.
CoRR
Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig
2017 A conf
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks.
AAMAS
Hang Ma, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
2017 J jnl
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks.
CoRR
Hang Ma, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
2017 J jnl
Measuring Territorial Control in Civil Wars Using Hidden Markov Models: A Data Informatics-Based Approach.
CoRR
Therese Anders, Hong Xu, Cheng Cheng, T. K. Satish Kumar
2017 — conf
Min-Max Message Passing and Local Consistency in Constraint Networks.
Australasian Conference on Artificial Intelligence
Hong Xu, T. K. Satish Kumar, Sven Koenig
2017 A* conf
Multi-Agent Path Finding with Delay Probabilities.
AAAI
Hang Ma, T. K. Satish Kumar, Sven Koenig
2017 J jnl
Overview: A Hierarchical Framework for Plan Generation and Execution in Multirobot Systems.
IEEE Intell. Syst.
Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig
2017 J jnl
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios.
CoRR
Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hönig, T. K. Satish Kumar, Tansel Uras, Hong Xu, Craig A. Tovey, Guni Sharon
2017 J jnl
Path Planning with Kinematic Constraints for Robot Groups.
CoRR
Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Sven Koenig, Nora Ayanian
2017 J jnl
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers.
CoRR
Liron Cohen, Glenn Wagner, T. K. Satish Kumar, Howie Choset, Sven Koenig
2017 A* conf
Summary: Multi-Agent Path Finding with Kinematic Constraints.
IJCAI
Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig
2017 J jnl
The FastMap Algorithm for Shortest Path Computations.
CoRR
Liron Cohen, T. K. Satish Kumar, Shiva Jahangiri, Aliyah Arunasalam, Tansel Uras, Sven Koenig
2017 B conf
The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP.
CPAIOR
Hong Xu, T. K. Satish Kumar, Sven Koenig
2016 B conf
A New Solver for the Minimum Weighted Vertex Cover Problem.
CPAIOR
Hong Xu, T. K. Satish Kumar, Sven Koenig
2016 B conf
Compliant Conditions for Polynomial Time Approximation of Operator Counts.
SOCS
Tathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar, Subbarao Kambhampati
2016 J jnl
Compliant Conditions for Polynomial Time Approximation of Operator Counts.
CoRR
Tathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar, Subbarao Kambhampati
2016 A conf
Formation change for robot groups in occluded environments.
IROS
Wolfgang Hönig, T. K. Satish Kumar, Hang Ma, Sven Koenig, Nora Ayanian
2016 A* conf
Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding.
IJCAI
Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian, Sven Koenig
2016 Misc conf
Kernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems.
ISAIM
T. K. Satish Kumar
2016 A conf
Local Search on Trees and a Framework for Automated Construction Using Multiple Identical Robots: (Extended Abstract).
AAMAS
Trevor Cai, David Y. Zhang, T. K. Satish Kumar, Sven Koenig, Nora Ayanian
2016 J jnl
Multi-Agent Path Finding with Delay Probabilities.
CoRR
Hang Ma, T. K. Satish Kumar, Sven Koenig
2016 A* conf
Multi-Agent Path Finding with Kinematic Constraints.
ICAPS
Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig
2016 A* conf
Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem.
AAAI
Hang Ma, Craig A. Tovey, Guni Sharon, T. K. Satish Kumar, Sven Koenig
2016 — conf
Planning, Scheduling and Monitoring for Airport Surface Operations.
AAAI Workshop: Planning for Hybrid Systems
Robert Morris, Corina S. Pasareanu, Kasper Søe Luckow, Waqar Malik, Hang Ma, T. K. Satish Kumar, Sven Koenig
2016 B conf
SAGL: A New Heuristic for Multi-Robot Routing with Complex Tasks.
ICTAI
Hong Xu, T. K. Satish Kumar, Dylan Johnke, Nora Ayanian, Sven Koenig
2014 A* conf
A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints.
AAAI
T. K. Satish Kumar, Duc Thien Nguyen, William Yeoh, Sven Koenig
2014 A* conf
A Tree-Based Algorithm for Construction Robots.
ICAPS
T. K. Satish Kumar, Sangmook Johnny Jung, Sven Koenig
2013 — conf
Incorrect Lower Bounds for Path Consistency and More.
SARA
T. K. Satish Kumar, Liron Cohen, Sven Koenig
2013 — conf
On the Traveling Salesman Problem with Simple Temporal Constraints.
SARA
T. K. Satish Kumar, Marcello Cirillo, Sven Koenig
2013 A* conf
Simple Temporal Problems with Taboo Regions.
AAAI
T. K. Satish Kumar, Marcello Cirillo, Sven Koenig
2013 — conf
Submodular Constraints and Planar Constraint Networks: New Results.
SARA
T. K. Satish Kumar, Liron Cohen, Sven Koenig
2008 A conf
A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems.
CP
T. K. Satish Kumar
2008 A* conf
CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem.
ICAPS
Blaine Nelson, T. K. Satish Kumar
2008 Misc conf
Lifting Techniques for Weighted Constraint Satisfaction Problems.
ISAIM
T. K. Satish Kumar
2007 A* conf
Fast (Incremental) Algorithms for Useful Classes of Simple Temporal Problems with Preferences.
IJCAI
T. K. Satish Kumar
2006 A* conf
On Some Tractable Cases of Logical Filtering.
ICAPS
T. K. Satish Kumar, Stuart Russell
2006 A* conf
Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints.
AAAI
T. K. Satish Kumar
2006 A* conf
Tractable Classes of Metric Temporal Problems with Domain Rules.
AAAI
T. K. Satish Kumar
2005 — —
Contributions to algorithmic techniques in automated reasoning about physical systems.
T. K. Satish Kumar
2005 A* conf
On the Tractability of Restricted Disjunctive Temporal Problems.
ICAPS
T. K. Satish Kumar
2005 B conf
On the Tractability of Smooth Constraint Satisfaction Problems.
CPAIOR
T. K. Satish Kumar
2004 A* conf
A Polynomial-Time Algorithm for Simple Temporal Problems with Piecewise Constant Domain Preference Functions.
AAAI
T. K. Satish Kumar
2004 — conf
On Disjunctive Representations of Distributions and Randomization.
SGAI Conf.
T. K. Satish Kumar
2003 A conf
Incremental Computation of Resource-Envelopes in Producer-Consumer Models.
CP
T. K. Satish Kumar
2002 — conf
An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection.
SARA
T. K. Satish Kumar
2002 — conf
Reformulating Combinatorial Optimization as Constraint Satisfaction.
SARA
T. K. Satish Kumar
2002 — conf
The Oracular Constraints Method.
SARA
T. K. Satish Kumar, Richard Dearden
2000 — conf
A Compositional Approach to Causality.
SARA
T. K. Satish Kumar
2000 — conf
Synergy between Compositional Modeling and Bayesian Networks.
SARA
T. K. Satish Kumar